A sweepline algorithm for Voronoi diagrams

Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

Volumn , Issue , 1986, Pages 313-322

  Fortune, Steven ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

LINE SEGMENT; RUNNING TIME; SIMPLE ALGORITHM; SWEEP-LINE TECHNIQUE; VORONOI DIAGRAMS;

COMPUTATIONAL GEOMETRY;

EID: 85018151793     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/10515.10549     Document Type: Conference Paper

References (19)

1. F. Aurenhammer, H. Edelsbrunner, An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane, Pattern Recognition 17(2), 1984, pp. 251257.
2. J.L. Bentley, B. W. Weide, A.C. Yao, Optimal Expected-Time Algorithms for Closest Point Problems, ACM Transactions on Mathematical Software, 6(4), 1980, pp. 563-580.
3. L.P. Chew, R.L. Drysdale, Voronoi Diagrams based on Convex Distance Functions, Proceedings of the Symposium on Computational Geometry, June 1985, pp. 235-244.
4. H. Edelsbrunner, private communication, 1985.
5. S.J. Fortune, Fast Algorithms for Polygon Containment, Automata, Languages, and Programming, 12th Colloquium, in Lecture Notes in Computer Science 194, Springer-Verlag, New York, pp. 189-198.
6. P.J. Green, R. Sibson, Computing Dirichlet Tesselations in the Plane, Computer Journal, 21(22), 1977, pp. 168-173.
7. D. Kirkpatrick, Efficient Computation of Continuous Skeletons, Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979, pp. 18-27.
8. D.T. Lee, R.L. Drysdale, Generalizations of Voronoi Diagrams in the Plane, Siam J. Computing 10(1), 1981, pp. 73-87.
9. D.T. Lee, B.J. Schacter, Two Algorithms for Constructing a Delauney Triangulation, International Journal of Computer and Information Sciences, 9(3), 1980, pp. 219-227.
10. D. Leven.M. Sharir, Intersection Problems and Applications of Voronoi Diagrams, in Advances in Robotics, Vol I: Algorithmic and Geometric Aspects of Robotics, J. Schwartz, C.K. Yap, ed. Lawrence Erlbaum Associates, Ine, to appear.
11. D. Leven, M. Sharir, Planning a Purely Translational Motion for a Convex Object in Two-dimensional Space using Generalized Voronoi Diagrams, Technical Report 34/85, June 1985, Tel Aviv University
12. D.T. Lee, Medial Axis Transformation of a Planar Shape, IEEE Trans. Pattern Analysis and Machine Intelligence, VOL PAMI-4, 1982, pp. 363-369.
13. T. Ohya, M. Iri, K. Murota, Improvements of the Incremental Method for the Voronoi Diagram with Computational Comparison of Various Algorithms, Journal of the Operations Research Society of Japan, Vol 27(4), Dec 1984, pp. 306-336.
14. F.P. Preparata, The Medial Axis of a Simple Polygon, Proc. 6th Symp. Math Foundations of Comp. Science, Lecture Notes in Computer Science, Vol 53, Springer-Verlag, New York, pp. 443-450, 1977.
15. M.I. Shamos, D. Hoey, Closest-Point Problems, Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975, pp. 151-162.
16. R. Sedgewick, Algorithms, Addison Wesley, 1983.
17. N. Sarnak, R.E. Tarjan, Planar Point Location using Persistent Search Trees, manuscript, 1985.
18. R. Tuminaro, Computation of the Two Dimensional Voronoi Diagram in Expected Linear Time, manuscript, 1985.
19. C.K. Yap, An O(nlogn) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments, manuscript, October 1984.