A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains

Algorithmica (New York)

Volumn 20, Issue 4, 1998, Pages 319-352

  Papadopoulou, E ^a,b   Lee, D T ^a  

^a Northwestern University   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Computational geometry; Geodesic Voronoi diagrams; Polygon triangulation; Shortest paths; Topological plane sweep

Indexed keywords

EID: 4544341707     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009199     Document Type: Article

References (20)

1. B. Aronov. On the geodesic Voronoi diagram of point sites in a simple polygon, Algorithmica, 4 (1989), 109-140.
2. Ta. Asano and Te. Asano, Voronoi diagrams for points in a polygon, in Discrete Algorithms & Complexity: Perspective in Computing, D. S. Johnson, ed., Academic Press, New York, 1987, pp. 51-64.
3. F. Aurenhammer, Voronoi diagrams: a survey of a fundamental geometric data structure, ACM Comput. Surv., 23 (1991), 345-405.
4. B. Chazelle, Triangulating a simple polygon in lineartime, Discrete Comput. Geom., 6 (1991), 485-524.
5. L. P. Chew, Constrained Delaunay triangulations, Algorithmica, 4 (1989), 97-108.
6. P. J. deRezende, D. T. Lee, and Y. F. Wu, Rectilinear shortest paths with rectangular barriers, Discrete Comput. Geom., 4 (1989), 41-53.
7. S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica, 2 (1987), 153-174.
8. S. Guha and I. Suzuki, Proximity problems for points on a rectilinear plane with rectangular obstacles, Algorithmica, 17 (1997), 281-307.
9. L. J. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. E. Tarjan, Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2 (1987), 209-233.
10. L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, Proc. 19th IEEE Symp. on Foundations of Computer Science, 1978, pp. 8-21.
11. J. Hershberger and S. Suri, Efficient computation of Euclidean shortest paths in the plane, Proc. 34th Symp. on Foundations of Computer Science, 1993, pp. 508-517.
12. D. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput., 12(1) (1983), 28-35.
13. D. T. Lee and A. K. Lin, Generalized Delaunay triangulations for planar graphs, Discrete Comput. Geom., 1 (1986), 201-217.
14. D. T. Lee and F. P. Preparata, Euclidean shortest paths in the presence of rectilinear barriers, Networks, 14 (1984), 393-410.
15. 1 shortest paths among polygonal obstacles in the plane, Algorithmica, 8 (1992), 55-88.
16. J. S. B. Mitchell, Shortest paths among obstacles in the plane, Proc. 9th ACM Symp. on Computational Geometry, May 1993, pp. 308-317.
17. J. S. B. Mitchell, Shortest paths among obstacles in the plane, Internat. J. Comput. Geom. Appl., 6.3 (Sept. 1996), 309-332.
18. F. P. Preparata and M. I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, New York, 1985.
19. C. A. Wang and F. Chin, Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time, Lecture Notes in Computer Science, Vol. 979, Springer-Verlag, Berlin, 1995, pp. 280-294.
20. C. Wang and L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, Proc. 3rd ACM Symp. on Computational Geometry, 1987, pp. 223-232.