Journal of the ACM Bibliography

Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- geometric problems and computations

General Terms: Algorithms, Theory

Additional Key Words and Phrases: Decomposability, dynamization, geometric algorithms, semi-online model, Voronoi diagram

Selected papers that cite this one

• David Eppstein. Fast hierarchical clustering and other applications of dynamic closest pairs. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 619-628, San Francisco, California, 25-27 January 1998.

Selected references

• Jon Louis Bentley and Michael Ian Shamos. Divide-and-conquer in multidimensional space. In Conference Record of the Eighth Annual ACM Symposium on Theory of Computing, pages 220-230, Hershey, Pennsylvania, 3-5 May 1976.

• Bernard Chazelle and Joel Friedman. A deterministic view of random sampling and its use in geometry. In 29th Annual Symposium on Foundations of Computer Science, pages 539-549, White Plains, New York, 24-26 October 1988. IEEE.

• D. T. Lee. Two-dimensional Voronoi diagrams in the L_p-metric. Journal of the ACM, 27(4):604-618, October 1980.

Shortcuts: