SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
From MaRDI portal
Publication:5694057
DOI10.1142/S0218195905001762zbMath1104.68116MaRDI QIDQ5694057
Ferran Hurtado, John Iacono, Jeff Erickson, Erik D. Demaine, Stefan Langerman, Mark H. Overmars, Henk G. Meijer, S. H. Whitesides
Publication date: 29 September 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Related Items (9)
Bottleneck bichromatic full Steiner trees ⋮ Plane bichromatic trees of low degree ⋮ Dynamic minimum bichromatic separating circle ⋮ Planar Bichromatic Bottleneck Spanning Trees ⋮ Geodesic order types ⋮ Diffuse reflection radius in a simple polygon ⋮ Unnamed Item ⋮ Planar bichromatic minimum spanning trees ⋮ GEODESIC-PRESERVING POLYGON SIMPLIFICATION
Cites Work
- Computing the geodesic center of a simple polygon
- How to draw a planar graph on a grid
- Minimum polygonal separation
- On the geodesic Voronoi diagram of point sites in a simple polygon
- The furthest-site geodesic Voronoi diagram
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- Computing geodesic furthest neighbors in simple polygons
- Optimal shortest path queries in a simple polygon
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
- Separating objects in the plane by wedges and strips
This page was built for publication: SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
