• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.239-246
• /
• 2004

Image snapping for an image moves the cursor location to nearby features in the image, such as edges. In this paper, we propose geometric snapping for 3D triangular meshes, which is extended from image snapping. Similar to image snapping, geometric snapping also moves the cursor location naturally to a location which represents main geometric features in the 3D triangular meshes. Movement of cursor is based on the approximate curvatures which appear geometric features on the 3D triangular meshes. The proposed geometric snapping can be applied to extract main geometric features on 3D triangular meshes. Moreover, it can be applied to extract the geometric features of a tooth which are necessary for generating the occlusal surfaces in dental prostheses.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.759-760
• /
• 2008

In this paper, We propose the feature-based 3D model Retrieval System. 3D models are represented as triangle meshes. A first simple feature vector can be calculated from hull. After looking for meshes intersected with the hull, we compute the curvature of meshes. These curvature are used as the model descriptor.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.4
• /
• pp.173-180
• /
• 2004

The tread pattern of a tire has an important effect on tire performances such as handling, wear, noise, hydroplaning and so on. However, a finite element analysis of a patterned tire with detailed tread blocks has been limited owing to the complexity of making meshes for tread blocks and the huge computation time. The computation time has been shortened due to the advance in the computer technology. The modeling of tread blocks usually requires creating a solid model using a CAD software. Therefore it is a very complicated and time-consuming job to generate meshes of a patterned tire using a CAD model. A new efficient and convenient method for generating meshes of a patterned tire has been developed. In this method, 3-D meshes of tread pattern are created by mapping 2-D meshes of tread geometry onto 3-D tread surfaces and extruding them through tread depth. Then, the tread pattern meshes are assembled with the tire body meshes by the tie contact constraint. Residual aligning torque and frictional energy are calculated by using a patterned tire model and compared to the experimental results. It is shown that the calculated results of a patterned tire model are in a good agreement with the experimental ones.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.894-899
• /
• 2000

An automatic mesh generation system with unstructured quadrilateral elements on trimmed NURBS surfaces has been developed.. In this paper, NURBS surface geometries in the IGES format have been used to represent model shape. NURBS surface is represented as parametric surface. So each surface could be mapped to a 2D parametric plane through the parametric domain. And then meshes with quadrilateral elements are constructed in this plane. Finally, the constructed meshes are mapped back to the original 3D surface through the parametric domain. In this paper, projection plane, quasi-expanded plane and parametric Plane are used as 2D mesh generation plane. For mapping 3D surface to parametric domain, Newton-Rhapson Method is employed. For unstructured mesh generation with quadrilateral elements on 2D plane, a domain decomposition algorithm using loop operators has been employed. Sample meshes are represented to demonstrate the effectiveness of the proposed algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.3
• /
• pp.184-192
• /
• 2001

In this paper we present a remeshing algorithm for irregular meshes with boundaries. The irregular meshes are approximated by regular meshes where the topological regularity is essential for the multiresolutional analysis of the given meshes. Normal meshes are utilized to reduce the necessary data size at each resolution level of the regularized meshes. The normal mesh uses one scalar value, i.e., normal offset value which is based on the regular rule of a uniform subdivision, while other remeshing schemes use one 3D vector at each vertex. Since the normal offset cannot be properly used for the boundaries of meshes, we use a combined subdivision scheme which resolves a problem of the proposed normal offset method at the boundaries. Finally, we show an example to see the effectiveness of the proposed scheme to reduce the data size of a mesh model.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.9
• /
• pp.921-927
• /
• 1990

This paper presents a mesh refinement scheme for 3-D adaptive finite element method. Firstly, the refinement of triangular meshes based on the bisection of triangles is discussed. And a new method to refine tetrahedral meshes employing the bisection method is presented. In two dimensional cases, it has been noted that all angles in the triangular meshes refined by the bisection method are greater than or equal to half the smallest angle in the original meshes. Through the examples where the newly proposed method is applied to three dimensional cases, it is shown that regarding the solid angles, the method gives nearly the same result as that in the two dimensional case. Accordingly, it can be concluded that the proposed method will be useful in the mesh refinements for 3-D adaptive finite element method.

• Journal of the Korea Computer Graphics Society
• /
• v.19 no.1
• /
• pp.11-20
• /
• 2013

This paper introduces a user interface for large 3D meshes in mobile systems, which have limited memory, screen size and battery power. A large 3D mesh is divided into partitions and simplified in multi-resolutions so a large file is transformed into a number of small data files and saved in a PC server. Only selected small files specified by the user are hierarchically transmitted to the mobile system for 3D browsing and rendering. A 3D preview in a pop-up shows a simplified mesh in the lowest resolution. The next step displays simplified meshes whose resolutions are automatically controlled by the user interactions. The last step is to render a set of detailed original partitions in a selected range. As a result, while minimizing using mobile system resources, our interface enables us to browse and display 3D meshes in mobile systems through real-time interactions. A mobile 3D viewer and a 3D app are also presented to show the utility of the proposed user interface.

• The Journal of the Korea Contents Association
• /
• v.8 no.7
• /
• pp.85-92
• /
• 2008

Meshes are the most appropriate data structures for representing 3D geometries. Surface meshes have been frequently used for representing 3D geometries, which only samples data on the surfaces of the given 3D geometries. Thanks to the improvements of computing powers, it is required to develop more complicated contents which utilize the volumetric information of 3D geometries. In this paper, we introduce a novel volumetric mesh libraries based on the half-face data structure, called OpenVolMesh, and describe its designs and implementations. The OpenVolMesh extends the OpenMesh, which is one of the most famous mesh libraries, by supporting volumetric meshes. The OpenVolMesh provides the generic programming, dynamic allocations of primitive properties, efficient array-based data structures, and source-level compatibility with OpenMesh. We show the usefulness of the OpenVolMesh in the developments of 3D volumetric contents with prototypic implementations such as volumetric mesh smoothing and CW-cell decompositions.

• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.13-22
• /
• 2005

Similarly to the edges defined in a 2D image, we can define the geometric features representing the boundary of the distinctive parts appearing on 3D meshes. The geometric features have been used as basic primitives in several applications such as mesh simplification, mesh deformation, and mesh editing. In this paper, we propose geometric livewire and geometric livelane for extracting geometric features in a 3D mesh, which are the extentions of livewire and livelane methods in images. In these methods, approximate curvatures are adopted to represent the geometric features in a 3D mesh and the 3D mesh itself is represented as a weighted directed graph in which cost functions are defined for the weights of edges. Using a well-known shortest path finding algorithm in the weighted directed graph, we extracted geometric features in the 3D mesh among points selected by a user. In this paper, we also visualize the results obtained from applying the techniques to extracting geometric features in the general meshes modeled after human faces, cows, shoes, and single teeth.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.41-44
• /
• 2001

In reverse engineering, the whole surfaces of the three-dimensional(3D) product are measured using 3D positional scanners. The raw triangle meshes constructed from a scanned point set are not well suited for direct use in the downstream activities. This is because the amount of triangle meshes may be very large(from millions to hundreds of millions) and usually distorted by scanning error. Furthermore, the triangle meshes may contain several holes that must be filled. Thus, several solutions have to be addressed and implemented before a complete CAD models can be acquired. This paper discusses on the algorithms of decimation, smoothing, and hole-filling that are crucial to refine the triangle meshes. Several examples are also given and discussed to validate the system.