Two optimization problems for unit disks

DOI10.1016/j.comgeo.2017.12.001zbMath1433.68638arXiv1702.03266OpenAlexW2590924383MaRDI QIDQ1615636

Lazar Milinković, Sergio Cabello

Publication date: 31 October 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.03266

zbMATH Keywords

shortest path treegeometric graphimplementationunit disk graphminimum separation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Uses Software

• CGAL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of separating points in the plane
• Shortest paths in intersection graphs of unit disks
• On isolating points using unit disks
• On Isolating Points Using Disks
• Semi-dynamic Connectivity in the Plane
• Geometry helps in bottleneck matching and related problems

This page was built for publication: Two optimization problems for unit disks