Marching-Cube-and-Octree-Based Level-of-Detail Modelling of 3D Objects
Hae Leem Lee, H.S. Yang
Abstract
Hae Leem Lee, H.S. Yang
Abstract
The marching cube octree data structure is proposed as a scheme for representing and generating the mesh of various level-of-details (LODs). We suggest a solution to a problem of modelling partially complex objects, too. The marching cube octree is based on the data structure of the Marching Cube algorithm [1] and the octree structure. The LOD meshes are generated at run-time using proposed efficient algorithm. It triangulates only needed nodes of the marching cube octree to cover up the whole surface of mesh. Using priority numbers on nodes and flagging, the LOD mesh can be generated by only referencing without floating point operations which the other LOD models need.
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.
The marching cube octree data structure is proposed as a scheme for representing and generating the mesh of various level-of-details (LODs). We suggest a solution to a problem of modelling partially complex objects, too. The marching cube octree is based on the data structure of the Marching Cube algorithm [1] and the octree structure. The LOD meshes are generated at run-time using proposed efficient algorithm. It triangulates only needed nodes of the marching cube octree to cover up the whole surface of mesh. Using priority numbers on nodes and flagging, the LOD mesh can be generated by only referencing without floating point operations which the other LOD models need.
Key concepts: Marching cubes, Octree, Polygon mesh, Computer science, Cube (algebra), Data structure, Point cloud, Isosurface