• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.387-390
• /
• 2024

본 논문에서는 효율적인 2차 오차 함수를 이용하여 입자 기반에서 EMC(Extended Marching Cubes) 알고리즘을 구현할 수 있는 새로운 알고리즘을 제안한다. Smoothing 커널(Kernels)을 통해 계산한 입자 평균 위치에서 레벨셋(Level-set)을 계산해 스칼라장을 구축한다. 그리고 난 뒤 SPH(Smoothed particle hydrodynamics)기반의 커널을 통해 밀도, 입자 평균 위치를 계산한다. 스칼라장을 이용해 등가 곡면(Isosurface)을 찾고 음함수로 표현된 표면을 구성한다. SPH 커널을 공간에서 미분하면 공간상의 어느 위치에서나 기울기를 계산할 수 있고, 이를 통해 얻어진 법선벡터를 이용하여 일반적인 EMC나 DC(Dual contouring)에서 사용하는 2차 오차 함수를 효율적으로 설계한다. 결과적으로 제안하는 방법은 메쉬와 같이 연결정보다 없는 입자 기반 데이터에서도 EMC 알고리즘을 구현하여 볼륨(Volume) 손실을 줄이고, 복잡한 음함수 표면을 표현할 수 있게 한다.

• 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 the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2018

We propose a modified real-time marching cubes technique that extracts isosurfaces in the form of connected meshes instead of triangle soup. In this way, a various mesh-based isosurface rendering techniques can be implemented and additional information of the isosurfaces such as its topology can be extracted in real-time. In addition, we propose a real-time technique to extract adjacency-triangle structure for geometry shaders that can be used for various shading effects such as silhouette rendering. Compared with the previous technique that welds the output triangles of classical marching cubes, our technique shows up to 300% performance improvement.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.427-429
• /
• 2002

본 논문에서는 Marching Cubes(MC)의 알고리즘을 이용하여 3차원 모델을 빠르게 복원하기 위한 방법을 제안한다. MC 알고리즘은 대용량의 데이터를 복원하기 때문에 많은 수의 복셀로부터 등가면을 추출하는데 오랜 시간이 걸린다. 또한 많은 수의 삼각형 패치 생성은 빠른 렌더링을 수행할 수 없다는 단점이 있다. 본 논문에서는 등가면 추출 및 형성시간을 단축하고 형성된 등가면을 통한하는 과정을 동해 실행시간과 렌더링 시간을 단축할 수 있는 방법을 제안함으로써 MC의 문제점을 해결한다.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.956-959
• /
• 2021

마칭 큐브 알고리즘은 등밀도 곡면을 추출하는 과정에서 skinny triangle을 자주 생성한다. Skinny triangle은 한 변의 길이 또는 한 개의 내각이 기준치 이하인 삼각형으로서, 곡면을 처리할 때 여러 문제를 발생시킨다. 본 논문에서는 마칭 큐브 알고리즘에서 고려되는 15가지의 복셀 종류에 따라 skinny triangle을 제거할 수 있는 방법을 제안한다.

• 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.