Generalized higher-order Voronoi diagrams on polyhedral surfaces

Proceedings - ISVD 2007 The 4th International Symposium on Voronoi Diagrams in Science and Engineering 2007

Volumn , Issue , 2007, Pages 74-83

  Fort, Marta ^a   Sellarès, J Antoni ^a  

^a UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS; WIRELESS SENSOR NETWORKS;

CONVEX POLYHEDRAL; POLYGONAL CHAINS; POLYGONAL REGIONS; POLYHEDRAL SURFACES; SHORTEST PATH DISTANCES; SHORTEST PATHS; VORONOI DIAGRAMS;

GRAPHIC METHODS;

EID: 47849094392     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISVD.2007.24     Document Type: Conference Paper

References (16)

1. F. Aurenhammer. Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv., 23(3):345-405, 1991.
2. F. Aurenhammer and R.Klein. Handbook of Computational Geometry, chapter Voronoi diagrams, pages 201-290. Elsevier, 2000.
3. N. Carr, J. Hart, and J. Maillot. The solid map: Methods for generating a 2-d texture map for solid texturing. In Proc. Western Computer Graphics Symposium, pages 179-190, 2000.
4. J. Chen and Y. Han. Shortest paths on a polyhedron. In SCG '90: Proceedings of the sixth annual symposium on Computational geometry, pages 360-369, New York, NY, USA, 1990. ACM Press.
5. I. Fisher and C. Gotsman. Fast approximation of high order voronoi diagrams and distance transforms on the GPU. Journal of Graphics Tools, 11(4):39-60, 2006.
6. M. S. Floater and K. Hormann. Surface parameterization: a tutorial and survey. In N. A. Dodgson, M. S. Floater, and M. A. Sabin, editors, Advances in multiresolution for geometric modelling, pages 157-186. Springer Verlag, 2005.
7. K. E. Hoff III, J. Keyser, M. Lin, D. Manocha, and T. Culver. Fast computation of generalized Voronoi diagrams using graphics hardware. Computer Graphics, 33(Annual Conference Series):277-286, 1999.
8. B. Kaneva and J. O'Rourke. An implementation of Chen and Han's shortest paths algorithm. In Proceedings of the 12th Canadian Conference on Computational Geometry, pages 139-146, 2000.
9. S. Kapoor. Efficient computation of geodesic shortest paths. In STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 770-779, 1999.
10. J. Mitchell. Handbook of Computational Geometry, chapter Geometric shortest paths and network optimization, pages 633-701. Elsevier Science Publishers B. V., 2000.
11. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16(4):647-668, 1987.
12. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellation: Concepts and Application of Voronoi Diagrams. John Wiley and Sons, 2000.
13. C. Sigg, R. Peikert, and M. Gross. Signed distance transform using graphics hardware. In VIS '03: Proceedings of the 14th IEEE Visualization 2003 (VIS'03), pages 83-90, 2003.
14. A. Sud, N. Govindaraju, R. Gayle, and D. Manocha. Interactive 3d distance field computation using linear factorization. In SI3D '06: Proceedings of the 2006 symposium on Interactive 3D graphics and games, pages 117-124, 2006.
15. A. Sud, M. Otaduy, and D. Manocha. DiFi: Fast 3d distance field computation using graphics hardware. In Eurographics, volume 23, pages 557-566, 2004.
16. V. Surazhsky, T. Surazhsky, D. Kirsanov, S. J. Gortler, and H. Hoppe. Fast exact and approximate geodesics on meshes. ACM Trans. Graph., 24(3):553-560, 2005.