On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the geodesic Voronoi diagram of point sites in a simple polygon |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the geodesic Voronoi diagram of point sites in a simple polygon |
scientific article |
Statements
On the geodesic Voronoi diagram of point sites in a simple polygon (English)
0 references
1989
0 references
Given a simple polygon with n sides in the plane and a set of k point ``sites'' in its interior or on the boundary, compute the Voronoi diagram of the set of sites using the internal ``geodesic'' distance inside the polygon as the metric. We describe an \(O((n+k)\log (n+k)\log n)-time\) algorithm for solving this problem and sketch a faster \(O((n+k)\log (n+k))\) algorithm for the case when the set of sites includes all reflex vertices of the polygon in question.
0 references
computational geometry
0 references
geodesic metric
0 references
shortest paths
0 references
simple polygon
0 references
Voronoi diagram
0 references
0 references
