Computational geometry: an introduction
Computational geometry: an introduction
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
Computing the link center of a simple polygon
SCG '87 Proceedings of the third annual symposium on Computational geometry
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Retraction: A new approach to motion-planning
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The furthest-site geodesic Voronoi diagram
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Manhattonian proximity in a simple polygon
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Geodesic Voronoi diagrams in the presence of rectilinear barriers
Nordic Journal of Computing
Properties and an approximation algorithm of round-tour Voronoi diagrams
Transactions on computational science IX
Properties and an approximation algorithm of round-tour Voronoi diagrams
Transactions on computational science IX
| Hi-index | 0.00 |
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 Voronol diagram of the set of sites using the internal “geodesic” distance inside the polygon as the metric. We describe an &Ogr;((n+k) log2(n+k)) time algorithm for solving this problem and sketch a faster &Ogr;((n+k) log(n+k)) algorithm for the case when the set of sites includes all reflex vertices of the polygon in question.