SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS

DOI10.1142/S0218195905001762MaRDI QIDQ5694057zbMATH OpenFDO

Authors Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides

Publication date 29 September 2005

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218195905001762

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Separating point sets in polygonal environments
• Partitioning point sets in space into disjoint convex polytopes
• Separating collections of points in Euclidean spaces
• scientific article; zbMATH DE number 4049041
• Partitioning point sets in arbitrary dimension
• Partitioning and separating sets of orthogonal polygons
• scientific article; zbMATH DE number 742976
• Separation and approximation of polyhedral objects
• Partitioning a planar point set into empty convex polygons
• Separating sets in interpolation and geometry

Cites work

• 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
• Computing the geodesic center of a simple polygon
• How to draw a planar graph on a grid
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• Minimum polygonal separation
• On the geodesic Voronoi diagram of point sites in a simple polygon
• Optimal shortest path queries in a simple polygon
• Separating objects in the plane by wedges and strips
• The furthest-site geodesic Voronoi diagram

Cited in

(21)

• Planar bichromatic minimum spanning trees
• Separating sets in interpolation and geometry
• Bottleneck bichromatic full Steiner trees
• Geometric separability using orthogonal objects
• Dispersing and grouping points on planar segments
• On the shortest separating cycle
• Dynamic minimum bichromatic separating circle
• The complexity of separating points in the plane
• On polygons excluding point sets
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• Geodesic order types
• Convex hulls in polygonal domains
• The complexity of separating points in the plane
• Geodesic-preserving polygon simplification
• Separating point sets in polygonal environments
• scientific article; zbMATH DE number 5204786 (Why is no real title available?)
• Planar Bichromatic Bottleneck Spanning Trees
• Cutting polygons into small pieces with chords: Laser-based localization
• On computing the maximum-volume bichromatic separating box
• Minimum plane bichromatic spanning trees
• Minimum plane bichromatic spanning trees

This page was built for publication: SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS

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