Non-crossing matchings of points with geometric objects
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 p...
Main Authors: | 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 |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Elsevier
2015
|
Online Access: | http://hdl.handle.net/1721.1/99978 https://orcid.org/0000-0003-3803-5703 |
Similar Items
-
Matching Points with Things
by: Aloupis, Greg, et al.
Published: (2012) -
Necklaces, Convolutions, and X+Y
by: Bremner, David, et al.
Published: (2019) -
Necklaces, Convolutions, and X+Y
by: Bremner, David, et al.
Published: (2015) -
Linear reconfiguration of cube-style modular robots
by: Demaine, Erik D., et al.
Published: (2011) -
Common unfoldings of polyominoes and polycubes
by: Aloupis, Greg, et al.
Published: (2012)