• The Bulletin of The Korean Astronomical Society
• /
• v.40 no.1
• /
• pp.50.1-50.1
• /
• 2015

We present a new hydrodynamic simulation based on the unstructured moving mesh scheme. The simulation utilizes the Voronoi tessellation technique that produces polygonal cells composed of, on average, 13 surfaces each in 3D. We devise the incremental expanding method (IEM) and hybrid-neighbor searching algorithm and achieve the CPU time just proportional to the number of particles, i.e., O(N). We show the results of requisite tests for hydrodynamic simulations and demonstrate superiority of our code over the conventional codes using the stationary meshes. The applications in the context of cosmological and galactic simulations are also discussed.

• East Asian mathematical journal
• /
• v.34 no.5
• /
• pp.661-681
• /
• 2018

In this paper, we discuss a reduced-order modeling for the Benjamin-Bona-Mahony-Burgers (BBMB) equation and its application to a distributed feedback control problem through the centroidal Voronoi tessellation (CVT). Spatial distcritization to the BBMB equation is based on the finite element method (FEM) using B-spline functions. To determine the basis elements for the approximating subspaces, we elucidate the CVT approaches to reduced-order bases with snapshots. For the purpose of comparison, a brief review of the proper orthogonal decomposition (POD) is provided and some numerical experiments implemented including full-order approximation, CVT based model, and POD based model. In the end, we apply CVT reduced-order modeling technique to a feedback control problem for the BBMB equation.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.2
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.1-9
• /
• 2002

Recently as it is growing concern about NPR(Non-Photorealistic Rendering), Several computer graphics researchers are studying to simulate conventional artistic expressions such as pen-and-ink illustrations, watercolor and impressionism technique. In the NPR it is important thing that someone can produce a representation looked like work drawn or manipulated people directly. In this paper we propose that the technique could make the mosaic work automatically, tore and tagged a paper by hands used to educational and artistical representation, we suggest various methods to express a shape and texture of paper tore by hands without using cutters or scissors.