Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algorithms have been developed that have theoretical guarantee of computing a topologically correct and geometrically close surface under certain condition on sampling density. Unfortunately, this sampling condition is not always met in practice due to noise, non-smoothness or simply due to inadequate sampling. This leads to undesired holes and other artifacts in the output surface. Certain CAD applications such as creating a prototype from a model boundary require a water-tight surface, i.e., no hole should be allowed in the surface. In this paper we describe a simple algorithm called Tight Cocone that works on an initial mesh generated by a popular surface reconstruction algorithm and fills up all holes to output a water-tight surface. In doing so, it does not introduce any extra points and produces a triangulated surface interpolating the input sample points. In support of our method we present experimental results with a number of difficult data sets.

1.
Boissonnat
,
J. D.
,
1984
, “
Geometric Structures for Three Dimensional Shape Representation
,”
ACM Trans. Graphics
,
3
(
4
), pp.
266
286
.
2.
Edelsbrunner
,
H.
, and
Mu¨cke
,
E. P.
,
1994
, “
Three-dimensional Alpha Shapes
,”
ACM Trans. Graphics
,
13
, pp.
43
72
.
3.
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., and Stuetzle, W., 1992, “Surface Reconstruction from Unorganized Points,” ACM SIGGRAPH 92, pp. 71–78.
4.
Bernardini
,
F.
,
Mittleman
,
J.
,
Rushmeier
,
H.
,
Silva
,
C.
, and
Taubin
,
G.
,
1999
, “
The Ball-pivoting Algorithm for Surface Reconstruction
,”
IEEE Trans. Vis. Comput. Graph.
,
5
, pp.
349
359
.
5.
Amenta, N., Bern, M., and Kamvysselis, M., 1998, “A New Voronoi-based Surface Reconstruction Algorithm,” ACM SIGGRAPH, pp. 415-421.
6.
Amenta
,
N.
,
Choi
,
S.
,
Dey
,
T. K.
, and
Leekha
,
N.
,
2002
, “
A Simple Algorithm for Homeomorphic Surface Reconstruction
,”
Internat. J. Comput. Geom. & Applications
,
12
, pp.
125
141
.
7.
Boissonnat, J. D., and Cazals, F., 2000, “Smooth Surface Reconstruction via Natural Neighbor Interpolation of Distance Functions,” Proc. 16th. Annu. Sympos. Comput. Geom., pp. 223–232.
8.
Funke, S., and Ramos, E. A., 2002, “Smooth-surface Reconstruction in Near-linear Time,” Proc. 13th ACM-SIAM Annu. Sympos. Discrete Algorithms, pp. 781–790.
9.
Amenta, N., Choi. S., and Kolluri, R. K., 2001, “The Power Crust,” Proc. 6th Annu. Sympos. Solid Modeling Applications, pp. 249-260.
10.
Edelsbrunner, H., “Surface Reconstruction by Wrapping Finite Point Set in Space,” Ricky Pollack and Eli Goodman Festschrift, ed. B. Aronov, S. Basu, J. Pach and M. Sharir, Springer-Verlag, to appear.
11.
Giesen, J., and John, M., 2003, “The Flow Complex: A Data Structure for Geometric Modeling,” Proc. 14th. Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 285–294.
12.
Kolluri, R. K., Shewchuk, J. R., and O’Brien, J. F., 2003, “Watertight Spectral Surface Reconstruction,” Manuscript.
13.
Dey, T. K., and Giesen, J., 2001, “Detecting Undersampling in Surface Reconstruction,” Proc. 17th Annu. Sympos. Comput. Geom., pp. 257–263.
14.
COCONE: http://www.cis.ohio-state.edu/∼tamaldey/cocone.html
15.
CGAL: http://www.cgal.org
You do not currently have access to this content.