Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces
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 desc...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2008 |
| País: | España |
| Recursos: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/3060 |
| Acesso em linha: | http://hdl.handle.net/10256/3060 |
| Access Level: | acceso abierto |
| Palavra-chave: | Algorismes computacionals Geometria computacional Voronoi, Polígons de Computer algorithms Poliedres Computer geometry Voronoi diagrams Polyhedra |
| Resumo: | 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 |
|---|