Mostra el registre d'ítem simple

dc.contributor.authorHurtado Díaz, Fernando Alfredo
dc.contributor.authorLöffler, Maarten
dc.contributor.authorMatos, Inés P.
dc.contributor.authorSacristán Adinolfi, Vera
dc.contributor.authorSaumell, Maria
dc.contributor.authorSilveira, Rodrigo Ignacio
dc.contributor.authorStaals, Frank
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.date.accessioned2014-12-23T18:23:25Z
dc.date.available2014-12-23T18:23:25Z
dc.date.created2013
dc.date.issued2013
dc.identifier.citationHurtado, F. [et al.]. Terrain visibility with multiple viewpoints. A: International Symposium on Algorithms and Computation. "Algorithms and Computation. Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), LNCS 8283". Hong Kong: Springer, 2013, p. 317-327.
dc.identifier.isbn978-3-642-45029-7
dc.identifier.urihttp://hdl.handle.net/2117/25140
dc.description.abstractWe study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider three fundamental visibility structures: the visibility map, the colored visibility map, and the Voronoi visibility map. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting.
dc.format.extent11 p.
dc.language.isoeng
dc.publisherSpringer
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::Matemàtica discreta::Teoria de grafs
dc.subject.lcshGraph theory
dc.titleTerrain visibility with multiple viewpoints
dc.typeConference report
dc.subject.lemacGeometria computacional
dc.contributor.groupUniversitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.identifier.doi10.1007/978-3-642-45030-3_30
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://link.springer.com/chapter/10.1007/978-3-642-45030-3_30
dc.rights.accessOpen Access
local.identifier.drac13045640
dc.description.versionPostprint (author’s final draft)
local.citation.authorHurtado, F.; Löffler, M.; Matos, I. P.; Sacristan, V.; Saumell, M.; Silveira, R.I.; Staals, F.
local.citation.contributorInternational Symposium on Algorithms and Computation
local.citation.pubplaceHong Kong
local.citation.publicationNameAlgorithms and Computation. Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), LNCS 8283
local.citation.startingPage317
local.citation.endingPage327


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple