A robust and topological correct marching cube algorithm without look-up table
夏仁波, 刘伟军, 王越超
Abstract
夏仁波, 刘伟军, 王越超
Abstract
In this paper, we proposed an improved version of the Marching Cube algorithm which gives a topologically correct triangular approximation of the isosurface for any cube configuration. First, a 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 isosuiface than those produced by standard MC algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we proposed an improved version of the Marching Cube algorithm which gives a topologically correct triangular approximation of the isosurface for any cube configuration. First, a 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 isosuiface than those produced by standard MC algorithm.
Key concepts: Isosurface, Marching cubes, Cube (algebra), Triangulation, Unit cube, Algorithm, Mathematics, Table (database)