Finding the Shortest Path on a Polyhedral Surface and Its Application to Quality Assurance of Electric Components

[+] Author and Article Information
Masaru Kageura

Creative Engineering Environment Development Center, Canon, Inc.

Kenji Shimada

Department of Mechanical Engineering, Carnegie Mellon University 5000 Forbes Avenue, Pittsburgh, PA 15213-3890

J. Mech. Des 126(6), 1017-1026 (Feb 14, 2005) (10 pages) doi:10.1115/1.1814386 History: Received July 01, 2002; Revised March 01, 2004; Online February 14, 2005
Copyright © 2004 by ASME
Your Session has timed out. Please sign back in to continue.


IEC, “IEC 60950,” International Electrotechnical Commission 1999.
Mitchell,  J. S. B., Mount,  D. M., and Paradimitriou,  C. H., 1987, “The Discrete Geodesic Problem,” SIAM J. Comput., 16, pp. 647–68.
Chen, J., and Han, Y., 1990, “Shortest Paths on a Polyhedron,” presented at Sixth ACM Symposium on Computational Geometry.
Dijkstra,  E. W., 1959, “A Note on Two Problems in Connection With Graphs,” Numer. Math., 1, pp. 269–271.
Kapoor, S., 1999, “Efficient Computation of Geodesic Shortest Paths,” presented at the 32nd Annual ACM Symposium on Theory of Computing, Atlanta, Georgia.
Kaneva, B., and O’Rourke, J., 2000, “An Implementation of Chen & Han’s Shortest Paths Algorithm,” presented at 12th Canadian Conference on Computational Geometry.
Lanthier, M., Maheshwari, A., and Sack, J.-R., 1997, “Approximating Weighted Shortest Paths on Polyhedral Surface,” presented at Sixth ACM symposium on Computational Geometry.
Kanai,  T., and Suzuki,  H., 2001, “Approximate Shortest Path on a Polyhederal Surface and its Application,” Computer-Aided Design,33, pp. 801–811.
Guibas,  L. J., and Hershberger,  J., 1989, “Optimal Shortest Path Queries in a Simple Polygon,” J. Comput. Syst. Sci., 39, pp. 126–152.
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.
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.
Eppstein,  D., 1998, “Finding the k Shortest Paths,” SIAM J. Comput., 28, pp. 652–673.
Katoh,  N., Ibaraki,  T., and Mine,  H., 1982, “An Efficient Algorithm for K Shortest Simple Paths,” Network, 12, pp. 411–427.
Hadjiconstantinou,  E., and Christofides,  N., 1999, “An Efficient Implementation of an Algorithm for Finding K Shortest Simple Paths,” Network, 34, pp. 88–101.
Kimmel,  R., and Sethian,  J., 1998, “Fast Marching Methods on Triangulated Domains,” Proc. Natl. Acad. Sci. U.S.A., 95, pp. 8341–8435.


Grahic Jump Location
An example of a model in which the danger of sparks must be carefully assessed. A, high voltage electric switch; B, metal plate; C, electric switch; D, E, F, and G, metal screws; H, plastic base.
Grahic Jump Location
Three types of shortest paths
Grahic Jump Location
An example of the failure of the Kanai-Suzuki approximate method
Grahic Jump Location
The shortest path between two metal parts
Grahic Jump Location
Two rules in geometric improvement
Grahic Jump Location
The process of geometrical improvement
Grahic Jump Location
An example of a failure of geometrical improvement
Grahic Jump Location
The initial paths for a converging process
Grahic Jump Location
The shortest path on a sphere
Grahic Jump Location
Shortest path on a mechanical part
Grahic Jump Location
Shortest path on a sheet metal part
Grahic Jump Location
The summary of experimental results



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In