Non-crossing matchings of points with geometric objects

DOI10.1016/j.comgeo.2012.04.005zbMath1254.65032OpenAlexW2122986136MaRDI QIDQ714905

Sébastien Collette, Maria Saumell, Stefan Langerman, Jean Cardinal, Ruy Fabila-Monroy, Perouz Taslakian, Muriel Dulieu, Martin L. Demaine, Ferran Hurtado, Greg Aloupis, Erik D. Demaine, Vi Hart, Carlos Seara

Publication date: 12 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.04.005

zbMATH Keywords

matchinggeometric objectsline segmentsnon-crossingfinite point setspoint-object pairs

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (13)

Configurations of non-crossing rays and related problems ⋮ Faster bottleneck non-crossing matchings of points in convex position ⋮ Advice complexity of online non-crossing matching ⋮ On maximum-sum matchings of points ⋮ Matching points with disks with a common intersection ⋮ Approximating the bottleneck plane perfect matching of a point set ⋮ Crossing-Free Perfect Matchings in Wheel Point Sets ⋮ Non-crossing Paths with Geographic Constraints ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Rainbow polygons for colored point sets in the plane ⋮ Flip distance to some plane configurations ⋮ Flip Distance to some Plane Configurations. ⋮ Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points

This page was built for publication: Non-crossing matchings of points with geometric objects