Applying the improved Chen and Han's algorithm to different versions of shortest path problems on a polyhedral surface

CAD Computer Aided Design

Volumn 42, Issue 10, 2010, Pages 942-951

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

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Computational geometry; Discrete geodesic problem; Voronoi diagram

Indexed keywords

APPROXIMANTS; COMMON OPERATIONS; COMPUTER GRAPHICS APPLICATIONS; DELAUNAY TRIANGULATION; DIJKSTRA'S ALGORITHMS; DISCRETE GEODESIC; DISTANCE VALUES; DISTANCE-BASED; EXACT ALGORITHMS; EXACT SOLUTION; MULTIPLE SOURCE; MULTISOURCES; POLYHEDRAL SURFACE; PRACTICAL METHOD; PRECISION PARAMETER; SHORTEST PATH; SHORTEST PATH ALGORITHMS; SHORTEST PATH PROBLEM; SINGLE SOURCE; SURFACE POINTS; UNFOLDING TECHNIQUES; VORONOI DIAGRAM; VORONOI DIAGRAMS;

ALGORITHMS; COMPUTER GRAPHICS; GEODESY; GRAPH THEORY; WIRELESS SENSOR NETWORKS;

COMPUTATIONAL GEOMETRY;

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

References (27)

1. J.S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou The discrete geodesic problem SIAM J Comput 16 4 1987 647 668
2. J. Sethian Fast marching methods SIAM Rev 41 2 1999 199 235
3. Agarwal PK, Har-Peled S, Karia M. Computing approximate shortest paths on convex polytopes. In: Symposium on computational geometry. 2000. p. 2709.
4. J.S. Mitchell Geometric shortest paths and network optimization Handbook of computational geometry 1998 Elsevier Science Publishers B.V. North-Holland 633 701
5. J.S.B. Mitchell, and M. Sharir New results on shortest paths in three dimensions SCG'04: proceedings of the twentieth annual symposium on computational geometry 2004 ACM Press New York (NY, USA) 124 133
6. A. Maheshwari, and S. Wuhrer Geodesic paths on 3d surfaces: survey and open problems 2009
7. V. Surazhsky, T. Surazhsky, D. Kirsanov, S.J. Gortler, and H. Hoppe Fast exact and approximate geodesics on meshes ACM Trans Graph 24 3 2005 553 560
8. M. Sharir, and A. Schorr On shortest paths in polyhedral spaces SIAM J Comput 15 1 1986 193 215
9. S.Q. Xin, and G.J. Wang Improving Chen & Han's algorithm on the discrete geodesic problem ACM Trans Graph 28 4 2009
10. Mount DM. On finding shortest paths on convex polyhedra. Tech. Rep. 1495. Computer Science Dept. Univ. of Maryland, College Park, Md. 1984.
11. J. Chen, and Y. Han Shortest paths on a polyhedron SCG'90: proceedings of the sixth annual symposium on computational geometry 1990 ACM Press New York (NY, USA) 360 369
12. E. Dijkstra A note on two problems in connection with graphs Numer Math 1 1959 269 271
13. Kaneva B, O'Rourke J. An implementation of Chen & Han's shortest paths algorithm. In: CCCG. 2000.
14. J. Hershberger, and S. Suri Practical methods for approximating shortest paths on a convex polytope in r3 SODA'95: proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms 1995 Society for Industrial and Applied Mathematics Philadelphia (PA, USA) 447 456
15. Varadarajan KR, Agarwal PK. Approximating shortest paths on a nonconvex polyhedron. In: IEEE symposium on Foundations of Computer Science. 1997. p. 18291.
16. P.K. Agarwal, S. Har-Peled, M. Sharir, and K.R. Varadarajan Approximating shortest paths on a convex polytope in three dimensions J Assoc Comput Mach 44 1997 567 584
17. M. Lanthier, A. Maheshwari, and J. Rudiger Sack Approximating weighted shortest paths on polyhedral surfaces In 6th annual video review of computational geometry, proc. 13th acm symp. computational geometry 1997 ACM Press 274 283
18. M. Barbehenn A note on the complexity of dijkstra's algorithm for graphs with weighted vertices IEEE Trans Comput 47 2 1998 263
19. S. Har-Peled Constructing approximate shortest path maps in three dimensions SIAM J Comput 28 4 1999 1182 1197
20. S. Har-Peled Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions Discrete Comput Geom 21 2 1999 217 231
21. T. Kanai, and H. Suzuki Approximate shortest path on polyhedral surface based on selective refinement of the discrete graph and its applications GMP'00: proceedings of the geometric modeling and processing 2000 2000 IEEE Computer Society Washington (DC, USA) 241
22. Aleksandrov L, Maheshwari A, Sack JR. An improved approximation algorithm for computing geometric shortest paths. In: FCT. 2003. p. 24657.
23. S.Q. Xin, and G.J. Wang Efficiently determining a locally exact shortest path on polyhedral surfaces Comput Aided Des 39 12 2007 1081 1090
24. G. Leibon, and D. Letscher Delaunay triangulations and voronoi diagrams for riemannian manifolds SCG'00: Proceedings of the sixteenth annual symposium on computational geometry 2000 ACM New York (NY, USA) 341 349
25. G. Peyr, and L.D. Cohen Geodesic remeshing using front propagation Int J Comput Vis 69 1 2006 145 156
26. Yan DM, Levy B, Liu Y, Sun F, Wang W. Isotropic remeshing with fast and exact computation of restricted voronoi diagram. Comput Graph Forum.
27. J. O'Rourke Computational geometry in C 1998 Cambridge University Press Hardback ISBN: 0521640105; Paperback: ISBN 0521649765