Reconstruction and Simplification of Surfaces from Contours

In this paper we consider the problem of reconstructing triangular surfaces from given contours. An algorithm solving this problem must decide which contours of two successive slices should be connected by the surface (branching problem) and, given that, which vertices of the assigned contours should be connected for the triangular mesh (correspondence problem). We present a new approach that solves both tasks in an elegant way. The main idea is to employ discrete distance fields enhanced with correspondence information. This allows us not only to connect vertices from successive slices in a reasonable way but also to solve the branching problem by creating intermediate contours where adjacent contours differ too much. Last but not least we show how the 2D distance fields used in the reconstruction step can be converted to a 3D distance field that can be advantageously exploited for distance calculations during a subsequent simplification step.

[1]  Carolyn A. Bucholtz,et al.  Shape-based interpolation , 1992, IEEE Computer Graphics and Applications.

[2]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[3]  Reinhard Klein,et al.  Fast Distance Field Interpolation for Reconstruction of Surfaces from Contours , 1999, Eurographics.

[4]  Sabine Coquillart,et al.  3D Reconstruction of Complex Polyhedral Shapes from Contours using a Simplified Generalized Voronoi Diagram , 1996, Comput. Graph. Forum.

[5]  Rémi Ronfard,et al.  Full‐range approximation of triangulated polyhedra. , 1996, Comput. Graph. Forum.

[6]  Heinrich Müller,et al.  Surface Interpolation from Cross Sections , 1991, Focus on Scientific Visualization.

[7]  Chak-Kuen Wong,et al.  Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

[8]  Rolf Klein,et al.  Abstract Voronoi Diagrams and their Applications , 1988, Workshop on Computational Geometry.

[9]  Min Chen,et al.  A New Approach to the Construction of Surfaces from Contour Data , 1994, Comput. Graph. Forum.

[10]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[11]  Kenneth R. Sloan,et al.  Surfaces from contours , 1992, TOGS.

[12]  J. Hershberger,et al.  Speeding Up the Douglas-Peucker Line-Simplification Algorithm , 1992 .

[13]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[14]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[15]  Charles T. Loop,et al.  Testbed for the comparison of parametric surface methods , 1990, Other Conferences.

[16]  Eric Keppel,et al.  Approximating Complex Surfaces by Triangulation of Contour Lines , 1975, IBM J. Res. Dev..

[17]  Rolf Klein,et al.  Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.

[18]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..

[19]  Paolo Cignoni,et al.  A comparison of mesh simplification algorithms , 1998, Comput. Graph..

[20]  Daniel Cohen-Or,et al.  Contour blending using warp-guided distance field interpolation , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[21]  Micha Sharir,et al.  Piecewise-Linear Interpolation between Polygonal Slices , 1996, Comput. Vis. Image Underst..

[22]  Arthur W. Toga,et al.  Distance field manipulation of surface models , 1992, IEEE Computer Graphics and Applications.

[23]  Bahram Parvin,et al.  An Algebraic Solution to Surface Recovery from Cross-Sectional Contours , 1999, Graph. Model. Image Process..

[24]  Thomas W. Sederberg,et al.  Conversion of complex contour line definitions into polygonal element mosaics , 1978, SIGGRAPH.

[25]  Reinhard Klein,et al.  Mesh reduction with error control , 1996, Proceedings of Seventh Annual IEEE Visualization '96.

[26]  David Levin.  Multidimensional Reconstruction by Set-valued Approximations , 1986 .