Item
Fort, 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 | |
http://hdl.handle.net/2072/295268 | |
eng | |
IEEE | |
Tots els drets reservats | |
Algorismes computacionals
Geometria computacional Voronoi, PolÃgons de Computer algorithms Poliedres Computer geometry Voronoi diagrams Polyhedra |
|
Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces | |
info:eu-repo/semantics/article | |
Recercat |