DocumentCode
2077278
Title
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
Author
Fort, Marta ; Sellares, J. Antoni
Author_Institution
Inst. d´´Inf. i Aplicacions, Univ. de Girona, Girona
fYear
2008
fDate
June 30 2008-July 3 2008
Firstpage
394
Lastpage
404
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.
Keywords
computational geometry; discrete k-order Voronoi diagrams; distance functions; generalized sources; graphics hardware capabalities; polygonal chains; weighted nonconvex polyhedral surface; Algorithms; Application software; Computational geometry; Computer applications; Computer graphics; Costs; Hardware; Information systems; Robots; Sun; Weighted polyhedral surface; distance function; k-order Voronoi diagram; shortest path;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Its Applications, 2008. ICCSA '08. International Conference on
Conference_Location
Perugia
Print_ISBN
978-0-7695-3243-1
Type
conf
DOI
10.1109/ICCSA.2008.21
Filename
4561244
Link To Document