On computing the Voronoi diagram for restricted planar figures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 519 LNCS, Issue , 1991, Pages 54-64

  Djidjev, Hristo ^a   Lingas, Andrzej ^b  

^a BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; DATA STRUCTURES; DECISION TREES;

DECISION TREE MODELING; FINITE SEQUENCE; LINEAR TIME; VORONOI DIAGRAMS;

GRAPHIC METHODS;

EID: 84936672138     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028250     Document Type: Conference Paper

References (11)

1. A. Aggarwal, L.J. Guibas, J. Saxe and P.W. Shor, A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discrete and Computational Geometry 2 (1987), Springer Verlag.
2. B. Chazelle, A Theorem on Polygon Cutting with Applications. Proc. 23rd IEEE FOCS Symposium, 1982.
3. B. Chazelle, Triangulating a Simple Polygon in Linear Time. Proc. 31st IEEE FOCS Symposium, 1990.
4. H. Edelsbrunner, Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science 10, Springer Verlag, Berlin (1987).
5. S. Fortune, A Sweepline Algorithm for Voronoi Diagrams, Algorithmica 2(1987), pp. 153-174.
6. L.J. Guibas and J. Stolfi, Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams. In ACM Trans. Graphics 4 (1985), 74-123.
7. D.T. Lee and A. Lin, Generalized Delaunay Triangulations for Planar Graphs. In Discrete and Computational Geometry 1 (1986), Springer Verlag, pp. 201-217.
8. A. Lingas, On Partitioning Polygons. Proc. 1st ACM Symposium on Computational Geometry, Baltimore, 1985.
9. A. Lingas, Voronoi Diagrams with Barriers and the Shortest Diagonal Problem. In Information Processing Letters 32(1989), pp. 191-198.
10. F.P. Preparata and M.I. Shamos, Computational Geometry, An Introduction. Texts and Monographs in Theoretical Computer Science, Springer Verlag, New York (1985).
11. C. Wang and L. Schubert, An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments. In Proc. 3rd ACM Symposium on Computational Geometry, Waterloo, pp. 223-232, 1987.