Ítem


Approximating generalized distance functions on weighted triangulated surfaces with applications

Given P, a simple connected, possibly non-convex, polyhedral surface composed of positively weighted triangular faces, we consider paths from generalized sources (points, segments, polygonal chains or polygonal regions) to points on P that stay on P and avoid obstacles (segments, polygonal chains or polygonal regions). The distance function defined by a generalized source is a function that assigns to each point of P the cost of the shortest path from the source to the point. In this paper we present an algorithm for computing approximate generalized distance functions. We also provide an algorithm that computes a discrete representation of the approximate distance function and, as applications, algorithms for computing discrete order-k Voronoi diagrams and for approximately solving facility location problems. Finally, we present experimental results obtained with our implementation of the provided algorithms

This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02

Elsevier

Director: Ministerio de Ciencia e Innovación (Espanya)
Autor: Fort, Marta
Sellarès i Chiva, Joan Antoni
Data: 2012
Resum: Given P, a simple connected, possibly non-convex, polyhedral surface composed of positively weighted triangular faces, we consider paths from generalized sources (points, segments, polygonal chains or polygonal regions) to points on P that stay on P and avoid obstacles (segments, polygonal chains or polygonal regions). The distance function defined by a generalized source is a function that assigns to each point of P the cost of the shortest path from the source to the point. In this paper we present an algorithm for computing approximate generalized distance functions. We also provide an algorithm that computes a discrete representation of the approximate distance function and, as applications, algorithms for computing discrete order-k Voronoi diagrams and for approximately solving facility location problems. Finally, we present experimental results obtained with our implementation of the provided algorithms
This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2010-20590-C02-02
Format: application/pdf
Accés al document: http://hdl.handle.net/10256/11987
Llenguatge: eng
Editor: Elsevier
Col·lecció: info:eu-repo/semantics/altIdentifier/doi/10.1016/j.cam.2012.03.028
info:eu-repo/semantics/altIdentifier/issn/0377-0427
info:eu-repo/grantAgreement/MICINN//TIN2010-20590-C02-02/ES/AVANCES EN REALIDAD VIRTUAL PARA APLICACIONES PUNTERAS-UDG/
Drets: Tots els drets reservats
Matèria: Polígons
Polygons
Algorismes computacionals
Computer algorithms
Títol: Approximating generalized distance functions on weighted triangulated surfaces with applications
Tipus: info:eu-repo/semantics/article
Repositori: DUGiDocs

Matèries

Autors