Ítem


Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces

We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites

IEEE

Autor: Fort, Marta
Sellarès i Chiva, Joan Antoni
Resum: We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a possibly non-convex polyhedral surface in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) on a polyhedral surface with obstacles. To obtain the discrete Voronoi diagrams our algorithms, exploiting hardware graphics capabilities, compute shortest path distances defined by the sites
Accés al document: http://hdl.handle.net/2072/295279
Llenguatge: eng
Editor: IEEE
Drets: Tots els drets reservats
Matèria: Algorismes computacionals
Grafs, Teoria de
Geometria computacional
Poliedres
Voronoi, Polígons de
Computer algorithms
Computational geometry
Graph theory
Polyhedra
Voronoi diagrams
Títol: Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces
Tipus: info:eu-repo/semantics/article
Repositori: Recercat

Matèries

Autors