STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Computing the minimum Hausdorff distance for point sets under translation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Matching points into noise regions: combinatorial bounds and algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximate decision algorithms for point set congruence
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
A Pseudo-Metric for Weighted Point Sets
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Improvements on Geometric Pattern Matching Problems
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Generalized Approzimate Algorithms for Point Set Congruence
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Pattern Matching for Spatial Point Sets
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Finding color and shape patterns in images
Finding color and shape patterns in images
Matching point sets with respect to the Earth Mover's Distance
Computational Geometry: Theory and Applications
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Compatible geometric matchings
Computational Geometry: Theory and Applications
Bottleneck non-crossing matching in the plane
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |
Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point-object pairs. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their number is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete.