Show simple item record

dc.contributor.authorTaslakian, Perouz
dc.contributor.authorSeara Ojea, Carlos
dc.contributor.authorSaumell Mendiola, Maria
dc.contributor.authorLangerman, Stefan
dc.contributor.authorHurtado Díaz, Fernando Alfredo
dc.contributor.authorAloupis, Greg
dc.contributor.authorCardinal, Jean
dc.contributor.authorCollette, Sébastien
dc.contributor.authorDemaine, Erik D.
dc.contributor.authorDemaine, Martin L.
dc.contributor.authorDulieu, Muriel
dc.contributor.authorFabila Monroy, Ruy
dc.contributor.authorHart, Vi
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2010-09-14T12:22:01Z
dc.date.available2010-09-14T12:22:01Z
dc.date.created2010
dc.date.issued2010
dc.identifier.citationAloupis, 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.isbn978-3-642-12199-9
dc.identifier.urihttp://hdl.handle.net/2117/8852
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.
dc.format.extent12 p.
dc.language.isoeng
dc.publisherSpringer Verlag
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://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.lcshComputational geometry
dc.subject.lcshGraph theory
dc.subject.lcshCombinatorial analysis
dc.subject.lcshPolygons
dc.titleMatching points with things
dc.typeConference report
dc.subject.lemacGeometria computacional
dc.subject.lemacGrafs, Teoria de
dc.subject.lemacAnàlisi combinatòria
dc.subject.lemacPolígons
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.relation.publisherversionhttp://www.springerlink.com/content/2208341h3p8q2057/fulltext.pdf
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac2749065
dc.description.versionPostprint (published version)
local.citation.authorAloupis, 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.contributorLatin American Theoretical Informatics Symposium
local.citation.pubplaceOaxaca
local.citation.publicationName9th Latin American Theoretical Informatics Symposium
local.citation.startingPage456
local.citation.endingPage467


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record