Voronoi diagrams for a moderate-sized point-set in a simple polygon

DOI10.4230/LIPICS.SOCG.2017.52MaRDI QIDQ4580129zbMATH OpenFDO

Authors Eunjin Oh, Hee-Kap Ahn

Publication date 13 August 2018

Full work available at URL https://arxiv.org/abs/1801.02292

zbMATH Keywords

Voronoi diagramsgeodesic distancesimple polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Recommendations

• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
• On the geodesic Voronoi diagram of point sites in a simple polygon
• The geodesic farthest-point Voronoi diagram in a simple polygon
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon

Cited in

(19)

• Voronoi diagrams for polygon-offset distance functions
• The Hausdorff Voronoi diagram of point clusters in the plane
• The furthest-site geodesic Voronoi diagram
• scientific article; zbMATH DE number 4051001 (Why is no real title available?)
• Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
• scientific article; zbMATH DE number 4060214 (Why is no real title available?)
• On the geodesic Voronoi diagram of point sites in a simple polygon
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
• Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• Voronoi diagrams for a moderate-sized point-set in a simple polygon
• Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
• scientific article; zbMATH DE number 7559212 (Why is no real title available?)
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• Improved dynamic geodesic nearest neighbor searching in a simple polygon
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane
• Link distance and shortest path problems in the plane
• A note on visibility-constrained Voronoi diagrams
• The geodesic farthest-point Voronoi diagram in a simple polygon

This page was built for publication: Voronoi diagrams for a moderate-sized point-set in a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580129)