This paper presents an adaptive method for polygonisation of implicit surfaces. The method is based on the shape of triangles and the accuracy of resulting approximation. The main advantages of the triangulation presented are simplicity and the stable features that can be used for the next expansion. The presented algorithm is based on the surface tracking scheme, and it is compared with other ...

In this paper, an interactive segmentation method that combines fast marching and fast level set method is proposed. Level set segmentation involves solving the energybased active contour minimization problems by the computation of geodesics or minimal distance curves. First, by selecting the seed point, the fast marching method is used to extract rough boundaries of the interested object. We m...

This paper introduces the marching cube octree data structure, a new scheme for representing and generating the mesh of various level-of-details (LODs). The marching cube octree is based on the data structure of the Marching Cube algorithm [1 ], which is used to generate the mesh from the range data and the octree, this last widely used in computer graphics. Our LOD model can support adaptive s...

Chernyaev’s Marching Cubes 33 is one of the first algorithms intended to preserve the topology of the trilinear interpolant. In this work, we address three issues with the Marching Cubes 33 algorithm, two of which are related to its original description and one that is related to its variant. In particular, we solve a problem with the core disambiguation procedure of Marching Cubes 33 that prev...

Surface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned natu...

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 ...

[Purpose] The purpose of the present study was to investigate the effect of trumpet and marching euphonium performance posture on the trunk and lower limb musculoskeletal system. [Subjects] The subjects were 10 female university students. [Methods] Subjects maintained a resting position, a trumpet performance posture, and a marching euphonium performance posture. The angles and muscle activitie...

We introduce Neural Marching Cubes , a data-driven approach for extracting triangle mesh from discretized implicit field. base our meshing on (MC), due to the simplicity of its input, namely uniform grid signed distances or occupancies, which frequently arise in surface reconstruction and neural models. However, classical MC is defined by coarse tessellation templates isolated individual cubes....