Space Subdivision for Fast Polygonization of Implicit Surfaces

This paper presents the basic principles for the visualization of objects which are defined by implicit functions and CSG trees. The basic principles (Marching cubes, Marching tetrahedra and Marching triangles) for iso-surfaces rendering of such objects are compared. A new fast modification of the Marching triangles algorithm is presented and compared with others algorithms. It is based on the space subdivision technique that enabled a significant speed-up of the Marching triangles algorithm. The speed-up grows with the grid resolution in which the object is represented. The presented algorithm is convenient for objects with large smooth and complex surfaces. The method produces a triangular mesh that consists of well-shaped triangles.

[1]  Paul S. Heckbert,et al.  Graphics gems IV , 1994 .

[2]  Samir Akkouche,et al.  Adaptive Implicit Surface Polygonization Using Marching Triangles , 2001, Comput. Graph. Forum.

[3]  Brian Wyvill,et al.  Introduction to Implicit Surfaces , 1997 .

[4]  Vaclav Skala,et al.  Modular Visualization Environment , 2000 .

[5]  Alexander A. Pasko,et al.  Dynamic meshes for accurate polygonization of implicit surfaces with sharp features , 2001, Proceedings International Conference on Shape Modeling and Applications.

[6]  Erich Hartmann,et al.  A marching method for the triangulation of surfaces , 1998, The Visual Computer.

[7]  Jules Bloomenthal,et al.  Skeletal design of natural forms , 1996 .

[8]  Adrian Hilton,et al.  Marching triangles: range image fusion for complex object modelling , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[9]  Christophe Chaillou,et al.  Fast Polygonization of Implicit Surfaces , 2001, WSCG.

[10]  Alexander A. Pasko,et al.  Hybrid system architecture for volume modeling , 2000, Comput. Graph..