DUGiDocsComputing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
dc.contributor.author
dc.date.accessioned
2010-09-29T10:39:49Z
dc.date.available
2010-08-10T09:04:46Z
2010-09-29T10:39:49Z
dc.date.issued
2008
dc.identifier.citation
Fort, M., i Sellares, J.A. (2008). Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces. International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 394 - 404. Recuperat 28 setembre 2010, a http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4561244
dc.identifier.isbn
978-0-7695-3243-1
dc.identifier.uri
dc.description.abstract
We present algorithms for computing approximate distance functions and shortest paths from a generalized source (point, segment, polygonal chain or polygonal region) on a weighted non-convex polyhedral surface in which obstacles (represented by polygonal chains or polygons) are allowed. We also describe an algorithm for discretizing, by using graphics hardware capabilities, distance functions. Finally, we present algorithms for computing discrete k-order Voronoi diagrams
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
IEEE
dc.relation.isformatof
Reproducció digital del document publicat a: http://dx.doi.org/10.1109/ICCSA.2008.21
dc.relation.ispartof
© International Conference on Computational Sciences and Its Applications : 2008 : ICCSA '08, 2008, p. 394-404
dc.relation.ispartofseries
Articles publicats (D-IMA)
dc.rights
Tots els drets reservats
dc.subject
dc.title
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.identifier.doi