Piercing pairwise intersecting geodesic disks by five points
From MaRDI portal
Publication:2096392
DOI10.1016/j.comgeo.2022.101947OpenAlexW4296657974MaRDI QIDQ2096392
Meytal Maman, A. Karim Abu-Affash, Paz Carmi
Publication date: 16 November 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.05962
Theory of computing (68Qxx) General convexity (52Axx) Computing methodologies and applications (68Uxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- A new data structure for shortest path queries in a simple polygon
- Optimal shortest path queries in a simple polygon
- Stabbing pairwise intersecting disks by five points
- Piercing pairwise intersecting geodesic disks
This page was built for publication: Piercing pairwise intersecting geodesic disks by five points