Enclosing points with geometric objects

DOI10.4230/LIPICS.SOCG.2024.35MaRDI QIDQ6895867zbMATH OpenFDO

Authors Timothy M. Chan, Qizheng He, Jie Xue

Publication date 24 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2024.35

zbMATH Keywords

approximation algorithmsgeometric optimizationobstacle placement

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 1424289 (Why is no real title available?)
• scientific article; zbMATH DE number 7788390 (Why is no real title available?)
• A new algorithm for Euclidean shortest paths in the plane
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Approximating barrier resilience for arrangements of non-identical disk sensors
• Improved approximation bounds for the minimum constraint removal problem
• Minimum Cell Connection in Line Segment Arrangements
• On isolating points using unit disks
• On the complexity of barrier resilience for fat regions and bounded ply
• On the general motion-planning problem with two degrees of freedom
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Point separation and obstacle removal by finding and hitting odd cycles
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Separating two simple polygons by a sequence of translations
• The complexity of separating points in the plane
• Visibility of disjoint polygons

This page was built for publication: Enclosing points with geometric objects

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