Matching Points with Things
Name
Demaine-Matching points.pdf
Size
215.08 KB
Format
Adobe PDF
Checksum (MD5)
f2781123284c89808ef7e71e5bb273e0
Author(s)
Aloupis, Greg
Cardinal, Jean
Collette, Sebastien
Dulieu, Muriel
Fabila-Monroy, Ruy
Hart, Vi
Hurtado, Ferran
Langerman, Stefan
Saumell, Maria
Seara, Carlos
Date Issued
April 2010
Journal
LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings
Publisher
Springer Berlin / Heidelberg
Citation
Aloupis, Greg et al. “Matching Points with Things.” LATIN 2010: Theoretical Informatics. Ed. Alejandro López-Ortiz. Vol. 6034. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. 456–467. Web. 25 June 2012.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-12200-2_40
