Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/8852

Título:	Matching points with things
Autor/a:	Taslakian, Perouz; Seara Ojea, Carlos; Saumell Mendiola, Maria; Langerman, Stefan; Hurtado Díaz, Fernando Alfredo; Aloupis, Greg; Cardinal, Jean; Collette, Sébastien; Demaine, Erik D.; Demaine, Martin L.; Dulieu, Muriel; Fabila Monroy, Ruy; Hart, Vi
Otros autores:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
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.
Materia(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional -Computational geometry -Graph theory -Combinatorial analysis -Polygons -Geometria computacional -Grafs, Teoria de -Anàlisi combinatòria -Polígons
Derechos:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Tipo de documento:	Artículo - Versión publicada Objeto de conferencia
Editor:	Springer Verlag
Compartir:

Mostrar el registro completo del ítem