Show simple item record

dc.contributor.authorBarba, Luis
dc.contributor.authorKorman Cozzetti, Matías
dc.contributor.authorLangerman, Stefan
dc.contributor.authorSilveira, Rodrigo Ignacio
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2014-09-15T19:28:08Z
dc.date.created2014-10-01
dc.date.issued2014-10-01
dc.identifier.citationBarba, L. [et al.]. Computing a visibility polygon using few variables. "Computational geometry: theory and applications", 01 Octubre 2014, vol. 47, núm. 9, p. 918-926.
dc.identifier.issn0925-7721
dc.identifier.urihttp://hdl.handle.net/2117/24062
dc.description.abstractWe present several algorithms for computing the visibility polygon of a simple polygon P of n vertices (out of which r are reflex) from a viewpoint inside P, when P resides in read-only memory and only few working variables can be used. The first algorithm uses a constant number of variables, and outputs the vertices of the visibility polygon in O (n (r) over bar) time, where (r) over bar denotes the number of reflex vertices of P that are part of the output. Whenever we are allowed to use O(s) variables, the running time decreases to O (nr/2(s) + n log(2) r) (or O (nr/2(s) + n log r) randomized expected time), where s is an element of O (log r). This is the first algorithm in which an exponential space-time trade-off for a geometric problem is obtained. (C) 2014 Elsevier B.V. All rights reserved.
dc.format.extent9 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional
dc.subject.lcshComputational geometry
dc.subject.otherComputational geometry
dc.subject.otherMemory-constrained algorithms
dc.subject.otherTime-space-trade-off visibility
dc.subject.otherSimple polygon
dc.subject.otherLIMITED STORAGE
dc.subject.otherUPPER-BOUNDS
dc.titleComputing a visibility polygon using few variables
dc.typeArticle
dc.subject.lemacGeometria computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.identifier.doi10.1016/j.comgeo.2014.04.001
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S0925772114000509
dc.rights.accessRestricted access - publisher's policy
drac.iddocument15074858
dc.description.versionPostprint (published version)
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/FP7/251235/EU/Mathematical Foundations of High-Quality Terrain Models/MFHQTERRAINS
dc.date.lift10000-01-01
upcommons.citation.authorBarba, L.; Korman, M.; Langerman, S.; Silveira, R.I.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameComputational geometry: theory and applications
upcommons.citation.volume47
upcommons.citation.number9
upcommons.citation.startingPage918
upcommons.citation.endingPage926


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder