MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Non-crossing matchings of points with geometric objects

Author(s)
Aloupis, Greg; Cardinal, Jean; Collette, Sebastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila-Monroy, Ruy; Hart, Vi; Hurtado, Ferran; Langerman, Stefan; Saumell, Maria; Seara, Carlos; Taslakian, Perouz; ... Show more Show less
Thumbnail
DownloadDemaine_Non-crossing matches.pdf (468.0Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution-Noncommercial-NoDerivatives http://creativecommons.org/licenses/by-nc-nd/4.0/
Metadata
Show full item record
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. In this paper, we address the algorithmic problem of determining whether a non-crossing matching exists between a given point–object pair. 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 size 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.
Date issued
2012-04
URI
http://hdl.handle.net/1721.1/99978
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Computational Geometry
Publisher
Elsevier
Citation
Aloupis, Greg, Jean Cardinal, Sebastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, et al. “Non-Crossing Matchings of Points with Geometric Objects.” Computational Geometry 46, no. 1 (January 2013): 78–92.
Version: Author's final manuscript
ISSN
09257721

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.