Item
Fort, Marta
SellarÃ¨s i Chiva, Joan Antoni 

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 nonconvex 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  
http://hdl.handle.net/2072/94963  
eng  
IEEE  
Tots els drets reservats  
Algorismes computacionals
Grafs, Teoria de Geometria computacional Poliedres Voronoi, PolÃgons de Computer algorithms Computational geometry Graph theory Polyhedra Voronoi diagrams 

Generalized HigherOrder Voronoi Diagrams on Polyhedral Surfaces  
info:eurepo/semantics/article  
Recercat 