• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4463-4482
• /
• 2020

Mesh model generated from 3D reconstruction usually comes with lots of noise, which challenges the performance and robustness of mesh simplification approaches. To overcome this problem, we present a novel method for mesh simplification which could preserve structure and improve the accuracy. Our algorithm considers both the planar structures and linear features. In the preprocessing step, it automatically detects a set of planar structures through an iterative diffusion approach based on Region Seed Growing algorithm; then robust linear features of the mesh model are extracted by exploiting image information and planar structures jointly; finally we simplify the mesh model with plane constraint QEM and linear feature preserving strategies. The proposed method can overcome the known problem that current simplification methods usually degrade the structural characteristics, especially when the decimation is extreme. Our experimental results demonstrate that the proposed method, compared to other simplification algorithms, can effectively improve the quality of mesh and yield an increased robustness on noisy input mesh.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.365-372
• /
• 2004

Recently, the studies for mesh simplification have been increased according to the application area of the complicate 3D mesh models has been expanded. This paper introduces a novel method for mesh simplification which uses the properties of the mesh model in addition to the geometric locations of the model. The information of the 3D mesh model Includes surface properties such as color, texture, and curvature information as well as geometic information of the model. The most of current simplification methods adopt such geometric information and surface properties individually for mesh simplification. However, the proposed simplification method combines the geometric information and solace properties and applies them to the simplification process simultaneously. In this paper, we exploit the extended geometry based quadric error metric(QEM) which relatively allows fast and accurate geometric simplification of mesh. Thus, the proposed mesh simplification utilizes the quadric error metric based on geometric information and the surface properties such as color, normal, and texture. The proposed mesh simplification method can be expressed as a simple quadric equation which expands the quadric error metric based on geometric information by adding surface properties such as color, normal, and texture. From the experimental results, the simplification of the mesh model based on the proposed method shows the high fidelity to original model in some respects such as global appearance rather than using current geometry based simplification.

• International Journal of CAD/CAM
• /
• v.6 no.1
• /
• pp.73-79
• /
• 2006

In this paper, we propose a new triangular finite element mesh generation method based on simplification of high-density mesh and adaptive Level-of-Detail (LOD) methods for efficient CAE. In our method, mesh simplification is used to control the mesh properties required for FE mesh, such as the number of triangular elements, element shape quality and size while keeping the specified approximation tolerance. Adaptive LOD methods based on vertex hierarchy according to curvature and region of interest, and global LOD method preserving density distributions are also proposed in order to construct a mesh more appropriate for CAE purpose. These methods enable efficient generation of FE meshes with properties appropriate for analysis purpose from a high-density mesh. Finally, the effectiveness of our approach is shown through evaluations of the FE meshes for practical use.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.1312-1314
• /
• 2004

This paper proposes a new simplification algorithm that simplifies reconstructed polygonal mesh from 3D point set considering an original point set. Previous method computes error using mesh information, but it makes to increase error of difference between an original and a simplified model by reason of implementation of simplification. Proposed method simplifies a reconstructed model using an original point data, we acquire a simplified model similar an original. We show several simplified results to demonstrate the usability of our methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.51-58
• /
• 2004

In this paper, a mesh simplification algorithm is proposed which considers the conservation of the volume of a 3D model. In General, most of mesh simplification algorithm use a distance metric. The distance metric is very efficient to measure geometric error, but it causes volume changes between the original model and the simplified model. In this paper a mesh simplification algorithm which conserves the volume of the original model is suggested. A new vertex resulting from an edge contraction, takes a position which conserves the volume of the 3D model using the proposed algorithm. Although the new algorithm needs more time than the QEM algorithm, it is shown that it conserves the original volumn of the 3D model during the simplification.

• Korean Journal of Computational Design and Engineering
• /
• v.17 no.2
• /
• pp.132-139
• /
• 2012

Presented in the paper is a procedure to extract simplified triangular mesh from a height map (terrain data). The proposed algorithm works directly on a height map that extracts a simplified triangular mesh. For the simplification, the paper employs an iterative method of edge contractions. To determine an edge to be contracted, the contraction cost of an edge is evaluated through the QEM method. Normally, an edge contraction will remove two triangles sharing the edge. Although the edge contraction can be implemented easily on a triangular mesh, it is not viable to implement the operation on a height map due to the irregular topology. To handle the irregular topology during the simplification procedure, a new algorithm is introduced.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.474-477
• /
• 2000

This paper presents an algorithm for simplification of 3D triangular mesh data, based on mesh simplification. The proposed algorithm is first attempt to segment the entire mesh into several parts using the orientation of triangles. Then simplification algorithm is applied to each segment that has similar geometric property. The proposed two step multi-resolution modeling scheme would yield better performance then conventional algorithm like edge collapse technique, since the segmentation step can give global information on the input shape. The experimental results show that the proposed algorithm is performed efficiently.

• The Journal of the Korea Contents Association
• /
• v.3 no.4
• /
• pp.69-76
• /
• 2003

Recently, in computer graphics, researches on 3D animations have been very active. one of the important research areas in 3D animation is animation of human being. The creation and animation of 3D facial models has depended on animators' manual work frame by frame. Thus, it needs many efforts and time as well as various hardwares and softwares. In this paper, we implements a way to generation 3D human face model easily and quickly just with the front face images. Then, we suggests a methodology for mesh data simplification of 3D generic model.

• Journal of the Korea Computer Graphics Society
• /
• v.25 no.3
• /
• pp.75-83
• /
• 2019

In this paper we present a new technique for simultaneously simplifying N triangule meshes with the same number of vertices and the same connectivities. Applying the existing simplification technique to each of the N triangule mesh creates a simplified mesh with the same number of vertices but different connectivities. These limits make it difficult to construct a simplified blend-shape model in a high-resolution blend-shape model. The technique presented in this paper takes into account the N meshes simultaneously and performs simplification by selecting an edge with minimal removal cost. Thus, the N simplified meshes generated as a result of the simplification retain the same number of vertices and the same connectivities. The efficiency and effectiveness of the proposed technique is demonstrated by applying simultaneous simplification technique to multiple triangle meshes.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.36 no.2
• /
• pp.121-130
• /
• 2023

Finite element analysis is widely used to predict the structural stability and tooth contact performance of gears. This study focused on the effect of finite element modeling conditions of a spur gear on the simulation result and the model simplification. The gear body and teeth, teeth width, configuration of mesh, frictional coefficient, and simulation time interval (gear mesh cycle division) were selected for model simplification for gear analysis. The static transmission error during a single-gear mesh cycle was calculated to represent the performance of the gear, and the elapsed time was measured as a simplification factor. Contact stress distribution was also checked. The differences in maximum transmission error and elapsed time depending on the model simplification methods were analyzed. After all simplification methods were estimated, an optimal combination of the methods was defined, and the result was compared with that of the most detailed modeling methods.