Mostrar el registro sencillo del ítem
Ponencia
Region inter-visibility in terrains
dc.creator | Kreveld, Marc van | es |
dc.creator | Moet, Esther | es |
dc.creator | Oostrum, René van | es |
dc.date.accessioned | 2017-03-06T07:42:34Z | |
dc.date.available | 2017-03-06T07:42:34Z | |
dc.date.issued | 2004 | |
dc.identifier.citation | Van Kreveld, M., Moet, E. y Van Oostrum, R. (2004). Region inter-visibility in terrains. En 20th European Workshop on Computational Geometry, Sevilla. | |
dc.identifier.uri | http://hdl.handle.net/11441/55275 | |
dc.description.abstract | A polyhedral terrain is the image of a piecewise linear continuous function de ned over the triangles of a triangulation in the xy- plane. Given a terrain with n vertices, two simply-connected regions (subsets of the triangles), and any constant e > 0, we an determine in O(n2+e) time and storage whether or not the two regions are completely inter-visible, which improves the O(n3) time complexity of a brute-force algorithm. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | 20th European Workshop on Computational Geometry (2004). | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Terrains | es |
dc.subject | Visibility | es |
dc.subject | GIS | es |
dc.subject | Data structures | es |
dc.title | Region inter-visibility in terrains | es |
dc.type | info:eu-repo/semantics/conferenceObject | es |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
idus.format.extent | 4 p. | es |
dc.eventtitle | 20th European Workshop on Computational Geometry | es |
dc.eventinstitution | Sevilla | es |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Region inter-visibility in ... | 167.7Kb | [PDF] | Ver/ | |