• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.669-679
• /
• 2011

In this paper, we propose a POCS based irregularly sampled image interpolation method exploiting non-local block-based wavelet shrinkage denoising algorithm. The method provides convex sets to improve the performance. The Delaunay triangulation interpolation is first applied to interpolate the missing pixels of the irregularly sampled image into the regular grids. Then, the non-local block-based wavelet shrinkage denoising algorithm is applied, and the originally observed pixels are enforced. After iteration is performed, the denoising algorithm for non-edge areas is applied to acquire the final result. The experimental results show that the proposed method outperforms the conventional methods.

• 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.

• Computational Structural Engineering
• /
• v.6 no.3
• /
• pp.99-112
• /
• 1993

One of the characteristics of Delaunay-Voronoii methods of mesh generation is local remeshing ability in comparison with other methods, which is very useful in adaptive finite element applications. Main part of the process is to construct remeshing element group out of the whole elements and to remesh it. Adjacent element array, accompanied with an additional algorithm of several lines, is introduced to make the process simple so that implementation of the concept is possible at the level of general PC users.

• Journal of Mechanical Science and Technology
• /
• v.18 no.12
• /
• pp.2190-2203
• /
• 2004

A combined procedure for two-dimensional Delaunay mesh generation algorithm and an adaptive remeshing technique with higher-order compressible flow solver is presented. A pseudo-code procedure is described for the adaptive remeshing technique. The flux-difference splitting scheme with a modified multidimensional dissipation for high-speed compressible flow analysis on unstructured meshes is proposed. The scheme eliminates nonphysical flow solutions such as the spurious bump of the carbuncle phenomenon observed from the bow shock of the flow over a blunt body and the oscillation in the odd-even grid perturbation in a straight duct for the Quirk's odd-even decoupling test. The proposed scheme is further extended to achieve higher-order spatial and temporal solution accuracy. The performance of the combined procedure is evaluated on unstructured triangular meshes by solving several steady-state and transient high-speed compressible flow problems.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.12
• /
• pp.21-27
• /
• 1998

This paper recommends the database construction for STL data and the new method of Delaunay's triangulation method in order to decrease volume errors by verifying STL file errors and modifying hole errors. Each vertex for the boundary coordinates of the verified hole errors was analyzed according to the following cases: planes or slow curves, edges, apexes, and rapid curves. In each case, a different modification process was adopted. With this method, most errors resulting from the conversion into the STL data as well as lots of volume errors arising from error modification were decreased.

• 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.

• Korean Journal of Remote Sensing
• /
• v.19 no.6
• /
• pp.457-464
• /
• 2003

Triangulated irregular network is one of the most frequently used terrain modeling methods. It represents terrain precisely using only a small amount of data, and enables fast rendering of terrain. In this paper, ridges and valleys are extracted from the terrain, and used as a set of vertices for the construction of triangulated irregular network. An experiment shows the new method reduces the time for construction of the triangulated irregular network significantly with almost equal amount of induced error.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1153-1156
• /
• 2002

In this parer, a high quality mesh generation method by using interval arithmetic is proposed. In the proposed method, the variance of a tangent vector at the point is considered by the automatic differentiation. From the variance, sampling points on the surface are judged whether it is adequate or not, which is calculated by the interval arithmetic. Then Delaunay triangulation is performed to the obtained sampling points, and a set of meshes is generated. The proposed method is hard to overlook the local variation of surfaces.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.651-654
• /
• 1997

Generally commercial FEA program needs computer circumstances such as specific operating system, hardware. But regardlessly to computer circumstances, program coded by JAVA can work only with webbrowser. 2 dimensional mesh generation and FE analysis using JAVA is presented in this paper.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.1
• /
• pp.35-44
• /
• 2009

This paper describes an application of domain decomposition method for parallel finite element analysis which is required to large scale 3D structural analysis. A parallel finite element method system which adopts a domain decomposition method is developed. 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 triangulation method is introduced as a basic tool for element generation. Domain decomposition method using automatic mesh generation system holds great benefits for 3D analyses. Aa parallel numerical algorithm for the finite element analyses, domain decomposition method was combined with an iterative solver, i.e. the conjugate gradient(CG) method where a whole analysis domain is fictitiously divided into a number of subdomains without overlapping. Practical performance of the present system are demonstrated through several examples.