Matching points with squares
From MaRDI portal
Publication:1006403
DOI10.1007/s00454-008-9099-1zbMath1191.52012MaRDI QIDQ1006403
Jorge Urrutia, Ferran Hurtado, Esther M. Arkin, Joseph S. B. Mitchell, Mikio Kano, Silvia Fernández-Merchant, Bernardo M. Ábrego
Publication date: 24 March 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9099-1
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)
52C05: Lattices and convex bodies in (2) dimensions (aspects of discrete geometry)
Cites Work
- Toughness and Delaunay triangulations
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- A non-Hamiltonian, nondegenerate Delaunay triangulation
- Guarding rectangular art galleries
- Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
- A Theorem on Planar Graphs
- Towards a Theory of Geometric Graphs
- Matching Points with Circles and Squares
- SOFSEM 2006: Theory and Practice of Computer Science