Finding the shortest path on a polyhedral surface and its application to quality assurance of electric components

Journal of Mechanical Design

Volumn 126, Issue 6, 2004, Pages 1017-1026

  Kageura, Masaru ^a,b   Shimada, Kenji ^c  

^a CANON INC   (Japan)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ELECTRIC SPARKS; PRODUCT DESIGN; QUALITY ASSURANCE;

CHEN-HAN ALGORITHM; KANAI-SUZUKI METHOD; POLYHEDRAL SURFACE;

COMPUTATIONAL METHODS;

EID: 15444366610     PISSN: 10500472     EISSN: None     Source Type: Journal    
DOI: 10.1115/1.1814386     Document Type: Article

References (15)

1. IEC, "IEC 60950," International Electrotechnical Commission 1999.
2. Mitchell, J. S. B., Mount, D. M., and Paradimitriou, C. H., 1987, "The Discrete Geodesic Problem," SIAM J. Comput., 16, pp. 647-68.
3. Chen, J., and Han, Y., 1990, "Shortest Paths on a Polyhedron," presented at Sixth ACM Symposium on Computational Geometry.
4. Dijkstra, E. W., 1959, "A Note on Two Problems in Connection With Graphs," Numer. Math., 1, pp. 269-271.
5. Kapoor, S., 1999, "Efficient Computation of Geodesic Shortest Paths," presented at the 32nd Annual ACM Symposium on Theory of Computing, Atlanta, Georgia.
6. Kaneva, B., and O'Rourke, J., 2000, "An Implementation of Chen & Han's Shortest Paths Algorithm," presented at 12th Canadian Conference on Computational Geometry.
7. Lanthier, M., Maheshwari, A., and Sack, J.-R., 1997, "Approximating Weighted Shortest Paths on Polyhedral Surface," presented at Sixth ACM symposium on Computational Geometry.
8. Kanal, T., and Suzuki, H., 2001, "Approximate Shortest Path on a Polyhedeml Surface and its Application," Computer-Aided Design, 33 pp. 801-811.
9. Guibas, L. J., and Hershberger, J., 1989, "Optimal Shortest Path Queries in a Simple Polygon," J. Comput. Syst. Sci., 39, pp. 126-152.
10. Garey, M. R., Johnson, D. S., Preparata, F., P., and Tarjan, R. E., 1978, "Triangulating a Simple Polygon," Inf. Process. Lett., 7, pp. 175-179.
11. Hart, P. E., Nilsson, N. J., and Raphael, B., 1968, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Trans. Syst. Sci. Cybern., 4, pp. 100-107.
12. Eppstein, D., 1998, "Finding the k Shortest Paths," SIAM J. Comput., 28, pp. 652-673.
13. Katoh, N., Ibaraki, T., and Mine, H., 1982, "An Efficient Algorithm for K Shortest Simple Paths," Network. 12, pp. 411-427.
14. Hadjiconstantinou, E., and Christofides, N., 1999, "An Efficient Implementation of an Algorithm for Finding K Shortest Simple Paths," Network, 34, pp. 88-101.
15. Kimmel, R., and Sethian, J., 1998, "Fast Marching Methods on Triangulated Domains," Proc. Natl. Acad. Sci. U.S.A., 95, pp. 8341-8435.