This paper describes a new algorithm for contouring a medial surface from CT (computed tomography) data of a thin-plate structure. Thin-plate structures are common in mechanical structures, such as car body shells. When designing thin-plate structures in CAD (computer-aided design) and CAE (computer-aided engineering) systems, their shapes are usually represented as surface models associated with their thickness values. In this research, we are aiming at extracting medial surface models of thin-plate structures from their CT data for use in CAD and CAE systems. Commonly used isosurfacing methods, such as marching cubes, are not applicable to contour the medial surface. Therefore, we first extract medial cells (cubes comprising eight neighboring voxels) from the CT data using a skeletonization method to apply the marching cubes algorithm for extracting the medial surface. It is not, however, guaranteed that the marching cubes algorithm can contour those medial cells (in short, not “marching cubeable”). In this study, therefore we developed cell operations that correct topological connectivity to guarantee such marching cubeability. We then use this method to assign virtual signs to the voxels to apply the marching cubes algorithm to generate triangular meshes of a medial surface and map the thicknesses of thin-plate structures to the triangle meshes as textures. A prototype system was developed to verify some experimental results.

1.
Sherbrooke
,
E. C.
,
Patrikalakis
,
N. M.
, and
Brisson
,
E.
, 1996, “
An Algorithm for the Medial Axis Transform of 3D Polyhedral Solids
,”
IEEE Trans. Vis. Comput. Graph.
1077-2626
2
(
1
), pp.
44
61
.
2.
Pudney
,
C.
, 1998, “
Distance-ordered Homotopic Thinning: a Skeletonization Algorithm for 3D Digital Images
,”
Comput. Vis. Image Underst.
1077-3142,
72
(
3
), pp.
404
413
.
3.
Malandain
,
G.
and
Fernandez-Vidal
,
S.
, 1998, “
Euclidean Skeletons
,”
Image and Vision Computing
,
16
, pp.
317
327
.
4.
Prohaska
,
S.
and
Hege
,
H.-C.
, 2002, “
Fast Visualization of Plane-like Structures in Voxel Data
,”
Proc. of Conference on Visualization ’02
,
IEEE Computer Society
, Washington, pp.
29
36
.
5.
Lorensen
,
W. E.
and
Cline
,
H. E.
, 1987, “
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
,”
Proc. of 14th Annual conference on Computer Graphics and Interactive Techniques
,
ACM Press
, New York, pp.
163
169
.
6.
Hormann
,
K.
,
Labsik
,
U.
,
Meister
,
M.
, and
Greiner
,
G.
, 2002, “
Hierarchical Extraction of Iso-surfaces with Semi-regular Meshes
,”
Proc. of Seventh ACM Symposium on Solid Modeling and Applications, ACM, New York
, pp.
53
58
.
7.
Esteve
,
J.
,
Brunet
,
P.
, and
Vinacua
,
A.
, 2002, “
Approximation of a Variable Density Cloud of Points by Shrinking a Discrete Membrane
,” Rep. LSI-02-75-R,
Universitat Politècnica de Catalunya, Tech.
8.
Lachaud
,
J.-O.
and
Montanvert
,
A.
, 2000, “
Continuous Analogs of Digital Boundaries: A Topological Approach to Iso-surfaces
,”
Graphical Models and Image Processing
,
62
, pp.
129
164
.
9.
Lohmann
,
G.
, 1998,
Volumetric Image Analysis
,
Wiley
, New York.
10.
Kobbelt
,
L. P.
,
Botsch
,
M.
,
Schwanecke
,
U.
, and
Seidel
,
H.-P.
, 2001, “
Feature Sensitive Surface Extraction From Volume Data
,”
Proc. of 28th Annual Conference on Computer Graphics and Interactive Techniques
,
ACM Press
, New York pp.
57
66
.
11.
Ju
T.
,
Losasso
F.
,
Schaefer
S.
, and
Warren
J.
, 2002, “
Dual Contouring of Hermite Data
,”
Proc. of 29th Annual Conference on Computer Graphics and Interactive Techniques
,
ACM Press
, New York pp.
339
346
.
You do not currently have access to this content.