Efficiently determining a locally exact shortest path on polyhedral surfaces

CAD Computer Aided Design

Volumn 39, Issue 12, 2007, Pages 1081-1090

  Xin, Shi Qing ^a   Wang, Guo Jin ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Computational geometry; Discrete geodesics; Fast marching method; Shortest paths

Indexed keywords

ALGORITHMS; EULER EQUATIONS; ITERATIVE METHODS; OPTIMIZATION; WAVEFRONTS;

DISCRETE GEODESICS; FAST MARCHING METHOD (FMM); LOCALLY EXACT SHORTEST PATH (LESP); POLYHEDRAL SURFACE; WAVEFRONT EXPANSION;

COMPUTATIONAL GEOMETRY;

EID: 36448948684     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2007.08.001     Document Type: Article

References (38)

1. Agarwal PK, Har-Peled S, Karia M. Computing approximate shortest paths on convex polytopes. In: Symposium on computational geometry. 2000. p. 270-9
2. Sethian J.A. Fast marching methods. SIAM Review 41 2 (1999) 199-235
3. Sander PV, Wood ZJ, Gortler SJ, Snyder J, Hoppe H. Multi-chart geometry images. In: Proceedings of the 2003 eurographics/ACM SIGGRAPH symposium on geometry processing. 2003. p. 146-55
4. Peyré G., and Cohen L. Geodesic computations for fast and accurate surface remeshing and parameterization. Progress in Nonlinear Differential Equations and Their Applications 63 (2005) 157-171
5. Surazhsky V., Surazhsky T., Kirsanov D., Gortler S.J., and Hoppe H. Fast exact and approximate geodesics on meshes. ACM Transactions on Graphics 24 3 (2005) 553-560
6. Sharir M., and Schorr A. On shortest paths in polyhedral spaces. SIAM Journal on Computing 15 1 (1986) 193-215
7. Mitchell J.S.B., Mount D.M., and Papadimitriou C.H. The discrete geodesic problem. SIAM Journal on Computing 16 4 (1987) 647-668
8. Chen J, Han Y. Shortest paths on a polyhedron. In: Proceedings of the sixth annual symposium on computational geometry. 1990. p. 360-9
9. Kapoor S. Efficient computation of geodesic shortest paths. In: Proceedings of the thirty-first annual ACM symposium on theory of computing. 1999. p. 770-9
10. Xin S, Wang G. Improving Chen & Han's algorithm on the discrete geodesic problem [submitted for publication]
11. Har-Peled S. Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions. Discrete & Computational Geometry 21 2 (1999) 217-231
12. Hershberger J, Suri S. Practical methods for approximating shortest paths on a convex polytope in R3. In: Proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms. 1995. p. 447-56
13. Kanai T, Suzuki H. Approximate shortest path on polyhedral surface based on selective refinement of the discrete graph and its applications. In: Proceedings of the geometric modeling and processing 2000. 2000. p. 241
14. Agarwal P.K., Har-Peled S., Sharir M., and Varadarajan K.R. Approximate shortest paths on a convex polytope in three dimensions. Journal of the Association for Computing Machinery 44 (1997) 567-584
15. Varadarajan KR, Agarwal PK. Approximating shortest paths on a nonconvex polyhedron. In: IEEE symposium on foundations of computer science. 1997. p. 182-91
16. Kimmel R., and Sethian J. Computing geodesic paths on manifolds. Proceedings of National Academy of Sciences 95 15 (1998) 8431-8435
17. Novotni M, Klein R. Computing geodesic distances on triangular meshes. In: The 10th international conference in central Europe on computer graphics, visualization and computer vision'2002. 2002
18. Aleksandrov L, Maheshwari A, Sack J. An improved approximation algorithm for computing geometric shortest paths. In: FCT. 2003. p. 246-57
19. Har-Peled S. Constructing approximate shortest path maps in three dimensions. SIAM Journal on Computing 28 4 (1999) 1182-1197
20. Mount DM. On finding shortest paths on convex polyhedra. Technical report 1495. 1984
21. Papadimitriou C.H. An algorithm for shortest-path motion in three dimensions. Information Processing Letters 20 (1985) 259-263
22. Choi J., Sellen J., and Yap C.K. Approximate euclidean shortest paths in 3-space. International Journal of Computational Geometry and Applications 7 4 (1997) 271-295
23. Clarkson K. Approximation algorithms for shortest path motion planning. In: Proceedings of the nineteenth annual ACM conference on theory of computing. 1987. p. 56-65
24. Guibas L, Hershberger J, Leven D, Sharir M, Tarjan R. Linear time algorithms for visibility and shortest path problems inside simple polygons. In: Proceedings of the second annual symposium on computational geometry. 1986. p. 1-13
25. Martinez D, Velho L, Carvalho PC. Geodesic paths on triangular meshes. In: Proceedings of the computer graphics and image processing, XVII Brazilian symposium. 2004. p. 210-7
26. Tan X. Fast computation of shortest watchman routes in simple polygons. Information Processing Letters 77 1 (2001) 27-33
27. Dror M, Efrat A, Lubiw A, Mitchell JSB. Touring a sequence of polygons. In: Proceedings of the thirty-fifth annual ACM symposium on theory of computing. 2003. p. 473-82
28. Mitchell JSB, Sharir M. New results on shortest paths in three dimensions. In: Proceedings of the twentieth annual symposium on computational geometry. 2004. p. 124-33
29. Chopp D.L. Some improvements of the fast marching method. SIAM Journal on Scientific Computing 23 1 (2001) 230-244
30. Zigelman G., Kimmel R., and Kiryati N. Texture mapping using surface flattening via multi-dimensional scaling. IEEE Transactions on Visualization and Computer Graphics 8 1 (2002) 198-207
31. Zhou K, Synder J, Guo B, Shum HY. Iso-charts: stretch-driven mesh parameterization using spectral analysis. In: Proceedings of the 2004 eurographics/ACM SIGGRAPH symposium on geometry processing. 2004. p. 45-54
32. Saust A.B. A statistical investigation of the contamination of binary gravitational lens candidates by cataclysmic variables (1996). http://www.citebase.org/abstract?id=oai:arXiv.org:astro-ph/9606101
33. Yan J., and Zhuang T. Applying improved fast marching method to endocardial boundary detection in echocardiographic images. Pattern Recognition Letters 24 15 (2003) 2777-2784
34. Yatziv L., Bartesaghi A., and Sapiro G. O (N) implementation of the fast marching algorithm. Journal of Computational Physics 212 (2006) 393-399
35. Wang C.C.L. CyberTape: An interactive measurement tool on polyhedral surface. Computers & Graphics 28 5 (2004) 731-745
36. Danielsson PEE, Lin Q. A modified fast marching method. In: Scandinavian conference on image analysis. 2003. p. 1154-61
37. Telea A, Wijk JJ. An augmented fast marching method for computing skeletons and centerlines. In: Proceedings of the symposium on data visualisation 2002. 2002. p. 251-9
38. Dijkstra E.W. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271