• Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.151-160
• /
• 2016

Cutter-workpiece engagement (CWE) is the instantaneous contact geometry between the cutter and the in-process workpiece during machining. It plays an important role in machining process simulation and directly affects the calculation of the predicted cutting forces and torques. The difficulty and challenge of CWE determination come from the complexity due to the changing geometry of in-process workpiece and the curved tool path of cutter movement, especially for multi-axis milling. This paper presents a new method to determine the CWE for general milling processes. To fulfill the requirement of generality, which means for any cutter type, any in-process workpiece shape, and any tool path even with self-intersections, all the associated geometries are to be modeled as triangle meshes. The involved triangle-to-triangle intersection calculations are carried out by an effective method in order to realize the multiple subtraction Boolean operations between the tool and the workpiece mesh models and to determine the CWE. The presented method has been validated by a series of case studies of increasing machining complexity to demonstrate its applicability to general milling processes.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.1
• /
• pp.33-41
• /
• 2009

Triangular mesh models are widely used in reverse engineering, computer graphics, rapid prototyping and NC(numerical controller) tool-path generation. Triangular mesh models are generated from point clouds, surface models and solid models. A halfedge-based triangular mesh data structure is proposed and the development considerations are presented. In the presented data structure, halfedge is the key data structure. Halfedge stores its triangle index and the order in the triangle. Triangles do not store the halfedge lists explicitly. Halfedge is referred by value and defined when it is required. Proposed data structure supports four design requirements: efficient rendering, compact memory, supporting efficient algorithms and easy programming.

• 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 Korea Game Society
• /
• v.14 no.2
• /
• pp.55-66
• /
• 2014

Image warping is a technology to transform input images to be suitable for given conditions and has been recently utilized in changing face shape of characters in the field of movies or animation. Mesh warping which is one of warping methods that change shapes based on the features of face forms warping images by forming rectangular mesh groups around the eyes, nose, and mouth and matching them 1:1. This method has a problem in the resultant images are distorted in the segments of boundaries between meshes when there are errors in mesh control points or when meshes have been formed as many small area meshes. This study proposes a triangle based image interpolation technique to minimize the occurrence of errors in the process of forming natural warping images of face and process accurate results with a small amount of arithmetic operation and a short time. First, feature points that represent the face are found and these points are connected to form basic triangle meshes. The fact that the proposed method can reduce errors occurring in the process of warping while reducing the amount of arithmetic operation and time is shown through experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10B
• /
• pp.1399-1408
• /
• 2001

본 논문에서는 삼각형 메쉬(triangular mesh)로 이루어진 3차원 모델의 연결 정보(connectivity data)와 형상 정보(geometry data)를 삼각형 팬(triangle fan) 구조에 기반하여 효율적으로 압축하는 부호화 기법을 제안한다. 첫째로, 연결 정보의 무손실 부호화로 꼭지점 차수 왜곡(vertex degree warping) 기법을 제안한다. 기존의 알고리듬이 연결 정보와 형상 정보를 분리하여 부호화하는데 반해 제안하는 알고리듬은 연결 정보를 부호화하는데 형상 정보를 이용하여 압축 효율을 높인다. 둘째로, 형상 정보를 압축하기 위해 이중 평행사변형 예측(dual parallelogram prediction) 기법을 제안한다. 삼각형 팬 구조를 이용함으로써 기존의 삼각형 스트립(triangle strip) 기반의 알고리듬보다 정확한 형상 예측이 가능하고, 예측 오차가 작아지게 된다. 다양한 3차원 메쉬 모델에 대한 모의 실험을 통하여 제안하는 알고리듬이 기존의 알고리듬보다 우수한 압축 성능을 나타냄을 확인하다.

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

날로 커져가는 3D 모델을 효율적으로 사용하기 위한 노력으로 압축처리 방법들이 연구되고 있다. 본 논문에서는 3D 모델의 메쉬를 Layer로 분할하여 Vertex Layer와 Triangle Layer를 생성 후, 삼각형들을 몇가지 연산코드로 분류하여 압축(compression)하는 방법을 제안한다. Triangle Layer는 기본 정점으로부터 연결된 선분의 정점들로 이루어진 Vertex Layer의 쌍을 이용하여 만들어진다. 이 Triangle Layer에 해당 되는 삼각형들의 연결 정보를 제안한 연산코드로 분류하고, 이것을 엔트로피 코딩하여 3D 모델을 압축한다. 이 기법은 삼각형의 형태를 기준으로 한 개나 두 개의 삼각형을 하나의 연산코드로 분류하거나 삼각형의 연결 상황에 따라 하나의 연산코드로 분류하여 연결정보를 표현한다. 복원(decompression)시에는 연산 코드를 이용하여 삼각형의 연결정보를 뽑아내면 원 상태의 3D 모델을 획득할 수 있다. 이 방법은 연결 정보를 무손실 압축하는 방법으로, 지금까지 제안된 압축기법과 비교할 때, 간단하면서도 월등한 압축 효과를 볼 수 있다.

• Journal of Digital Convergence
• /
• v.11 no.8
• /
• pp.205-212
• /
• 2013

In this paper, we present a procedural modeling algorithms to create Korean traditional stone fence using the fractal subdivision. The main process of the algorithm is to get the next step mesh by subdividing each triangle in the previous step triangular mesh. This process is repeated recursively. Dividing each triangle into four sub-triangles after choosing a random point on each side of the triangle and moving each vertices in the normal direction with random perturbations make the bumpy appearance of stone fences. In each step we remove flat vertices which does not influence the shape of the stone. The discrete curvature determines the flatness of a vertex. New triangles whose vertices are the vertices around the removed vertex are added to make a triangular mesh.

• Spatial Information Research
• /
• v.22 no.1
• /
• pp.35-43
• /
• 2014

The Triangle Mesh Warping method is suggested and applied in coordinate transformation to world geodetic system in this study. The common points of Uiwang city are used to compare the transformation accuracy of the suggested methods with existing national coordinate transformation methods. As a result, the Triangle Mesh Warping method was satisfied with accuracy criteria for positioning on a map larger than scale 1/1,000 with smaller number of common points and without distortion modeling. Additionally, in case of Guri and Pyeongtaek city that established the World Geodetic System, the suggested method generates the result of transformation accuracy better than 5cm. Based on the test, it was found that the suggested method improves the problem of securing many common points and reduces the problem of mis-match between the transformed data of adjacent areas. Accordingly, for transformation of large-scale topographic map, cadastral map, GIS DB and serial cadastral map to the World Geodetic System, it is judged that the Triangle Mesh Warping would be a good method for economical efficiency and accuracy using by minimum common point.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.06a
• /
• pp.325-326
• /
• 2009

• Proceedings of the Optical Society of Korea Conference
• /
• 2007.02a
• /
• pp.171-172
• /
• 2007