A linear-time randomized algorithm for the bounded voronoi diagram of a simple polygon

International Journal of Computational Geometry and Applications

Volumn 6, Issue 3, 1996, Pages 263-278

  Klein, Rolf ^a   Lingas, Andrzej ^b  

^a UNIVERSITY OF HAGEN   (Germany)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Bounded voronoi diagram; Generalized delaunay triangulation; Histogram decomposition; Randomized algorithm

Indexed keywords

EID: 0030506679     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000198     Document Type: Article

References (19)

1. A. Aggarwal, L.J. Guibas, J. Saxe, and P.W. Shot, "A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon," Discrete & Comput. Geometry, 4,6 (1989), 591-604.
2. F. Aurenhammer, "Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure", ACM Computing Surveys 23, 1991 pp. 345-405
3. B. Chazelle, "Triangulating a Simple Polygon in Linear Time," Discrete and Computational Geometry 6 (1991) pp. 485-524.
4. P. Chew, "Building Voronoi Diagrams for Convex Polygons in Linear Expected Time," Manuscript 1986.
5. P. Chew, "Constrained Delaunay Triangulations," Proc. 3rd ACM Symposium on Computational Geometry (1987) pp. 215-222.
6. H. Djidjev and A. Lingas, "On Computing the Voronoi Diagram for Restricted Planar Figures," Proc. WADS'91, LNCS 519 pp. 54-64, Springer Verlag.
7. R. Klein and A. Lingas, "Manhattonian Proximity in a Simple Polygon," Proc. 8th ACM Symposium on Computational Geometry (Berlin, 1992) pp. 312-319. To appear in Int. J. Comput. Geom. & Applications.
8. R. Klein and A. Lingas, "Manhattonian Proximity in a Simple Polygon," Proc. 8th ACM Symposium on Computational Geometry (Berlin, 1992) pp. 312-319. To appear in Int. J. Comput. Geom. & Applications.
9. R. Klein and ClingsA. Lingas, "A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon," Proc. 5CCCG (1993) pp. 370-374.
10. D.T. Lee and A. Lin, "Generalized Delaunay Triangulations for Planar Graphs," Discrete and Computational Geometry 1 (1986) pp. 201-217.
11. C. Levcopoulos, "Heuristics for Minimum Decompositions of Polygons," Linköping Studies in Science and Technology PhD thesis, no. 155.
12. C. Levcopoulos and A. Lingas, "Fast Algorithms for Greedy Triangulation," BIT 32:2 pp. 280-296; preliminary version in Proc. SWAT'90, LNCS 447, Springer Verlag.
13. C. Levcopoulos and A. Lingas, "Fast Algorithms for Greedy Triangulation," BIT 32:2 pp. 280-296; preliminary version in Proc. SWAT'90, LNCS 447, Springer Verlag.
14. A. Lingas, "Voronoi Diagrams with Barriers and the Shortest Diagonal Problem," Information Processing Letters 32 (1989) pp. 191-198.
15. A. Okabe, B. Boots, and K. Sugihara, "Spatial Tessellations, Concepts and Applications of Voronoi Diagrams," John Wiley & Sons, West Sussex (1992).
16. F.P. Preparata and M.I. Shamos, "Computational Geometry: An Introduction," Texts and Monographs in Theoretical Computer ScienceSpringer Verlag, New York, (1985).
17. R. Seidel, "Constrained Delaunay triangulations and Voronoi diagrams with obstacles," In Rep. 260, IIG-TU Graz, Austria pp. 178-191.
18. R. Seidel, "A simple and fast incremental and randomized algorithms for computing trapezoidal decompositions and for triangulating polygons," Computational Geometry: Theory and Applications, vol. 1, no. 1 (1991).
19. C. Wang and L. Schubert, vol"An Optimal Algorithm for Constructing the Delaunay Triangulation of a Set of Line Segments," Proc. 3rd ACM Symposium on Computational Geometry, Waterloo pp. 223-232, 1987.