To access the full text documents, please follow this link: http://hdl.handle.net/10256/3060

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
Fort Masdevall, Marta; Sellarès i Chiva, Joan Antoni
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
2010-11-07
Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Computer geometry
Voronoi diagrams
Poliedres
Polyhedra
Tots els drets reservats
Article
IEEE
         

Show full item record

 

Coordination

 

Supporters