Strong matching of points with geometric shapes

DOI10.1016/j.comgeo.2017.06.009zbMath1380.05158arXiv1503.04871OpenAlexW2963276194MaRDI QIDQ1699290

Anil Maheshwari, Ahmad Biniaz, Michiel H. M. Smid

Publication date: 19 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.04871

zbMATH Keywords

geometric graphsmaximum matchingstrong matching

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Fixed-orientation equilateral triangle matching of point sets
• Toughness and Delaunay triangulations
• Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
• Matching points with rectangles and squares
• Matching points with squares
• Transitions in geometric minimum spanning trees
• There are planar graphs almost as good as the complete graph
• Matchings in higher-order Gabriel graphs
• On the stretch factor of convex Delaunay graphs
• Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
• Matching Points with Circles and Squares
• Geometrical Extrema Suggested by a Lemma of Besicovitch

This page was built for publication: Strong matching of points with geometric shapes