Mostra el registre d'ítem simple
Matching points with things
dc.contributor.author | Taslakian, Perouz |
dc.contributor.author | Seara Ojea, Carlos |
dc.contributor.author | Saumell Mendiola, Maria |
dc.contributor.author | Langerman, Stefan |
dc.contributor.author | Hurtado Díaz, Fernando Alfredo |
dc.contributor.author | Aloupis, Greg |
dc.contributor.author | Cardinal, Jean |
dc.contributor.author | Collette, Sébastien |
dc.contributor.author | Demaine, Erik D. |
dc.contributor.author | Demaine, Martin L. |
dc.contributor.author | Dulieu, Muriel |
dc.contributor.author | Fabila Monroy, Ruy |
dc.contributor.author | Hart, Vi |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2010-09-14T12:22:01Z |
dc.date.available | 2010-09-14T12:22:01Z |
dc.date.created | 2010 |
dc.date.issued | 2010 |
dc.identifier.citation | Aloupis, G. [et al.]. Matching points with things. A: Latin American Theoretical Informatics Symposium. "9th Latin American Theoretical Informatics Symposium". Oaxaca: Springer Verlag, 2010, p. 456-467. |
dc.identifier.isbn | 978-3-642-12199-9 |
dc.identifier.uri | http://hdl.handle.net/2117/8852 |
dc.description.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. |
dc.format.extent | 12 p. |
dc.language.iso | eng |
dc.publisher | Springer Verlag |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Computational geometry |
dc.subject.lcsh | Graph theory |
dc.subject.lcsh | Combinatorial analysis |
dc.subject.lcsh | Polygons |
dc.title | Matching points with things |
dc.type | Conference report |
dc.subject.lemac | Geometria computacional |
dc.subject.lemac | Grafs, Teoria de |
dc.subject.lemac | Anàlisi combinatòria |
dc.subject.lemac | Polígons |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.relation.publisherversion | http://www.springerlink.com/content/2208341h3p8q2057/fulltext.pdf |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 2749065 |
dc.description.version | Postprint (published version) |
local.citation.author | Aloupis, G.; Cardinal, J.; Collette, S.; Demaine, E.D.; Demaine, M.; Dulieu, M.; Fabila, R.; Hart, V.; Hurtado, F.; Langerman, S.; Saumell, M.; Seara, C.; Taslakian, P. |
local.citation.contributor | Latin American Theoretical Informatics Symposium |
local.citation.pubplace | Oaxaca |
local.citation.publicationName | 9th Latin American Theoretical Informatics Symposium |
local.citation.startingPage | 456 |
local.citation.endingPage | 467 |