The furthest-site geodesic Voronoi diagram
From MaRDI portal
Publication:1207795
DOI10.1007/BF02189321zbMath0770.68108MaRDI QIDQ1207795
Gordon Wilfong, Steven Fortune, Boris Aronov
Publication date: 16 May 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131246
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37)
Related Items (23)
The geodesic 2-center problem in a simple polygon ⋮ FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS ⋮ On the geodesic Voronoi diagram of point sites in a simple polygon ⋮ The geodesic diameter of polygonal domains ⋮ Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons ⋮ Farthest-point Voronoi diagrams in the presence of rectangular obstacles ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS ⋮ Blaschke-type theorem and separation of disjoint closed geodesic convex sets ⋮ Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon ⋮ Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon ⋮ Unnamed Item ⋮ A linear-time algorithm for the geodesic center of a simple polygon ⋮ Guarding Exterior Region of a Simple Polygon ⋮ Voronoi diagrams for a moderate-sized point-set in a simple polygon ⋮ EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS ⋮ Unnamed Item ⋮ The geodesic farthest-point Voronoi diagram in a simple polygon ⋮ Computing a geodesic two-center of points in a simple polygon ⋮ \(L_1\) geodesic farthest neighbors in a simple polygon and related problems ⋮ GEODESIC-PRESERVING POLYGON SIMPLIFICATION ⋮ An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- Visibility and intersection problems in plane geometry
- 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
- Computing geodesic furthest neighbors in simple polygons
- Algorithms for Reporting and Counting Geometric Intersections
- Euclidean shortest paths in the presence of rectilinear barriers
This page was built for publication: The furthest-site geodesic Voronoi diagram
