Stabbing pairwise intersecting disks by four points
From MaRDI portal
Publication:6142366
DOI10.1007/s00454-023-00567-0arXiv1812.06907MaRDI QIDQ6142366
Pat Morin, Matthew J. Katz, Paz Carmi
Publication date: 21 December 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.06907
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ausgewählte Einzelprobleme der kombinatorischen Geometrie in der Ebene
- A subexponential bound for linear programming
- Stabbing pairwise intersecting disks by five points
- Largest bounding box, smallest diameter, and related problems on imprecise points
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
This page was built for publication: Stabbing pairwise intersecting disks by four points