Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 2008Publisher:IEEEJournal:2008 International Conference on Computational Sciences and Its Applications

Authors: Fort, Marta; Sellarès i Chiva, Joan Antoni;

doi: 10.1109/iccsa.2008.21

handle: 10256/3060 , 2072/320704

Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces

- Summary
- Subjects
- Metrics

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

Related Organizations

University of Girona
Spain

Keywords

Computer geometry, Voronoi diagrams, Algorismes computacionals, Poliedres, Voronoi, Polígons de, Computer algorithms, Polyhedra, Geometria computacional

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average