This paper describes a robust and versatile method based on graph embedding for reconstructing a solid model from a wireframe model. The robustness and versatility of the conventional methods are limited in that: (1) most of them are heuristic and thus less robust, and (2) the rest, deterministic ones, can handle only small class of wireframes. Unlike the conventional methods, our approach is deterministic and covers a larger class of wireframes that are topologically 2-connected planar multigraphs. The class includes wireframes that can be interpreted as a closed two-manifold in multiple ways. The proposed algorithm consists of three steps: (1) all topological solutions are exhaustively generated using triconnected component decomposition; (2) the surface geometries for all the topological solutions are generated; and (3) the solutions are pruned down to geometrically valid ones. We also show the algorithm is extendable to the class of general planar multigraphs. The approach is characterized by generating the complete set of topological solutions without referring to the geometry of the wireframe, which makes the process free from geometric errors and instabilities. The algorithm is also fast, because even when there are many topological solutions, the total number of different faces is very small. The proposed approach provides a method for easy and intuitive geometric modeling as well as a conversion tool for legacy wireframes.

Issue Section:
Technical Papers
Keywords:
CAD, solid modelling, graph theory, computational geometry
Topics:
Algorithms, Geometry, Manifolds, Solid models, Computer-aided design, Topology
1.
Markowsky
,
G.
, and
Wesley
,
M. A.
,
1980
, “
Fleshing Out Wire Frames
,”
IBM J. Res. Dev.
,
24
(
5
), pp.
582
–
597
.
2.
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).
3.
Hanrahan
,
P. M.
,
1982
, “
Creating Volume Models from Edge-Vertex Graphs
,”
ACM Computer Graphics
,
16
(
3
), pp.
77
–
84
.
4.
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
.
5.
Hopcroft
,
J. E.
, and
Tarjan
,
R. E.
,
1974
, “
Efficient Planarity Testing
,”
Journal of the ACM
,
21
(
4
), pp.
549
–
568
.
6.
Ganter
,
M. A.
, and
Uicker
, Jr.,
J. J.
,
1983
, “
From Wire-Frame to Solid-Geometric: Automated Conversion of Data Representations
,”
Computers in Mechanical Engineering
,
2
(
2
), pp.
40
–
45
.
7.
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.
8.
Agarwal
,
S. C.
, and
Waggenspack
, Jr.,
W. N.
,
1992
, “
Decomposition Method for Extracting Surface Topologies from Wireframe Models
,”
Comput.-Aided Des.
,
24
(
3
), pp.
123
–
140
.
9.
Graham, R. L., Gro¨tschel, M., and Lova´sz, L., eds., 1995, Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam.
10.
Hopcroft
,
J. E.
, and
Tarjan
,
R. E.
,
1973
, “
Dividing a Graph into Triconnected Components
,”
SIAM J. Comput.
,
2
(
3
), pp.
135
–
158
.
11.
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.
12.
Melhorn, K., and Na¨her, S., 1999, LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, Cambridge, UK.
Copyright © 2003
 by ASME
You do not currently have access to this content.