Ítem


Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

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

IEEE

Autor: Fort, Marta
Sellarès i Chiva, Joan Antoni
Resum: 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
Accés al document: http://hdl.handle.net/2072/295268
Llenguatge: eng
Editor: IEEE
Drets: Tots els drets reservats
Matèria: Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Poliedres
Computer geometry
Voronoi diagrams
Polyhedra
Títol: Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
Tipus: info:eu-repo/semantics/article
Repositori: Recercat

Matèries

Autors