Skip to main content
SpringerLink
Log in

Some problems in computational geometry

  • Problem Section
  • Published:
Algorithmica Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. J. L. Bentley and M. I. Shamos, Divide-and-conquer for linear expected time,Inform. Process. Lett.,7, (1978), 87–91.

    Article  MATH  MathSciNet  Google Scholar 

  2. J. L. Bentley and M. I. Shamos, Divide-and-conquer in multidemensional space,Eighth Annual ACM Symposium on Computing, 1976, pp. 220–230.

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm?SIAM J. Comput.,15 (1986), 287–299.

    Article  MATH  MathSciNet  Google Scholar 

  5. D. T. Lee and F. P. Preparata, Computational geometry-a survey,IEEE Trans. Comput.,33 (1984), 1072–1101.

    Article  MathSciNet  Google Scholar 

  6. A. Renyi and R. Sulanke, Über die konvexe Hülle vonn zufällig gewählten Punkten,Z. Wahrsch. Verw. Gebiete,2 (1963), 75–84.

    Article  MATH  MathSciNet  Google Scholar 

  7. L. A. Santalo,Integral Geometry and Geometric Probability, Addison-Wesley, Reading, MA, 1976.

    MATH  Google Scholar 

  8. 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.

  9. A. C. Yao, On constructing minimum spanning trees ink-dimensional spaces and related problems,SIAM J. Comput.,11 (1982), 721–736.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, Université de Paris-Sud (Orsay), Bât 490, 91 405, Orsay, France

    Claire Mathieu

Authors
  1. Claire Mathieu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Bernard Chazelle.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01840354

Keywords

Search

Navigation