On a matching problem in the plane

DOI10.1016/S0012-365X(99)00201-0zbMath0953.52009OpenAlexW1990566310MaRDI QIDQ1969786

Adrian Dumitrescu, William Steiger

Publication date: 22 January 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00201-0

zbMATH Keywords

matchingcomputational geometryplanar arrangements

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items

On plane spanning trees and cycles of multicolored point sets with few intersections ⋮ A note on harmonic subgraphs in labelled geometric graphs ⋮ Discrete geometry on colored point sets in the plane -- a survey ⋮ Advice complexity of online non-crossing matching ⋮ On Hamiltonian alternating cycles and paths ⋮ Matching colored points with rectangles ⋮ Matching points with rectangles and squares ⋮ Matching random colored points with rectangles ⋮ Matching colored points in the plane: Some new results ⋮ A Bottleneck Matching Problem with Edge-Crossing Constraints ⋮ On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets