• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.210-216
• /
• 2009

Several empty-space leaping methods have been proposed for CPU-based volume ray casting. When sample points are located in semi-transparent cells, however, previous leaping methods perform unnecessary resamplings even if the scalar values on those points are confined within transparent range. A semi-transparent cells leaping method for volume ray casting using the Marching Cubes algorithm is proposed to solve this problem in our previous work. When a ray reaches a semi-transparent cell, our method performs in-out test between current sample point and the bounding box enclosing the triangles generated by the Marching Cubes. If the sample point lies on outside of the bounding box, we estimate the point is regarded as transparent. In this case, the ray advances to the next sample point without performing a resampling operation. We can frequently refer the tables for neighboring voxels, however, when we exploit conventional data structures of the Marching Cubes. We propose modified Marching Cubes tables for solving this problem.

• Journal of Institute of Convergence Technology
• /
• v.10 no.1
• /
• pp.7-12
• /
• 2020

We describe a efficient surface reconstruction method that reconstructs a 3D manifold polygonal mesh approximately passing through a set of 3D oriented points. Our algorithm includes 3D convex hull, octree data structure, signed distance function (SDF), and marching cubes. The 3D convex hull provides us with a fast computation of SDF, octree structure allows us to compute a minimal distance for SDF, and marching cubes lead to iso-surface generation with SDF. Our approach gives us flexibility in the choice of the resolution of the reconstructed surface, and it also enables to use on low-level PCs with minimal peak memory usage. Experimenting with publicly available scan data shows that we can reconstruct a polygonal mesh from point cloud of sizes varying from 10,000 ~ 1,000,000 in about 1~60 seconds.

• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1900-1908
• /
• 2016

Recent times have seen the introduction of modeling technologies using implicit surface and marching cubes algorithm in the field of computer graphics. Implicit surface modeling is used to express characters or fluid. This study presents a calculation method for the density of curve skeletal primitives using parametric curve and implements an implicit surface modeling tool by utilizing Maya API. Skeletal primitives can be assembled and utilized in character modeling using the implemented modeling tool. Results could be obtained more effectively compared to existing particle-based methods.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.173-180
• /
• 2005

This paper proposes an effective algorithm that combines both the stereo matching and the marching cube algorithm. By applying the stereo matching technique to an image obtained from various angles, 3D geometry data are acquired, and using the camera extrinsic parameter, the images are combined. After reconstructing the combined data into mesh using the image index, the normal vector equivalent to each point is obtained and the mesh smoothing is processed. This paper describes the successive processes and techniques on the 3D mesh reconstruction, and by proposing the intermediate iso- surface algorithm. Therefore it improves the 3D data instability problem caused when using the conventional marching cube algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1081-1089
• /
• 1999

Volume data modeling is concerned with finding a mathematical function which represents the relationship implied by the 3D data. Modeling a volume data geometrically can visualize a volume data using surface graphics without voxelization. It has many merits in that it is fast and requires little memory. We proposes, a method based on wavelet transformation and tetrahedrization. we implement a prototype system based on the proposed method. Last, we evaluated the proposed method comparing it with marching cube algorithm. the evaluation results show that though the proposed method uses only 13% of the volume data, the images generated is as good as the images generated by the marching cubes algorithm.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.19-29
• /
• 2017

When a fixed-sized memory allocation method is used for sparse volume data, a considerable memory space is in general wasted, which becomes more serious for a large volume of high resolution. In this paper, in order to reduce such unnecessary memory consumption, we propose a volume representation method to store mostly voxels that represent valid information rather than all voxels in a fixed volume space. Then our method is compared with the conventional static memory allocation method, an octree-based representation, and a voxel hashing method in terms of memory usage and computation speed. In particular, we compare the proposed method and the voxel hashing method with respect to implementation of the GPU-based Marching Cubes algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.4
• /
• pp.436-443
• /
• 1999

Most of the 3D object reconstruction techniques divide the object into multiplane and approximate the surfaces of the object. The Marching Cubes Algorithm which initializes the mesh structure using a given isovalue. and Delaunay Tetrahedrisation are widely used. Deformable models are well-suited for general object reconstruction because they make little assumptions about the shape to recover and they can reconstruct objects *om various types of datasets. Now, many researchers are studying the reconstruction systems based on a deformable model. In this paper, we propose a novel method for reconstruction of 3D objects. This method, for a 3D object composed of curved planes, compresses the 3D object based on the adaptive simplexmesh technique. It changes the pre-defined mesh structure, so that it may approach to the original object. Also, we redefine the geometric characteristics such as curvatures. As results of simulations, we show reconstruction of the original object with high compression and concentration of vertices towards parts of high curvature in order to optimize the shape description.

• Journal of the Korean Society of Radiology
• /
• v.1 no.2
• /
• pp.23-30
• /
• 2007

This paper presents a method of generating 3-dimensional images by preprocessing 2-dimensional abdominal images obtained using CT (computed tomography) and MRI (magnetic resonance imaging) through segmentation, threshold technique, etc. and apply the method to virtual endoscopy. Three-dimensional images were visualized using indirect volume rendering, which can render at high speed using a general-purpose graphic accelerator used in personal computers. The algorithm used in the rendering is Marching Cubes, which has only a small volume of calculation. In addition, we suggested a method of producing 3-dimensional images in VRML (virtual reality modeling language) running on the Web browser without a workstation or an exclusive program. The number of nodes, the number of triangles and the size of a 3-dimensional image file from CT were 85,367, 174,150 and 10,124, respectively, and those from MRI were 34,029, 67,824 and 3,804, respectively.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.11
• /
• pp.201-205
• /
• 1997

With the recent advance of Web and its associated technologies, information sharing on distribute computing environments has gained a great amount of attention from many researchers in many application areas, such as medicine, engineering, and business. One basic requirement of distributed medical consultation systems is that geographically dispersed, disparate participants are allowed to exchange information readily with each other. Such software also needs to be supported on a broad range of computer platforms to increase the software's accessibility. In this paper, the development of world-wide-web based medical consultation system or radiology imaging is addressed to provide the platform independence and great accessibility. The system supports sharing of 3-dimensional objects. We use VRML (Virtual Reality Modeling Language), which is the de-facto standard in 3-D modeling on the Web. 3-D objects are reconstructed from CT or MRI volume data using a VRML format, which can be viewed and manipulated easily in Web-browsers with a VRML plug-in. A Marching cubes method is used in the transformation of scanned volume data set to polygonal surfaces of VRML. A decimation algorithm is adopted to reduce the number of meshes in the resulting VRML file. 3-D volume data are often very large-sized, and hence loading the data on PC level computers requires a significant reduction of the size of the data, while minimizing the loss of the original shape information. This is also important to decrease network delays. A prototype system has been implemented (http://netopia.snu.ac.kr/-cyber/). and several sessions of experiments are carried out.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2016.02a
• /
• pp.172-172
• /
• 2016

Dual-beam experiments (Focused ion beam - Orientation mapping microstructure, FIB-OIM) is a widely used experimental tool because this experiments tool available alternates between automated serial sectioning and EBSD with the help of dual beams. We investigated the reconstruction procedure for analysis tool which three-dimensional internal microstructure using Ni superalloy(IN100) and ZrO2. As a results, we observed annealing twin boundary each layer in Ni superalloy(IN100) and fairly isotropic internal microstructure in ZrO2 using marching cubes algorithm. According to these results, this procedure is reconstructed well and we gained ability to arrange the EBSD map and internal microstructure.