Article PDF
Avoid common mistakes on your manuscript.
References
J. L. Bentley and M. I. Shamos, Divide-and-conquer for linear expected time,Inform. Process. Lett.,7, (1978), 87–91.
J. L. Bentley and M. I. Shamos, Divide-and-conquer in multidemensional space,Eighth Annual ACM Symposium on Computing, 1976, pp. 220–230.
J. L. Bentley, B. W. Weide, and A. C. Yao, Optimal expected-time algorithms for closest-point problems,ACM Trans. Math. Software,6 (1980), 563–580.
D. G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm?SIAM J. Comput.,15 (1986), 287–299.
D. T. Lee and F. P. Preparata, Computational geometry-a survey,IEEE Trans. Comput.,33 (1984), 1072–1101.
A. Renyi and R. Sulanke, Über die konvexe Hülle vonn zufällig gewählten Punkten,Z. Wahrsch. Verw. Gebiete,2 (1963), 75–84.
L. A. Santalo,Integral Geometry and Geometric Probability, Addison-Wesley, Reading, MA, 1976.
M. I. Shamos and D. Hoey, Closest point problems,Proceedings of the 16th Annual IEEE Symposium on Foundations of Computing Science, 1975, pp. 151–161.
A. C. Yao, On constructing minimum spanning trees ink-dimensional spaces and related problems,SIAM J. Comput.,11 (1982), 721–736.
Author information
Authors and Affiliations
Additional information
Communicated by Bernard Chazelle.
Rights and permissions
About this article
Cite this article
Mathieu, C. Some problems in computational geometry. Algorithmica 2, 131–134 (1987). https://doi.org/10.1007/BF01840354
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840354