We present a robust and efficient approach to directly slicing implicit solids. Different from prior slicing techniques that reconstruct contours on the slicing plane by tracing the topology of intersected line segments, which is actually not robust, we generate contours by a topology guaranteed contour extraction on binary images sampled from given solids and a subsequent contour simplification algorithm which has the topology preserved and the geometric error controlled. The resultant contours are free of self-intersection, topologically faithful to the given r-regular solids and with shape error bounded. Therefore, correct objects can be fabricated from them by rapid prototyping. Moreover, since we do not need to generate the tessellated B-rep of given solids, the memory cost our approach is low—only the binary image and the finest contours on one particular slicing plane need to be stored in-core. Our method is general and can be applied to any implicit representations of solids.

References

References
1.
Ju
,
T.
, and
Udeshi
,
T.
,
2006
, “
Intersection-Free Contouring on an Octree Grid
,”
Proceedings of the 14th Pacific Conference on Computer Graphics and Applications
.
2.
Varadhan
,
R.
,
Krishnan
,
S.
,
Zhang
,
L.
, and
Manocha
,
D.
,
2006
, “
Reliable Implicit Surface Polygonization Using Visibility Mapping
,”
Proceedings of the Symposium on Geometry Processing
.
3.
Chen
,
Y.
, and
Wang
,
C. C. L.
,
2008
, “
Layered Depth-Normal Images for Complex Geometries—Part One: Accurate Sampling and Adaptive Modeling
,”
Proceedings of the ASME IDETC/CIE Conference, 28th Computers and Information in Engineering Conference
,
New York
, Paper No. DETC2008-49432.
4.
Wang
,
C. C. L.
, and
Chen
,
Y.
,
2008
, “
Layered Depth-Normal Images for Complex Geometries C Part Two: Manifold-Preserved Adaptive Contouring
,”
Proceedings of the ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conferences
,
New York
,
Aug. 3–6
, Paper No. DETC2008-49576.
5.
Ju
,
T.
,
Losasso
,
F.
,
Schaefer
,
S.
, and
Warren
,
J.
,
2002
, “
Dual Contouring of Hermite Data
,”
ACM Trans. Graphics
,
21
(
3
), pp.
339
346
.10.1145/566654.566586
6.
Chua
,
C. K.
,
Leong
,
K. F.
, and
Lim
,
C. S.
,
2003
,
Rapid Prototyping: Principles and Applications
,
World Scientific
,
Singapore
.
7.
Fuchs
,
H.
,
Kedem
,
Z. M.
, and
Nalor
,
B. F.
,
1980
, “
On Visible Surface Generation by a Priori Tree Structures
,”
Proceedings of the ACM SIGGRAPH 1980
, pp.
124
133
.
8.
Ohtake
,
Y.
,
Belyaev
,
A.
, and
Seidel
,
H. P.
,
2004
, “
3D Scattered Data Approximation With Adaptive Compactly Supported Radial Basis Functions
,”
Proceedings of the Shape Modeling International 2004
, pp.
31
39
.
9.
Luo
,
R. C.
, and
Ma
,
Y.
,
1995
, “
A Slicing Algorithm for Rapid Prototyping and Manufacturing
,”
Proceedings of the IEEE International Conference on Robotics and Automation
,
1995
, pp.
2841
2846
.
10.
Farouki
,
R. T.
,
1986
, “
The Characterization of Parametric Surface Sections
,”
Comput. Vis. Graph. Image Process.
,
33
, pp.
209
236
.10.1016/0734-189X(86)90115-5
11.
Lee
,
R. B.
, and
Fredericks
,
D. A.
,
1981
, “
Intersection of Parametric Surfaces and a Plane
,”
IEEE Comput. Graph. Appl.
,
4
(
8
), pp.
112
117
.
12.
Barnhill
,
R. E.
, and
Kersey
,
S. N.
,
1990
, “
A Marching Method for Parametric Surface/Surface Intersection
,”
Comput. Aided Geom. Des.
,
7
, pp.
257
280
.10.1016/0167-8396(90)90035-P
13.
Barnhill
,
R. E.
,
Farin
,
G. E.
,
Jordan
,
M.
, and
Piper
,
B. R.
,
1987
, “
Surface/Surface Intersection
,”
Comput. Aided Geom. Des.
,
4
, pp.
3
16
.10.1016/0167-8396(87)90020-3
14.
Yang
,
P.
, and
Qian
,
X.
,
2008
, “
Adaptive Slicing of Moving Least Squares Surfaces: Toward Direct Manufacturing of Point Set Surfaces
,”
ASME J. Comput. Inf. Sci. Eng.
,
8
(
3
), p.
031003
.10.1115/1.2955481
15.
Qiu
,
Y.
,
Zhou
,
X.
, and
Qian
,
X.
,
2010
, “
Direct Slicing of Cloud Data With Guaranteed Topology for Rapid Prototyping
,”
Int. J. Adv. Manuf. Technol.
, (accepted).
16.
Liu
,
Y.
,
Xia
,
S.
, and
Qian
,
X.
,
2012
, “
Direct Numerical Control (NC) Path Generation: From Discrete Points to Continuous Spline Paths
,”
ASME J. Comput. Inf. Sci. Eng.
,
12
(
3
), p.
031002
.10.1115/1.4006463
17.
Lorensen
,
W. E.
, and
Cline
,
H. E.
,
1987
, “
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
,”
Comput. Graph.
,
21
(
4
), pp.
163
169
.10.1145/37402.37422
18.
Kobbelt
,
L. P.
,
Botsch
,
M.
,
Schwanecke
,
U.
, and
Seidel
,
H.
,
2001
, “
Feature Sensitive Surface Extraction From Volume Data
,”
Proceedings of the ACM SIGGRAPH 2001
, pp.
57
66
.
19.
Chica
,
A.
,
Willliams
,
J.
,
Andujar
,
C.
,
Brunet
,
P.
,
Navazo
,
I.
,
Rossignac
,
J.
, and
Vinacua
,
A.
,
2008
, “
Pressing: Smooth Isosurfaces With Flats From Binary Grids
,”
Comput. Graph. Forum
,
27
(
1
), pp.
36
46
.10.1111/j.1467-8659.2007.01039.x
20.
Stelldinger
,
P.
,
Latecki
L. J.
, and
Siqueira
,
M.
,
2007
, “
Topological Equivalence Between a 3D Object and the Reconstruction of Its Digital Image
,”
IEEE Trans. Pattern Anal. Mach. Intell.
,
29
(
1
), pp.
126
140
.10.1109/TPAMI.2007.250604
21.
Hoppe
,
H.
,
1996
, “
Progressive Meshes
,”
Proceedings of the ACM SIGGRAPH 1996
, pp.
99
108
.
22.
Klein
,
R.
,
Liebich
,
G.
, and
Strasser
,
W.
,
1996
, “
Mesh Reduction With Error Control
,”
Proceedings of the IEEE Visualization
, pp.
311
318
.
23.
Garland
,
M.
, and
Heckbert
,
P. S.
,
1998
, “
Simplifying Surfaces With Color and Texture Using Quadric Error Metrics
,”
Proceedings of the IEEE Visualization
, pp.
263
269
.
24.
Lindstrom
,
P.
, and
Turk
,
G.
,
1998
, “
Fast and Memory Efficient Polygonal Simplification
,”
Proceedings of the IEEE Visualization
, pp.
279
286
.
25.
Maillot
,
J.
,
Yahia
,
H.
, and
Verroust
,
A.
,
1993
, “
Interactive Texture Mapping
,”
Proceedings of the ACM SIGGRAPH 1993
, pp.
27
34
.
26.
Kalvin
,
A. D.
, and
Taylor
,
R. H.
,
1996
, “
Superfaces: Polygonal Mesh Simplification With Bounded Error
,”
IEEE Comput. Graph. Appl.
,
16
(
3
), pp.
64
77
.10.1109/38.491187
27.
Inoue
,
K.
,
Itoh
,
T.
,
Yamada
,
A.
,
Furuhata
,
T.
, and
Shimada
,
K.
,
1999
, “
Clustering a Large Number of Faces for 2-Dimensional Mesh Generation
,”
Proceedings of the Eighth International Meshing Roundtable
, pp.
281
292
.
28.
Sheffer
,
A.
,
2000
, “
Model Simplification for Meshing Using Face Clustering
,”
Comput.-Aided Des.
,
33
, pp.
925
934
.10.1016/S0010-4485(00)00116-0
29.
Sander
,
P.
,
Snyder
,
J.
,
Gortler
,
S.
, and
Hoppe
,
H.
,
2001
, “
Texture Mapping Progressive Meshes
,”
Proceedings of the ACM SIGGRAPH 2001
, pp.
409
416
.
30.
Garland
,
M.
,
Willmott
,
A.
, and
Heckbert
,
P. S.
,
2001
, “
Hierarchical Face Clustering on Polygonal Surfaces
,”
Proceedings of the 2001 Symposium on Interactive 3D Graphics
.
31.
Grinspun
,
E.
, and
Schröder
,
P.
,
2001
, “
Normal Bounds for Subdivision-Surface Interference Detection
,”
Proceedings of the IEEE Scientific Visualization
, pp.
333
340
.
32.
Lévy
,
B.
,
Petitjean
,
S.
,
Ray
,
N.
, and
Maillot
,
J.
,
2002
, “
Least Squares Conformal Maps for Automatic Texture Atlas Generation
,”
Proceedings of the ACM SIGGRAPH 2002
, pp.
362
371
.
33.
Cohen-Steiner
,
D.
,
Alliez
,
P.
, and
Desbrun
,
M.
,
2004
, “
Variational Shape Approximation
,”
Proceedings of the ACM SIGGRAPH 2004
, pp.
905
914
.
34.
Lloyd
,
A. P.
,
1982
, “
Least Square. Quantization in PCM
,”
IEEE Trans. Inf. Theory
,
28
(
2
), pp.
129
137
.10.1109/TIT.1982.1056489
You do not currently have access to this content.