ISSN:
1432-0541
Keywords:
Key words. Geodesic Voronoi diagrams, Shortest paths, Polygon triangulation, Topological plane sweep, Computational geometry.
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract. We introduce a new method for computing the geodesic Voronoi diagram of point sites in a simple polygon and other restricted polygonal domains. Our method combines a sweep of the polygonal domain with the merging step of a usual divide-and-conquer algorithm. The time complexity is O((n+k) log(n+k)) where n is the number of vertices and k is the number of points, improving upon previously known bounds. Space is O(n+k) . Other polygonal domains where our method is applicable include (among others) a polygonal domain of parallel disjoint line segments and a polygonal domain of rectangles in the L 1 metric.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/PL00009199
Permalink