Optimal Time Bounds for Some Proximity Problems in the Plane

@article{Aggarwal1992OptimalTB,
  title={Optimal Time Bounds for Some Proximity Problems in the Plane},
  author={Alok Aggarwal and Herbert Edelsbrunner and Prabhakar Raghavan and Prasoon Tiwari},
  journal={Inf. Process. Lett.},
  year={1992},
  volume={42},
  pages={55-60}
}
Aggarwal, A., H. Edelsbrunner, P. Raghavan and P. Tiwari, Optimal time bounds for some proximity problems in the plane, Information Processing Letters 42 (1992) 55-60. Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires R(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Lower bounds for algebraic computation trees with integer inputs

A.C.C. Yao
in: Proc. 30th Ann. IEEE Symp. otr Foundations of Computer Science, • 1989

Constrained Delaunay Triangulations

Symposium on Computational Geometry • 1987

Generalized Delaunay triangulations of planar graphs, Di.xrete

D. T. Lee, A. K. Lin
Comput. Geom • 1986

Compurational Geometry - An Inrroduction (Springer

F. P. Preparata, M. I. Shamos
New York, • 1985

Generalized Delaunay triangulations of planar graphs , Di

A. K. Lin
. xrete Comput . Geom . • 1983

Computational Geometry

M. I. Shamos
Ph.D. Thesis, • 1978

Similar Papers

Loading similar papers…