Ítem
|
Fort, Marta
Sellarès i Chiva, Joan Antoni |
|
| 2008 | |
| 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 | |
| application/pdf | |
| Fort, M., i Sellares, J.A. (2008). Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces. International Conference on Computational Sciences and Its Applications : 2008 : ICCSA ’08, 394 - 404. Recuperat 28 setembre 2010, a http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4561244 | |
| 978-0-7695-3243-1 | |
| http://hdl.handle.net/10256/3060 | |
| eng | |
| IEEE | |
|
Reproducció digital del document publicat a: http://dx.doi.org/10.1109/ICCSA.2008.21 Articles publicats (D-IMA) |
|
| © International Conference on Computational Sciences and Its Applications : 2008 : ICCSA ’08, 2008, p. 394-404 | |
| Tots els drets reservats | |
|
Algorismes computacionals
Geometria computacional Voronoi, Polígons de Computer algorithms Computer geometry Voronoi diagrams Poliedres Polyhedra |
|
| Computing Distance Functions from Generalized Sources on Weighted Polyhedral Surfaces | |
| info:eu-repo/semantics/article | |
| DUGiDocs |
