Matching points with squares

DOI10.1007/S00454-008-9099-1MaRDI QIDQ1006403zbMATHOpenAlexFDO

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

zbMATH Keywords

discrete geometryHamiltonian pathDelaunay triangulationsperfect matching

Mathematics Subject Classification ID

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)

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

Cites work

• A Theorem on Planar Graphs
• A non-Hamiltonian, nondegenerate Delaunay triangulation
• Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
• Guarding rectangular art galleries
• Matching Points with Circles and Squares
• SOFSEM 2006: Theory and Practice of Computer Science
• Toughness and Delaunay triangulations
• Towards a Theory of Geometric Graphs
• Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations

Cited in

(13)

• Matching Points with Circles and Squares
• SOFSEM 2006: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 2200862 (Why is no real title available?)
• Disjoint empty disks supported by a point set
• Fixed-orientation equilateral triangle matching of point sets
• 10-Gabriel graphs are Hamiltonian
• Strong matching of points with geometric shapes
• Matching points with disks with a common intersection
• On maximum-sum matchings of points
• Matching random colored points with rectangles
• Matching colored points with rectangles
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• 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)