• International Journal of Naval Architecture and Ocean Engineering
• /
• v.4 no.3
• /
• pp.228-240
• /
• 2012

Morphing is a geometric interpolation technique that is often used by the animation industry to transform one form into another seemingly seamlessly. It does this by producing a large number of 'intermediate' forms between the two 'extreme' or 'parent' forms. It has already been shown that morphing technique can be a powerful tool for form design and as such can be a useful addition to the armoury of product designers. Morphing procedure itself is simple and consists of straightforward linear interpolation. However, establishing the correspondence between vertices of the parent models is one of the most difficult and important tasks during a morphing process. This paper discusses the mesh-merging method employed for this process as against the already established mesh-regularising method. It has been found that the merging method minimises the need for manual manipulation, allowing automation to a large extent.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.25-29
• /
• 2007

In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.419-429
• /
• 2016

Generating a 3D surface model from coronary artery segmentation helps to not only improve the rendering efficiency but also the diagnostic accuracy by providing physiological informations such as fractional flow reserve using computational fluid dynamics (CFD). This paper proposes a method to generate a triangular surface mesh using vessel structure information acquired with coronary artery segmentation. The marching cube algorithm is a typical method for generating a triangular surface mesh from a segmentation result as bit mask. But it is difficult for methods based on marching cube algorithm to express the lumen of thin, small and winding vessels because the algorithm only works in a three-dimensional (3D) discrete space. The proposed method generates a more accurate triangular surface mesh for each singular vessel using vessel centerlines, normal vectors and lumen diameters estimated during the process of coronary artery segmentation as the input. Then, the meshes that are overlapped due to branching are processed by mesh merging and merged into a coronary mesh.

• The Journal of the Korea Contents Association
• /
• v.7 no.6
• /
• pp.52-59
• /
• 2007

This paper presents a greedy method for user-steered mesh segmentation, which is based on the merging priority metric defined for representing the geometric properties of meaningful parts. The priority metric is a weighted function composed of five geometric parameters: distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. This scheme can be extended without any modification only by defining more geometric parameters and adding them. Our experimental results show that the shapes of segmented parts can be controlled by setting up the weight values of geometric parameters.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.132-140
• /
• 2003

In this paper, we propose a new scheme for view-dependent transmission of three-dimensional (3-D) polygonal mesh models with hierarchial partitioning. In order to make a view-dependent representation of 3-D mesh models, we combine sequential and progressive mesh transmission techniques. By setting higher priorities to visible parts than invisible parts, we can obtain good qualify of 3-D models in a limited transmission bandwidth. In this paper, we use a multi -layer representation of 3-D mesh models based on hierarchical partitioning. After representing the 3-D mesh model in a hierarchical tree, we determine resolutions of partitioned submeshes in the last level. Then, we send 3-D model data by view-dependent selection using mesh merging and mesh splitting operations. By the partitioned mesh merging operation, we can reduce the joint boundary information coded redundantly in the partitioned submeshes. We may transmit additional mesh information adaptively through the mesh spritting operation.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.04a
• /
• pp.116-120
• /
• 2009

A two-dimensional unsteady inviscid flow solver has been developed for the simulation of complex geometric configurations on adaptive Cartesian meshes. Embedded condition was used for boundary condition and a predictor-corrector explicit time marching scheme was used for time-accurate numerical simulation. The Cartesian mesh generator, which was previously developed for steady problem, was used grid generation for unsteady flow. The solver was based on ALE formulation for body motion. For diminishing the effects of cut-cells, the cell merging method was used. Using cell merging method, it was eliminated the CFL constraints. The conservation problem, which is caused cell-type variation around region swept by solid boundary, was also solved using cell merging method. The results are presented for 2D circular cylinder and missile launching problem.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.7 s.262
• /
• pp.739-746
• /
• 2007

Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.1564-1569
• /
• 2007

This study concerns an advanced NURBS surface reconstruction method, which is based on the NURBS surface model fitting to the unstructured point cloud measured from an arbitrary complex shape. The concept of generating a simple triangular mesh model was introduced to generate a quadrilateral mesh model well-representing the topological characteristics of point cloud. The NURBS surface reconstruction processes required the use of the various methodologies such as QEM algorithm, merging scheme of pair-wise triangular mesh, creation algorithm of $G^1$ continuous tensor product NURBS surface patch, and so on. The effectiveness and reliability of the proposed NURBS surface reconstruction method were validated through the simulation results for the geometrically and topologically complex shapes.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.366-371
• /
• 2007

In many CAD systems, NURBS has been employed to construct exact geometries. Recently, NURBS finite element analysis methods were proposed by some authors for convenient connection between CAD and finite element analysis. Additional advantages of NURBS FEA, such as exact geometry and no mesh generation, are obtained. However, NURBS is inefficient in local refinement and merging patches. For refinement of local region in interest, additional control points should be inserted into the entire row or column which contains the local region. There is another inefficiency of NURBS during merging patches into a large structure due to propagation of control points. In order to overcome these inefficiencies of NURBS, T-spline was proposed by Sederberg. In this work, T-spline based finite element method is proposed for efficient local refinement and merging patches. At first, accuracy and efficiency of NURBS FEA is verified and efficiency of T-spline FEA is verified by comparing with NURBS FEA.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.179-187
• /
• 2017

The fourth industrial revolution is a phenomenon where productivity is improved in each field by the convergence of IT technology and existing industries. In the dental treatment process, prosthetic treatment time is drastically shortened through AI and expert software. Oral imaging, prosthesis design, and prosthesis manufacturing are performed continuously, so the treatment can be completed in a few hours. In this paper, we introduce the research trend of multimedia technology in the prosthetic process. We also propose a new method for accelerating the fusion of surface data during the optical impression. Proposed method enables high-speed optical impression and accelerates the overall automated production process of dental prosthesis.