Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been...Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been improved in two aspects. By analyzing the principles of the MC algorithm, as well as the features of the specific application, improvements were developed to: eliminate ambiguities by using a unified isosurface constructing method in the voxels, and improve the operating efficiency of the MC algorithm by incorporating an octree structure. The analytical results of the examples demonstrate the effectiveness of our proposal.展开更多
An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits. The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic de...An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits. The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm. The implementation scheme was applied to model and reconstruct the surfaces of mineral deposits, using the geological data obtained from an iron mine in China. Experimental results demonstrate the ability of the implementation scheme to solve the ambiguity problem, and illustrate the effectiveness and efficiency of the MC algorithm in the visualization of mineral deposits.展开更多
The marching cube algorithm is currently one of the most popular three-dimensional(3D)reconstruction surface rendering algorithms.It forms cube voxels based on an input image and then uses 15 basic topological configu...The marching cube algorithm is currently one of the most popular three-dimensional(3D)reconstruction surface rendering algorithms.It forms cube voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from the voxels.The algorithm processes each cube voxel in a traversal-based manner,but it does not consider the relationship between the isosurfaces in adjacent cubes.Owing to ambiguity,the final reconstructed model may have holes.In this paper,we propose a marching cube algorithm based on edge growth.The algorithm first extracts seed triangles,grows these seed triangles,and then reconstructs the entire 3D model.According to the position of the growth edge,we propose 17 topological configurations with isosurfaces.The reconstruction results showed that the algorithm can reconstruct the 3D model well.When only the main contour of the 3D model is required,the algorithm performs well.In addition,when there are multiple scattered parts in the data,the algorithm can extract only the 3D contours of the parts connected to the seed by setting the region selected based on the seed.展开更多
Medical images 3D reconstruction is an important part in medical image analysis and processing. Although lots of algorithms have been proposed continuously, speed and accuracy cannot conform to actual needs, which has...Medical images 3D reconstruction is an important part in medical image analysis and processing. Although lots of algorithms have been proposed continuously, speed and accuracy cannot conform to actual needs, which has always been the focus topic. In this paper, we propose an Improved Marching Cubes algorithm ( I-MC) based on the surface rendering theory, which implements 3D reconstruction of the vertebrae. Firstly, we preprocessed the original 2D vertebrae CT images with the bilateral-filter denoising algorithm. Secondly, on the basis of the traditional Marching Cubes algorithm, the seed voxels were extracted and the Region Growing algorithm was used to determine all voxels that contain isosurfaces. Then, the Golden Section instead of the traditional linear interpolation was used to calculate the equivalent point, and this method reduced the calculations of public edges. VTK and OpenGL implemented 3D reconstruction of the vertebrae on GPU quickly and accurately. The experimental results show that when compared with the traditional Marching Cubes algorithm and Mesh Simplification Marching Cubes algorithm, the improved algorithm achieves a significant improvement of reconstruction speed while preserving the accurate results. The efficiency of algorithm is improved dramatically. This method is real-time and achieves the goal of efficient 3D reconstruction of vertebrae CT images.展开更多
The well-known marching cubes method is used to generate isosurfaces from volume data or data on a 3D rectilinear grid. To do so, it refers to a lookup table to decide on the possible configurations of the isosurface ...The well-known marching cubes method is used to generate isosurfaces from volume data or data on a 3D rectilinear grid. To do so, it refers to a lookup table to decide on the possible configurations of the isosurface within a given cube, assuming we know whether each vertex lies inside or outside the surface. However, the vertex values alone do not uniquely determine how the isosurface may pass through the cube, and in particular how it cuts each face of the cube. Earlier lookup tables are deficient in various respects. The possible combinations of the different configurations of such ambiguous faces are used in this paper to find a complete and cor- rect lookup table. Isosurfaces generated using the new lookup table here are guaranteed to be watertight.展开更多
We present some new methods for parameterizing the triangle mesh surface （TMS） which result from the Marching Cubes （MC） algorithm. The methods apply to surfaces of genus zero and the parameter domain is a unit sp...We present some new methods for parameterizing the triangle mesh surface （TMS） which result from the Marching Cubes （MC） algorithm. The methods apply to surfaces of genus zero and the parameter domain is a unit sphere. We take advantage of some special properties of the TMS resulting from the MC algorithm to obtain simple, computational efficient representations of the nearest neighbor coordinates and utilize these coordinates in the characterization of the parameterization by means of systems of equations which are solved iteratively. Examples and comparisons are presented.展开更多
A front tracking method based on a marching cubes isosurface extractor, which is related filter generating isosurfaces from a structured point set, is provided to achieve sharp resolution for the simulation of non-dif...A front tracking method based on a marching cubes isosurface extractor, which is related filter generating isosurfaces from a structured point set, is provided to achieve sharp resolution for the simulation of non-diffusive interfacial flow. Compared with the traditional topology processing procedure, the current front tracking method is easier to be implemented and presents high performance in terms of computational resources. The numerical tests for 2-D highly-shearing flows and 3-D bubbles merging process are conducted to numerically examine the performance of the current methodology for tracking interfaces between two immiscible fluids The Rayleigh-Taylor （RT） and Richtmyer-Meshkov （RM） instability problems are successfully investigated with the present marching cubes based front tracking method.展开更多
A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Sh...A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial contour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes (MC) algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by experimental results.展开更多
Three-dimensional reconstructions from tomography slices are paid great attention in medical applications nowadays. This paper introduces the design and the implement of VolGraph system: a new, inexpensive, PC-based v...Three-dimensional reconstructions from tomography slices are paid great attention in medical applications nowadays. This paper introduces the design and the implement of VolGraph system: a new, inexpensive, PC-based visualization tool for three-dimensional medical reconstructions, which fully integrates the latest popular visualization algorithms ranging from classical surface rendering algorithm to volume rendering algorithms, such as Ray Casting, Splatting, and Shear-Warp.The input of VolGraph can be medical ima- ges including CT, MRI, etc, and the output can be in common image, VRML/XML or animation formats. Practice proves that the realization of a medical volume visualization system is now feasible on desktop PCs.展开更多
This paper describes a novel sharp interface approach for modeling the cavitation phenomena in incompressible viscous flows. A one-field formulation is adopted for the vapor-liquid two-phase flow and the interface is ...This paper describes a novel sharp interface approach for modeling the cavitation phenomena in incompressible viscous flows. A one-field formulation is adopted for the vapor-liquid two-phase flow and the interface is tracked using a volume of fluid（VOF） method. Phase change at the interface is modeled using a simplification of the Rayleigh-Plesset equation. Interface jump conditions in velocity and pressure field are treated using a level set based ghost fluid method. The level set function is constructed from the volume fraction function. A marching cubes method is used to compute the interface area at the interface grid cells. A parallel fast marching method is employed to propagate interface information into the field. A description of the equations and numerical methods is presented. Results for a cavitating hydrofoil are compared with experimental data.展开更多
基金Projects 20020008006 supported by the Exclusive Research Foundation for Doctoral Programs by Ministry of Education of China2006BAK04B04 by the National Key Project of Scientific and Technical Supporting Programs Funded by Ministry of Science & Technology of China
文摘Orebody-rendering techniques are developed using the marching cubes (MC) algorithm. The shape of an orebody is viv- idly displayed in real time and can be used to guide mining design as well. The MC algorithm has been improved in two aspects. By analyzing the principles of the MC algorithm, as well as the features of the specific application, improvements were developed to: eliminate ambiguities by using a unified isosurface constructing method in the voxels, and improve the operating efficiency of the MC algorithm by incorporating an octree structure. The analytical results of the examples demonstrate the effectiveness of our proposal.
基金This study is financially supported by the Ph.D. Programs Foundation of the Ministry of Education of China (No. 20020008006).
文摘An implementation scheme of the marching cubes (MC) algorithm was presented for the visualization of mineral deposits. The basic principles, processes and pitfalls of the MC algorithm were discussed. The asymptotic decider algorithm was employed to solve the ambiguity problem associated with the MC algorithm. The implementation scheme was applied to model and reconstruct the surfaces of mineral deposits, using the geological data obtained from an iron mine in China. Experimental results demonstrate the ability of the implementation scheme to solve the ambiguity problem, and illustrate the effectiveness and efficiency of the MC algorithm in the visualization of mineral deposits.
基金the NSFC(61972117)the Natural Science Foundation of Heilongjiang Province of China(ZD2019E007)。
文摘The marching cube algorithm is currently one of the most popular three-dimensional(3D)reconstruction surface rendering algorithms.It forms cube voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from the voxels.The algorithm processes each cube voxel in a traversal-based manner,but it does not consider the relationship between the isosurfaces in adjacent cubes.Owing to ambiguity,the final reconstructed model may have holes.In this paper,we propose a marching cube algorithm based on edge growth.The algorithm first extracts seed triangles,grows these seed triangles,and then reconstructs the entire 3D model.According to the position of the growth edge,we propose 17 topological configurations with isosurfaces.The reconstruction results showed that the algorithm can reconstruct the 3D model well.When only the main contour of the 3D model is required,the algorithm performs well.In addition,when there are multiple scattered parts in the data,the algorithm can extract only the 3D contours of the parts connected to the seed by setting the region selected based on the seed.
基金Sponsored by the Science and Technology Research Projects of Education Department of Heilongjiang Province(Grant No.12531119)
文摘Medical images 3D reconstruction is an important part in medical image analysis and processing. Although lots of algorithms have been proposed continuously, speed and accuracy cannot conform to actual needs, which has always been the focus topic. In this paper, we propose an Improved Marching Cubes algorithm ( I-MC) based on the surface rendering theory, which implements 3D reconstruction of the vertebrae. Firstly, we preprocessed the original 2D vertebrae CT images with the bilateral-filter denoising algorithm. Secondly, on the basis of the traditional Marching Cubes algorithm, the seed voxels were extracted and the Region Growing algorithm was used to determine all voxels that contain isosurfaces. Then, the Golden Section instead of the traditional linear interpolation was used to calculate the equivalent point, and this method reduced the calculations of public edges. VTK and OpenGL implemented 3D reconstruction of the vertebrae on GPU quickly and accurately. The experimental results show that when compared with the traditional Marching Cubes algorithm and Mesh Simplification Marching Cubes algorithm, the improved algorithm achieves a significant improvement of reconstruction speed while preserving the accurate results. The efficiency of algorithm is improved dramatically. This method is real-time and achieves the goal of efficient 3D reconstruction of vertebrae CT images.
文摘The well-known marching cubes method is used to generate isosurfaces from volume data or data on a 3D rectilinear grid. To do so, it refers to a lookup table to decide on the possible configurations of the isosurface within a given cube, assuming we know whether each vertex lies inside or outside the surface. However, the vertex values alone do not uniquely determine how the isosurface may pass through the cube, and in particular how it cuts each face of the cube. Earlier lookup tables are deficient in various respects. The possible combinations of the different configurations of such ambiguous faces are used in this paper to find a complete and cor- rect lookup table. Isosurfaces generated using the new lookup table here are guaranteed to be watertight.
基金supported by the US Army Research Office under contract W911NF-05-1-0301the US National Science Foundation.
文摘We present some new methods for parameterizing the triangle mesh surface （TMS） which result from the Marching Cubes （MC） algorithm. The methods apply to surfaces of genus zero and the parameter domain is a unit sphere. We take advantage of some special properties of the TMS resulting from the MC algorithm to obtain simple, computational efficient representations of the nearest neighbor coordinates and utilize these coordinates in the characterization of the parameterization by means of systems of equations which are solved iteratively. Examples and comparisons are presented.
基金supported by the National Natural Science Foundation of China (Grant No. 10702064)
文摘A front tracking method based on a marching cubes isosurface extractor, which is related filter generating isosurfaces from a structured point set, is provided to achieve sharp resolution for the simulation of non-diffusive interfacial flow. Compared with the traditional topology processing procedure, the current front tracking method is easier to be implemented and presents high performance in terms of computational resources. The numerical tests for 2-D highly-shearing flows and 3-D bubbles merging process are conducted to numerically examine the performance of the current methodology for tracking interfaces between two immiscible fluids The Rayleigh-Taylor （RT） and Richtmyer-Meshkov （RM） instability problems are successfully investigated with the present marching cubes based front tracking method.
文摘A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial contour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes (MC) algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by experimental results.
文摘Three-dimensional reconstructions from tomography slices are paid great attention in medical applications nowadays. This paper introduces the design and the implement of VolGraph system: a new, inexpensive, PC-based visualization tool for three-dimensional medical reconstructions, which fully integrates the latest popular visualization algorithms ranging from classical surface rendering algorithm to volume rendering algorithms, such as Ray Casting, Splatting, and Shear-Warp.The input of VolGraph can be medical ima- ges including CT, MRI, etc, and the output can be in common image, VRML/XML or animation formats. Practice proves that the realization of a medical volume visualization system is now feasible on desktop PCs.
基金supported by the NSWC Carderock ILIR programby the US Office of Naval Research(Grant No.N000141-01-00-1-7)
文摘This paper describes a novel sharp interface approach for modeling the cavitation phenomena in incompressible viscous flows. A one-field formulation is adopted for the vapor-liquid two-phase flow and the interface is tracked using a volume of fluid（VOF） method. Phase change at the interface is modeled using a simplification of the Rayleigh-Plesset equation. Interface jump conditions in velocity and pressure field are treated using a level set based ghost fluid method. The level set function is constructed from the volume fraction function. A marching cubes method is used to compute the interface area at the interface grid cells. A parallel fast marching method is employed to propagate interface information into the field. A description of the equations and numerical methods is presented. Results for a cavitating hydrofoil are compared with experimental data.
