The following pages link to A matching problem in the plane (Q1064790):
Displaying 18 items.
- Matching colored points with rectangles (Q511687) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- On a matching problem in the plane (Q1969786) (← links)
- Strongly stable and maximum weakly stable noncrossing matchings (Q1979449) (← links)
- Structural properties of bichromatic non-crossing matchings (Q2247147) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- Advice complexity of online non-crossing matching (Q2678256) (← links)
- On geometric graphs on point sets in the plane (Q2695466) (← links)
- The Euclidean Matching Problem (Q2822804) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)
- Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension (Q3303328) (← links)
- (Q3537184) (← links)
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS (Q4682161) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q5056119) (← links)
- FAST CLUSTERING AND MINIMUM WEIGHT MATCHING ALGORITHMS FOR VERY LARGE MOBILE BACKBONE WIRELESS NETWORKS (Q5696904) (← links)
- Complexity results on untangling red-blue matchings (Q6101837) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)