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

Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and it includes some steps such as scanning of a clay or wood model, and generating some manufacturing data in an STL file. A new approach to remove point data with Delaunay triangulation is introduced to deal with the size problems of STL file and the difficulties in the operation of RP process. This approach can be used to reduce a number of measuring data from laser scanner within a specified tolerance, thus it can avoid the time for handing point data during modeling process and the time for verifying and slicing STL model during RP process. Developed software enables the user to specify the criteria for the selection of group of triangles either by the angle between triangles or the percentage of triangles reduced, and thus RP models with accuracy will be helpful to automated process.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1998.03a
• /
• pp.129-134
• /
• 1998

STL which is used in Rapid Prototyping is composed of a lot of triangular facets. The number of triangles and the shapes of these triangles determine the quality of STL. Therefore, proper algorithm is necessary to enhance the quality of triangular patch. In this paper we used the Delaunay triangulation method to apply to following processes. 1) On processing for reducing sharp triangles which cause errors on intersection. 2) On processing for connecting two or more collinear edges. 3) On processing for deleting unnecessarily inserted points in coplanar polygon.

• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• pp.108-114
• /
• 1999

In this paper. a new automatic multi=block grid generation technique for general 2D regions is introduced. According to this simple and robust method, the domain of interest is first triangulated by using Delaunay triangulation of boundary points, and then geometric information of those triangles is used to obtain block topology. Once block boundaries are obtained. structured grid for each block is generated such that grid lines have $C^0-continuity$ across inter-block boundaries. In the final step of the present method, an elliptic grid generation method is applied to smoothen grid distribution for each block and also to re-locale the inter-block boundaries, and eventually to achieve a globally smooth multi-block structured grid system with $C^1-continuity$.

• 한국전산유체공학회:학술대회논문집
• /
• 1996.05a
• /
• pp.111-117
• /
• 1996

The Delaunay triangulation technique was tested for complicated shapes of computational domain. While a simple geometry, both in topology and in geometry, was discretized well into triangular elements. a complex geometry often failed in triangularization. A complex geometry should be devided into smaller sub-domains whose shape is simple both topologically and geometrically. The present study developed the data structures not only for relationships among neibering elements but also for shape information, and coupled these into the Delaunay triangulation technique. This approach was able to enhance greatly the reliability of triangularization specially in complicated shapes of computational domains. The GUI (Graphic User Interface) and OOP (Object-Oriented Programming) were used in order to develop the user-friendly and efficient computer code.

• Structural Engineering and Mechanics
• /
• v.15 no.5
• /
• pp.563-578
• /
• 2003

Delaunay triangulation is combined with an adaptive finite element method for analysis of two-dimensional crack propagation problems. The content includes detailed descriptions of the proposed procedure which consists of the Delaunay triangulation algorithm and an adaptive remeshing technique. The adaptive remeshing technique generates small elements around the crack tips and large elements in the other regions. Three examples for predicting the stress intensity factors of a center cracked plate, a compact tension specimen, a single edge cracked plate under mixed-mode loading, and an example for simulating crack growth behavior in a single edge cracked plate with holes, are used to evaluate the effectiveness of the procedure. These examples demonstrate that the proposed procedure can improve solution accuracy as well as reduce total number of unknowns and computational time.

• Journal of the Korean Society of Costume
• /
• v.55 no.2 s.92
• /
• pp.18-32
• /
• 2005

The purpose of this study is to find out the origin of perpetuity in the fashion design of Soma Delaunay, who was recognized as a unique designer in the 20th century. Her characteristics of fashion design appeared as dynamism in the incline of op-art using geometric pattern designed on the basis of abstract painting, color contrast between strong original colors, and repeated geometric patterns. The modern image can be explained as modernity in modern fashion and is continued in these days. The origins of modernity analyzed as follows. First, Soma Delaunay developed textile design, considering the use of clothing on the basis of scientific idea. Furthermore, she evolved traditional textile design and making process into a practical and rational way through developing new needlework technique. Second, she tried a new style through a straight silhouette in contrast to Art Nouveau style and the test and mixture of different genres. Third, she expressed the simultaneity of Orphism through the parallel structure of various colors. In particular, she used the contrast of strong and clear original colors to express a rhythm of dynamism and give visual interest through color. Finally, Soma Delaunay attempted to approach the public using clothing, furniture, and curtains with the focus on textiles. It may represent her intention to remove a gap between art and life by understanding the public and their life. As examined above, it can be sad that Soma Delaunay's scientific idea with the flow of industrialization, an open attitude not bound by a rule as an artist, an idea of Avant-garde, the comprehension of various colors and the understanding of the public. These factors lie at the bottom of her fashion design.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.5
• /
• pp.803-812
• /
• 2002

Reverse engineering has been widely used for the shape reconstruction of an object without CAD data and the measurement of clay or wood models for the development of new products. To generate a surface from measured points by a laser scanner, typical steps include the scanning of a clay or wood model and the generation of manufacturing data like STL file. A laser scanner has a great potential to get geometrical data of a model for its fast measuring speed and higher precision. The data from a laser scanner are composed of many line stripes of points. A new approach to remove point data with Delaunay triangulation is introduced to deal with problems during reverse engineering process. The selection of group of triangles to be triangulated based on the angle between triangles is used for robust and reliable implementation of Delaunay triangulation as preliminary steps. Developed software enables the user to specify the criteria for the selection of group of triangles either by the angle between triangles or the percentage of triangles reduced. The time and error for handling point data during modelling process can be reduced and thus RP models with accuracy will be helpful to automated process.

• Journal of Biomedical Engineering Research
• /
• v.21 no.3 s.61
• /
• pp.225-231
• /
• 2000

The Delaunay triangulation. which is one of the surface rendering methods. have been evaluated as a good algorithm which can solve the geometrical connection problems and make high quality images. However this method also have the problem that is the 'non-solid' connection between slices. In this paper, we proposed a new method for the Delaunay triangulation for the surface rendering from 2D medical images in the PC environment. The proposed method was designed to eliminate 'non-solid' tetrahedra. which had no correspondence to the geometric closeness, and used elimination algorithm with modified External Voronoi Skeleton path. This method enabled us to eliminate 'non-solid' tetrahedra without affecting other regions. Thus we could effectively reconstruct the complex shaped objects which were compactly connected with tetrahedra.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.5
• /
• pp.681-687
• /
• 2003

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1894-1905
• /
• 1996

Delauuany triangulation which is the dual of Dirichlet tessellation is not affine invariant. In other words, the triangulation is dependent upon the choice of the coordinate axes used to represent the vertices. In the same reason, Delahanty tetrahedrization does not have an affine iveariant transformation property. In this paper, we present a new type of tetrahedrization of spacial points sets which is unaffected by translations, scalings, shearings and rotations. An affine invariant tetrahedrization is discussed as a means of affine invariant 2 -D triangulation extended to three-dimensional tetrahedrization. A new associate norm between two points in 3-D space is defined. The visualization of the structure of tetrahedrization can discriminate between Delaunay tetrahedrization and affine invariant tetrahedrization.