loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fifth International Conference on Computer and Information Technology (CIT'05)
A Robust and Topological Correct Marching Cube Algorithm Without Look-Up Table
Shanghai, China
September 21-September 23
ISBN: 0-7695-2432-X
Xia Renbo, Shenyang Institute of Automation, Chinese Academy of Sciences
Liu Weijun, Shenyang Institute of Automation, Chinese Academy of Sciences
Wang Yuechao, Shenyang Institute of Automation, Chinese Academy of Sciences

In this paper, we proposed an improved version of the Marching Cube algorithm which gives topologically correct triangular approximation of the isosurface for any cube configuration. First, classification and characterization of critical points on the isosurface of trilinear functions is studied in detail. Then, unlike the past work on Marching Cube algorithm, a robust triangulation strategy without using the conventional look-up table and complementary and rotation operations is presented. Our algorithm is adaptive to the small the changes data or the small changes of the threshold, and obtains more reasonable result of triangulation of isosurface than those produced by standard MC algorithm.

Index Terms:
marching cube, topological correct,isosurafce, critical point
Citation:
Xia Renbo, Liu Weijun, Wang Yuechao, "A Robust and Topological Correct Marching Cube Algorithm Without Look-Up Table," cit, pp.565-569, Fifth International Conference on Computer and Information Technology (CIT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.