A marching cube algorithm based on edge growth
نویسندگان
چکیده
The marching cube algorithm is currently one of the most popular three-dimensional (3D) reconstruction surface rendering algorithms. It forms voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from voxels. processes each voxel in a traversal-based manner, but it does not consider relationship between adjacent cubes. Owing ambiguity, final reconstructed model may have holes. In this paper, we propose edge growth. first extracts seed triangles, grows these reconstructs entire 3D model. According position growth edge, 17 with isosurfaces. results showed that can reconstruct well. When only main contour required, performs addition, when there are multiple scattered parts data, contours connected by setting region selected seed.
منابع مشابه
Volume Rendering with Marching Cube Algorithm
The volume rendering is one of the most useful techniques in medical visualizations, computer-aid diagnosis and other related areas. Among all the different approaches to realize it, the marching cube algorithm is the most popular one. This report is to present our approach to implement this algorithm. According to the algorithm, the whole volume data is divide into small cubes, each of them co...
متن کاملEdge-Constrained Marching Triangles
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marching Triangles algorithm where the inputs are multiple range images of scenes. C discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp ...
متن کاملA Generalized Marching Cubes Algorithm Based On Non-Binary Classifications
We present a new technique for generating surface meshes from a uniform set of discrete samples. Our method extends the well-known marching cubes algorithm used for computing polygonal isosurfaces. While in marching cubes each vertex of a cubic grid cell is binary classified as lying above or below an isosurface, in our approach an arbitrary number of vertex classes can be specified. Consequent...
متن کاملCube-based diffusion algorithm
We study molecular diffusion in (linear) nanopores with different types of roughness in the so-called Knudsen regime. Knudsen diffusion represents the limiting case of molecular diffusion in pores, where mutual encounters of the molecules within the free pore space may be neglected and the time of flight between subsequent collisions with the pore walls significantly exceeds the interaction tim...
متن کاملCube-based diffusion algorithm v12
We study molecular diffusion in (linear) nanopores with different types of roughness in the so-called Knudsen regime. Knudsen diffusion represents the limiting case of molecular diffusion in pores, where mutual encounters of the molecules within the free pore space may be neglected and the time of flight between subsequent collisions with the pore walls significantly exceeds the interaction tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Virtual Reality & Intelligent Hardware
سال: 2021
ISSN: ['2096-5796', '2666-1209']
DOI: https://doi.org/10.1016/j.vrih.2021.08.006