A matching problem in the plane

DOI10.1016/0022-0000(85)90065-0zbMath0576.68059OpenAlexW2043863928MaRDI QIDQ1064790

Mikhail J. Atallah

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90065-0

zbMATH Keywords

algorithmcomputational geometry

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items

Algorithms for ham-sandwich cuts ⋮ Advice complexity of online non-crossing matching ⋮ Complexity results on untangling red-blue matchings ⋮ On geometric graphs on point sets in the plane ⋮ FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS ⋮ Strongly stable and maximum weakly stable noncrossing matchings ⋮ Applications of a semi-dynamic convex hull algorithm ⋮ Structural properties of bichromatic non-crossing matchings ⋮ Simple algorithms for partial point set pattern matching under rigid motion ⋮ Applications of a semi-dynamic convex hull algorithm ⋮ ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS

Cites Work

• Maintenance of configurations in the plane
• Unnamed Item