Marching Cubes and Variants

Isosurfaces ◽  
2013 ◽  
pp. 17-54
Keyword(s):  
Marching Cubes

CPU-GPU Rendering of CT Scan Images for Vertebra Reconstruction from CT Scan Images with a Calibration Policy

2020 ◽  
pp. 1-5
Author(s):  
Usman Khan ◽  
Usman Khan ◽  
AmanUllah Yasin ◽  
Imran Shafi ◽  
Muhammad Abid
Keyword(s):  
3D Reconstruction ◽  
Ct Scan ◽  
Surface Reconstruction ◽  
3D Visualization ◽  
Cervical Vertebra ◽  
Marching Cubes ◽  
Affine Transform ◽  
Visualization Techniques ◽  
Visualization Algorithms ◽  
Gpu Implementation

In this work GPU implementation of classic 3D visualization algorithms namely Marching Cubes and Raycasting has been carried for cervical vertebra using VTK libraries. A proposed framework has been introduced for efficient and duly calibrated 3D reconstruction using Dicom Affine transform and Python Mayavi framework to address the limitation of benchmark visualization techniques i.e. lack of calibration, surface reconstruction artifacts and latency.

Dual-Primal Mesh Optimization for Polygonized Implicit Surfaces With Sharp Features

2002 ◽  
Vol 2 (4) ◽  
pp. 277-284 ◽  
Author(s):  
Yutaka Ohtake ◽  
Alexander G. Belyaev
Keyword(s):  
Adaptive Mesh ◽  
Implicit Surfaces ◽  
Marching Cubes ◽  
Triangle Mesh ◽  
Implicit Surface ◽  
Weighted Vertex ◽  
Visualization Toolkit ◽  
Object Oriented Approach ◽  
Speed And Accuracy ◽  
Dual Mesh

A new method for improving polygonizations of implicit surfaces with sharp features is proposed. The method is based on the observation that, given an implicit surface with sharp features, a triangle mesh whose triangles are tangent to the implicit surface at certain inner triangle points gives a better approximation of the implicit surface than the standard Marching Cubes mesh [Lorensen, W.E., and Cline, H.E., 1987, Computer Graphics (Proceedings of SIGGRAPH ’87), 21(3), pp. 163–169] (in our experiments we use VTK Marching Cubes [Schroeder, W., Martin, K., and Lorensen, W., 1998, The Visualization Toolkit: An Object-Oriented Approach to 3-D Graphics, Prentice Hall]). First, given an initial triangle mesh, its dual mesh composed of the triangle centroids is considered. Then the dual mesh is modified such that its vertices are placed on the implicit surface and the mesh dual to the modified dual mesh is considered. Finally the vertex positions of that “double dual” mesh are optimized by minimizing a quadratic energy measuring a deviation of the mesh normals from the implicit surface normals computed at the vertices of the modified dual mesh. In order to achieve an accurate approximation of fine surface features, these basic steps are combined with adaptive mesh subdivision and curvature-weighted vertex resampling. The proposed method outperforms approaches based on the mesh evolution paradigm in speed and accuracy.

Probabilistic Marching Cubes

2011 ◽  
Vol 30 (3) ◽  
pp. 931-940 ◽  
Author(s):  
Kai Pöthkow ◽  
Britta Weber ◽  
Hans-Christian Hege
Keyword(s):  
Marching Cubes

Modification of the Marching Cubes Algorithm to Obtain a 3D Representation of a Planar Image

2021 ◽  
Vol 47 (3) ◽  
pp. 215-223
Author(s):  
Delia Irazú Hernández Farías ◽  
Rafael Guzmán Cabrera ◽  
Teodoro Cordova Fraga ◽  
José Zacarías Huamaní Luna ◽  
Jose Francisco Gomez Aguilar
Keyword(s):  
Marching Cubes ◽  
Planar Image ◽  
Marching Cubes Algorithm ◽  
3D Representation

Contouring Medial Surface of Thin-Plate Structures Using Local Marching Cubes

2005 ◽  
Vol 5 (2) ◽  
pp. 111-115 ◽  
Author(s):  
Tomoyuki Fujimori ◽  
Hiromasa Suzuki ◽  
Yohei Kobayashi ◽  
Kiwamu Kase
Keyword(s):  
Thin Plate ◽  
Computer Aided Design ◽  
Prototype System ◽  
Marching Cubes ◽  
Plate Structures ◽  
Medial Surface ◽  
Surface Models ◽  
Marching Cubes Algorithm ◽  
Computer Aided ◽  
Ct Data

This paper describes a new algorithm for contouring a medial surface from CT (computed tomography) data of a thin-plate structure. Thin-plate structures are common in mechanical structures, such as car body shells. When designing thin-plate structures in CAD (computer-aided design) and CAE (computer-aided engineering) systems, their shapes are usually represented as surface models associated with their thickness values. In this research, we are aiming at extracting medial surface models of thin-plate structures from their CT data for use in CAD and CAE systems. Commonly used isosurfacing methods, such as marching cubes, are not applicable to contour the medial surface. Therefore, we first extract medial cells (cubes comprising eight neighboring voxels) from the CT data using a skeletonization method to apply the marching cubes algorithm for extracting the medial surface. It is not, however, guaranteed that the marching cubes algorithm can contour those medial cells (in short, not “marching cubeable”). In this study, therefore we developed cell operations that correct topological connectivity to guarantee such marching cubeability. We then use this method to assign virtual signs to the voxels to apply the marching cubes algorithm to generate triangular meshes of a medial surface and map the thicknesses of thin-plate structures to the triangle meshes as textures. A prototype system was developed to verify some experimental results.

Fast Volume Rendering Techniques for 3D Reconstruction of Geological Objects

2012 ◽  
Vol 182-183 ◽  
pp. 1343-1346
Author(s):  
De Wen Seng ◽  
Da Qing Li
Keyword(s):  
3D Reconstruction ◽  
Volume Rendering ◽  
Spatial Data ◽  
Real Data ◽  
Tree Structure ◽  
Marching Cubes ◽  
Geological Data ◽  
Iron Mine ◽  
Effectiveness And Efficiency ◽  
Rendering Techniques

The procedure of volume rendering techniques is introduced. The principles and methods of two kinds of different volume rendering techniques of 3D spatial data are discussed. Application of Marching Cubes (MC) algorithm in the modeling of geological objects is given. This algorithm is modified and improved in several aspects. The asymptotic decider algorithm is employed to solve the ambiguity problem and oct-tree structure is used to reduce the number of polygons generated, which will increases the efficiency of the algorithm. The improved algorithm is applied to real geological data obtained from an iron mine in China. Real data derived from an iron mine of China demonstrates the effectiveness and efficiency of the system and the algorithms.

scholarly journals An extended triangulation to the Marching Cubes 33 algorithm

2019 ◽  
Vol 25 (1) ◽  
Author(s):  
Lis Custodio ◽  
Sinesio Pesco ◽  
Claudio Silva
Keyword(s):  
Marching Cubes
Sign in / Sign up

Export Citation Format

Share Document