Matching points with squares
DOI10.1007/S00454-008-9099-1zbMATH Open1191.52012OpenAlexW1990729778MaRDI QIDQ1006403FDOQ1006403
Authors: Esther M. Arkin, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, J. Urrutia, B. M. Ábrego, Silvia Fernández-Merchant 
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
Recommendations
- Matching Points with Circles and Squares
- SOFSEM 2006: Theory and Practice of Computer Science
- Matching points with rectangles and squares
- Matching points with things
- scientific article; zbMATH DE number 219276
- Finding squares and rectangles in sets of points
- Matching colored points with rectangles
- Matching Shapes with a Reference Point
- scientific article; zbMATH DE number 2200862
- Coloring points with respect to squares
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- A Theorem on Planar Graphs
- Toughness and Delaunay triangulations
- Matching Points with Circles and Squares
- Towards a Theory of Geometric Graphs
- 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
- SOFSEM 2006: Theory and Practice of Computer Science
Cited In (13)
- On maximum-sum matchings of points
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Title not available (Why is that?)
- SOFSEM 2006: Theory and Practice of Computer Science
- Matching points with disks with a common intersection
- Fixed-orientation equilateral triangle matching of point sets
- Matching random colored points with rectangles
- Strong matching of points with geometric shapes
- Matching colored points with rectangles
- Disjoint empty disks supported by a point set
- Matching Points with Circles and Squares
- 10-Gabriel graphs are Hamiltonian
- Matching points with rectangles and squares
This page was built for publication: Matching points with squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006403)
