Surface area estimation for digitized regular solids

The problem of multigrid convergent surface area measurement came with the advent of computer-based image analysis. The paper proposes a classification scheme of local and global polyhedrization approaches which allows us to classify different surface area measurement techniques with respect to the underlying polyhedrization scheme. It is shown that a local polyhedrization technique such as marching cubes is not multigrid convergent towards the true value even for elementary convex regular solids such as cubes, spheres or cylinders. The paper summarizes work on global polyhedrization techniques with experimental results pointing towards correct multigrid convergence. The class of general ellipsoids is suggested to be a test set for such multigrid convergence studies.

[1]  Jane Wilhelms,et al.  Octrees for faster isosurface generation , 1990, SIGGRAPH 1990.

[2]  Jean Françon,et al.  Polyhedrization of the Boundary of a Voxel Object , 1999, DGCI.

[3]  Jane Wilhelms,et al.  Topological considerations in isosurface generation , 1994, TOGS.

[4]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm , 1980, SIGGRAPH '80.

[5]  Thomas Bülow,et al.  Rubber band algorithm for estimating the length of digitized space-curves , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[6]  Atsushi Imiya,et al.  Boundary Extraction of Discrete Objects , 1998, Comput. Vis. Image Underst..

[7]  Robert A. Hummel,et al.  Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition , 1995, IEEE Trans. Vis. Comput. Graph..

[8]  Atsushi Imiya,et al.  Marching cubes method with connectivity , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[9]  Jonathan C. Roberts An Overview of Rendering from Volume Data --- including Surface and Volume Rendering , 1993 .

[10]  Marinette Revenu,et al.  Fast computation of the normal vector field of the surface of a 3-D discrete object , 1996, DGCI.

[11]  Willy Scherrer Ein Satz über Gitter und Volumen , 1922 .

[12]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[13]  Reinhard Klette,et al.  Determination of the Convex Hull of a Finite Set of Planar Points Within Linear Time , 1981, J. Inf. Process. Cybern..