Item


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

Author: Fort, Marta
Sellarès i Chiva, Joan Antoni
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
Document access: http://hdl.handle.net/2072/295268
Language: eng
Publisher: IEEE
Rights: Tots els drets reservats
Subject: Algorismes computacionals
Geometria computacional
Voronoi, Polígons de
Computer algorithms
Poliedres
Computer geometry
Voronoi diagrams
Polyhedra
Title: Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
Type: info:eu-repo/semantics/article
Repository: Recercat

Subjects

Authors