Solid Model Reconstruction of Wireframe CAD Models Based on Topological Embeddings of Planar Graphs

[+] Author and Article Information
Keisuke Inoue

Tokyo Research Laboratory, IBM Japan, Ltd., 1623-14, Shimotsuruma, Yamato-shi, Kanagawa 242-8502, Japan

Kenji Shimada, Karthick Chilaka

Mechanical Engineering, Carnegie Mellon University, Pittsburgh, PA, 15213-3890

J. Mech. Des 125(3), 434-442 (Sep 04, 2003) (9 pages) doi:10.1115/1.1586309 History: Received February 01, 2002; Revised December 01, 2002; Online September 04, 2003
Copyright © 2003 by ASME
Your Session has timed out. Please sign back in to continue.


Markowsky,  G., and Wesley,  M. A., 1980, “Fleshing Out Wire Frames,” IBM J. Res. Dev., 24(5), pp. 582–597.
Momoi,  S., and Fukui,  Y., 1990, “A Conversion Algorithm from Wireframe Models to Solid Models,” Journal of Information Processing Society of Japan, 31(1), pp. 24–31. (in Japanese).
Hanrahan,  P. M., 1982, “Creating Volume Models from Edge-Vertex Graphs,” ACM Computer Graphics, 16(3), pp. 77–84.
Dutton,  R. D., and Brigham,  R. C., 1983, “Efficiently Identifying the Faces of a Solid,” Computers and Graphics in Mechanical Engineering, 7(2), pp. 143–147.
Hopcroft,  J. E., and Tarjan,  R. E., 1974, “Efficient Planarity Testing,” Journal of the ACM, 21(4), pp. 549–568.
Ganter,  M. A., and Uicker,  J. J., 1983, “From Wire-Frame to Solid-Geometric: Automated Conversion of Data Representations,” Computers in Mechanical Engineering, 2(2), pp. 40–45.
Courter, S. M., 1986, “Automated Conversion of Curvilinear Wire-Frame Models to Surface Boundary Models; A Topological Approach,” SIGGRAPH ’86, 20 (4), pp. 171–178.
Agarwal,  S. C., and Waggenspack,  W. N., 1992, “Decomposition Method for Extracting Surface Topologies from Wireframe Models,” Comput.-Aided Des., 24(3), pp. 123–140.
Graham, R. L., Grötschel, M., and Lovász, L., eds., 1995, Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam.
Hopcroft,  J. E., and Tarjan,  R. E., 1973, “Dividing a Graph into Triconnected Components,” SIAM J. Comput., 2(3), pp. 135–158.
Yamada, A., Shimada, K., Furuhata T., and Hou, K., 1999, “A Discrete Spring Model to Generate Fair Curves and Surfaces,” Proceedings, Pacific Graphics ’99, pp. 270–279.
Melhorn, K., and Näher, S., 1999, LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, UK.


Grahic Jump Location
Sample of multiple interpretations
Grahic Jump Location
Wireframe embeddable only on the torus
Grahic Jump Location
Equivalence classes and split graphs
Grahic Jump Location
Three types of split components
Grahic Jump Location
Input graph, the triconnected component decomposition, and the structure graph (left to right)
Grahic Jump Location
Sample embeddings of triconnected components
Grahic Jump Location
Embedding a 2-connected graph by reversing the sphere
Grahic Jump Location
A solution with interfering faces
Grahic Jump Location
Edge ordering (ordering on the right makes a larger sum)
Grahic Jump Location
Case 1: a 2-connected input wireframe
Grahic Jump Location
Structure graph of Case 1 wireframe
Grahic Jump Location
The minimum-area solution of Case 1 wireframe
Grahic Jump Location
Case 2: a disconnected wireframe
Grahic Jump Location
The minimum-area solution of Case 2 wireframe




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