Matching Points with Things

Matching Points with Things

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...

Full description

Bibliographic Details
Main Authors: Aloupis, Greg (Author), Cardinal, Jean (Author), Collette, Sebastien (Author), Dulieu, Muriel (Author), Fabila-Monroy, Ruy (Author), Hart, Vi (Author), Hurtado, Ferran (Author), Langerman, Stefan (Author), Saumell, Maria (Author), Seara, Carlos (Author), Taslakian, Perouz (Author), Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer Berlin / Heidelberg, 2012-06-25T18:30:35Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items