Mostra el registre d'ítem simple
Computing a visibility polygon using few variables
dc.contributor.author | Barba, Luis |
dc.contributor.author | Korman Cozzetti, Matías |
dc.contributor.author | Langerman, Stefan |
dc.contributor.author | Silveira, Rodrigo Ignacio |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2014-09-15T19:28:08Z |
dc.date.created | 2014-10-01 |
dc.date.issued | 2014-10-01 |
dc.identifier.citation | Barba, 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.issn | 0925-7721 |
dc.identifier.uri | http://hdl.handle.net/2117/24062 |
dc.description.abstract | We 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.extent | 9 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria computacional |
dc.subject.lcsh | Computational geometry |
dc.subject.other | Computational geometry |
dc.subject.other | Memory-constrained algorithms |
dc.subject.other | Time-space-trade-off visibility |
dc.subject.other | Simple polygon |
dc.subject.other | LIMITED STORAGE |
dc.subject.other | UPPER-BOUNDS |
dc.title | Computing a visibility polygon using few variables |
dc.type | Article |
dc.subject.lemac | Geometria computacional |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1016/j.comgeo.2014.04.001 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0925772114000509 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 15074858 |
dc.description.version | Postprint (published version) |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/FP7/251235/EU/Mathematical Foundations of High-Quality Terrain Models/MFHQTERRAINS |
dc.date.lift | 10000-01-01 |
local.citation.author | Barba, L.; Korman, M.; Langerman, S.; Silveira, R.I. |
local.citation.publicationName | Computational geometry: theory and applications |
local.citation.volume | 47 |
local.citation.number | 9 |
local.citation.startingPage | 918 |
local.citation.endingPage | 926 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.268]