Show simple item record

Matching Points with Things

dc.contributor.authorAloupis, Greg
dc.contributor.authorCardinal, Jean
dc.contributor.authorCollette, Sebastien
dc.contributor.authorDulieu, Muriel
dc.contributor.authorFabila-Monroy, Ruy
dc.contributor.authorHart, Vi
dc.contributor.authorHurtado, Ferran
dc.contributor.authorLangerman, Stefan
dc.contributor.authorSaumell, Maria
dc.contributor.authorSeara, Carlos
dc.contributor.authorTaslakian, Perouz
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDemaine, Martin L.
dc.date.accessioned2012-06-25T18:30:35Z
dc.date.available2012-06-25T18:30:35Z
dc.date.issued2010-04
dc.identifier.isbn978-3-642-12199-9
dc.identifier.urihttp://hdl.handle.net/1721.1/71205
dc.description.abstractGiven 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.en_US
dc.language.isoen_US
dc.publisherSpringer Berlin / Heidelbergen_US
dc.relation.isversionofhttp://dx.doi.org/ 10.1007/978-3-642-12200-2_40en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceOther Repositoryen_US
dc.titleMatching Points with Thingsen_US
dc.typeArticleen_US
dc.identifier.citationAloupis, 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.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverDemaine, Erik D.
dc.contributor.mitauthorDemaine, Erik D.
dc.contributor.mitauthorDemaine, Martin L.
dc.relation.journalLATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedingsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsAloupis, Greg; Cardinal, Jean; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila-Monroy, Ruy; Hart, Vi; Hurtado, Ferran; Langerman, Stefan; Saumell, Maria; Seara, Carlos; Taslakian, Perouzen
dc.identifier.orcidhttps://orcid.org/0000-0003-3803-5703
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail
Name:
Demaine-Matching points.pdf
Size:
215.0Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record