Computational geometry: an introduction
Computational geometry: an introduction
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Heuristics for minimum decompositions of polygons
Heuristics for minimum decompositions of polygons
On the geodesic Voronoi diagram of point sites in a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
Voronoi diagrams with barriers and the shortest diagonal problem
Information Processing Letters
On the construction of abstract Voronoi diagrams, II
SIGAL '90 Proceedings of the international symposium on Algorithms
Fast algorithms for greedy triangulation
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
Let P be a simple planar polygon. We present a linear worst-case time algorithm for constructing the bounded Voronoi diagram of P in the Manhattan metric, where each point z in P belongs to the region of the closest vertex of P that is visible from z. Among other consequences, the minimal spanning tree of the vertices in the Manhattan metric that is contained in P can be computed within optimal linear time.