Recommendations
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- The geodesic farthest-point Voronoi diagram in a simple polygon
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
Cites work
- scientific article; zbMATH DE number 4051002 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- Algorithms for Reporting and Counting Geometric Intersections
- Computing geodesic furthest neighbors in simple polygons
- Computing the geodesic center of a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Triangulating a simple polygon
- Visibility and intersection problems in plane geometry
Cited in
(31)- Farthest-Polygon Voronoi Diagrams
- Facility location on a polyhedral surface
- On farthest Voronoi cells
- A linear-time algorithm for the geodesic center of a simple polygon
- FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
- 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
- On the Farthest Line-Segment Voronoi Diagram
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- scientific article; zbMATH DE number 140459 (Why is no real title available?)
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
- Euclidean farthest-point Voronoi diagram of a digital edge
- scientific article; zbMATH DE number 7559212 (Why is no real title available?)
- The geodesic diameter of polygonal domains
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- Farthest-polygon Voronoi diagrams
- scientific article; zbMATH DE number 3945378 (Why is no real title available?)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Guarding Exterior Region of a Simple Polygon
- The geodesic 2-center problem in a simple polygon
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Some computational aspects of geodesic convex sets in a simple polygon
- Geodesic-preserving polygon simplification
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- The geodesic farthest-point Voronoi diagram in a simple polygon
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
This page was built for publication: The furthest-site geodesic Voronoi diagram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207795)
