• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.255-260
• /
• 2002

This paper describes a fuzzy-based system for analyzing the stress intensity factors (SIFs) of three-dimensional (3D) cracks. A geometry model, i.e. a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model by using the fuzzy knowledge processing. Nodes are generated by the bucketing method, and ten-coded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. The singular elements such that the mid-point nodes near crack front are shifted at the quarter-points, and these are automatically placed along the 3D crack front. The complete finite element(FE) model is generated, and a stress analysis is performed. The SIFs are calculated using the displacement extrapolation method. To demonstrate practical performances of the present system, semi-elliptical surface cracks in a inhomogeneous plate subjected to uniform tension are solved.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.1
• /
• pp.65-75
• /
• 1996

This paper describes an automatic finite element(FE) mesh generation for three-dimensional structures consisting of free-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, i.e. analysis model, (b) generation of nodes, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid and shell structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Delaunay method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional solid and shell structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.2
• /
• pp.11-20
• /
• 1996

The numerous application of scattered data include the modeling and visualization of physical phenomena. A tetrahedrization is one of pre-processing steps for 4-D surface interpolation. In this paper, various tetrahedrization methods are discussed including, Delaunay, least squares fitting, gradient difference, and jump in normal direction derivatives. This paper discriminates the characteristics of tetrahedrization through visualizing tetrahedral domain. This paper also, provides the tool that can compare and analyze the quality of 4-D space approximation over tetrahedral domain numerically, as well as graphically.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.7
• /
• pp.74-79
• /
• 2000

Integrating a 3D solid modeler with a general purpose FEM code, an automatic nonlinear analysis system of the 3D crack problems has been developed. A geometry model, i.e. a solid containing one or several 3D cracks is defined. Several distributions of local node density are chosen, and then automatically superposed on one another over the geometry model by using the fuzzy knowledge processing. Nodes are generated by the bucketing method, and ten-noded quadratic tetrahedral solid elements are generated by the Delaunay triangulation techniques. The complete finite element(FE) model generated, and a stress analysis is performed. In this system, burden to analysts fur introducing 3D cracks to the FE model as well as fur estimating their fracture mechanics parameters can be dramatically reduced. This paper describes the methodologies to realize such functions, and demonstrates the validity of the present system.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2002.11a
• /
• pp.163-170
• /
• 2002

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 for realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in 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. In order to accelerate the searching speed of T-search, a terrain database of triangular polygons is modeled in multi-levels by adopting the LOD (Level of Detail) method used in realtime computer graphics. Simulation results show that the new LOD search is effective in shortening the required computing time. The LOD search can be even further accelerated by introducing an NN (Neural Network) algorithm, in the cases where a appropriate range of moving paths can be predicted by cultual information of the simulated terrain, such as lakes, houses, etc.. Numerical tests show that LOD-NN search almost double the speed of the original T-search.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.8 no.2
• /
• pp.1-8
• /
• 1990

A regular grid or a triangulated irregular network is generally used as the data structure of digital terrain models. A Regular grid is simple and easy to manipulate, but it can't describe well terrain surface features and requires vast volumes of data. In the meantime, a triangulated irregular network has complex data structure, but it can describe well terrain surface features and can achieve the accuracy suitable to its application with relatively little data. This paper aims at the construction of efficient digital terrain models by the improvment of a triangulated irregular network based on Delaunay triangulation. Regular and irregular data set are sampled from existing contour maps, and the efficiency and the accuracy of the two data structures are compared.

• Korean Journal of Remote Sensing
• /
• v.22 no.1
• /
• pp.49-61
• /
• 2006

The lifting scheme has been found to be a flexible method for constructing scalar wavelets with desirable properties. In this paper, it is extended to the UDAR data compression. A newly developed data compression approach to approximate the UDAR surface with a series of non-overlapping triangles has been presented. Generally a Triangulated Irregular Networks (TIN) are the most common form of digital surface model that consists of elevation values with x, y coordinates that make up triangles. But over the years the TIN data representation has become an important research topic for many researchers due its large data size. Compression of TIN is needed for efficient management of large data and good surface visualization. This approach covers following steps: First, by using a Delaunay triangulation, an efficient algorithm is developed to generate TIN, which forms the terrain from an arbitrary set of data. A new interpolation wavelet filter for TIN has been applied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to 'modify' the point values (point coordinates for geometry) after the splitting. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the original UDAR data. The results show that this method can be used for significant reduction of data set.

• Transactions of Materials Processing
• /
• v.9 no.2
• /
• pp.140-151
• /
• 2000

The finite element mesh approach for tool surface description is applied effectively to analyze sheet metal stamping processes. To improve the mesh quality and the stability of the mesh generation process, a gybrid method based on the grid approach and the Delaunay triangulation is proposed in the present work. In the present study, a general method for the mathematical description of arbitrarily shaped tool surface is proposed by introducing the parametric surface approach. A polynomial function employed to describe the base parametric surface and the boundary curves are defined to describe arbitrary three-dimensional trimmed surfaces. To verify the validity of the proposed method, automatic mesh generation is carried out for some shosen complicated parts including actual automotive panel.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.768-776
• /
• 2006

Given an unstructured point set, we use an MLS (melting least-squares) approximation to estimate the local curvatures and their derivatives at a point by means of an approximation surface Then, we compute neighbor information using a Delaunay tessellation. feature points can then be detected as zero-crossings, and connected using curvature directions. Also this approach has a fast computation time than previous methods, which based on triangle meshes. We demonstrate our method on several large point-sampled models, rendered by point-splatting, on which the feature lines are rendered with line width determined from curvatures.

• Proceedings of the KSME Conference
• /
• 2000.11a
• /
• pp.705-711
• /
• 2000

This paper presents a fast 3D mesh generation method using a surface based method with a stitching algorithm. This method uses the surface based method since the volume based method that uses 3D Delaunay triangulation can hardly deal with a large scale of scanned points. To reduce the processing time, this method also uses a stitching algorithm: after dividing the whole point data into several sections and performing mesh generation on individual sections, the meshes from several sections are stitched into one mesh. Stitching method prevents the surface based method from increasing the processing time exponentially as the number of the points increases. This method works well with different types of scanned points: a scattered type points from a conventional 3D scanner and a cross-sectional type from CT or MRI.