DUGi: Item | Recercat - Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces

Item

Author:	Fort, Marta Sellarès i Chiva, Joan Antoni
Abstract:	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
Document access:	http://hdl.handle.net/2072/94963
Language:	eng
Publisher:	IEEE
Rights:	Tots els drets reservats
Subject:	Algorismes computacionals Grafs, Teoria de Geometria computacional Poliedres Voronoi, Polígons de Computer algorithms Computational geometry Graph theory Polyhedra Voronoi diagrams
Title:	Generalized Higher-Order Voronoi Diagrams on Polyhedral Surfaces
Type:	info:eu-repo/semantics/article
Repository:	Recercat