Voronoi diagrams for a moderate-sized point-set in a simple polygon
From MaRDI portal
Publication:4580129
DOI10.4230/LIPICS.SOCG.2017.52zbMATH Open1432.68524arXiv1801.02292MaRDI QIDQ4580129FDOQ4580129
Authors: Eunjin Oh, Hee-Kap Ahn
Publication date: 13 August 2018
Full work available at URL: https://arxiv.org/abs/1801.02292
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cited In (19)
- Voronoi diagrams for polygon-offset distance functions
- The furthest-site geodesic Voronoi diagram
- Title not available (Why is that?)
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- A note on visibility-constrained Voronoi diagrams
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Title not available (Why is that?)
- Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
- Link distance and shortest path problems in the plane
- Title not available (Why is that?)
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- The Hausdorff Voronoi diagram of point clusters in the plane
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- 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)