• Korean Journal of Computational Design and Engineering
• /
• v.12 no.6
• /
• pp.413-421
• /
• 2007

3D rendering is becoming a common feature of mobile application programs with the rapid advance of mobile devices. Since the existing rendering engines do not provide triangulation functions, mobile 3D programs have focused on an efficient handling with pre-tessellated geometry. In addition, triangulation is comparatively expensive in computation, so it seems that the triangulation cannot be easily implemented on mobile devices with limited resources. Triangulation of 3D geometry is the essential process of visualization of 3D model data and many different triangulation methods have been reported. We developed a light and fast visualization process that involves constrained triangulation based on Voronoi diagram and applied it to a mobile computer application. In this paper, we applied kd-tree to the original incremental construction algorithm and produced new O(nlogn) incremental construction algorithm. And we show a simple and efficient constrained triangulation method based on Voronoi diagram. This paper also describes an implementation of mobile STEP data viewer as an application of our proposed algorithms.

• Journal of computational fluids engineering
• /
• v.2 no.2
• /
• pp.97-103
• /
• 1997

A modified Delaunay triangulation technique is tested for complicated computational domain. While a simple geometry. both in topology and geometry, has been well discretized into triangular elements, a complex geometry having difficulty in triangulation had to be divided into small sub-domains of simpler shape. The present study presents a modified Delaunay triangulation method based on the data structure of geometric modeller. This approach greatly enhances the reliability of triangulation, especially in complicated computational domain. We have shown that efficiency of Delaunay triangulation can be much improved by using both the GUI (Graphic User Interface) and OOP (Object-Oriented Programming).

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.400-406
• /
• 2002

Recently, the enormous increase in the volume of remotely sensed data is being acquired by an ever-growing number of earth observation satellites. The combining of diversely sourced imagery together is an important requirement in many applications such as data fusion, city modeling and object recognition. Aerial triangulation is a procedure to reconstruct object space from imagery. However, since the different kinds of imagery have their own sensor model, characteristics, and resolution, the previous approach in aerial triangulation (or georeferencing) is performed on a sensor model separately. This study evaluated the advantages of aerial triangulation of large number of images from multi-sensors simultaneously. The incorporated multi-sensors are frame, push broom, and whisky broom cameras. The limits and problems of push-broom or whisky broom sensor models can be compensated by combined triangulation with frame imagery and vise versa. The reconstructed object space from multi-sensor triangulation is more accurate than that from a single model. Experiments conducted in this study show the more accurately reconstructed object space from multi-sensor triangulation.

• Korean Journal of Remote Sensing
• /
• v.19 no.3
• /
• pp.255-261
• /
• 2003

Recently, the enormous increase in the volume of remotely sensed data is being acquired by an ever-growing number of earth observation satellites. The combining of diversely sourced imagery together is an important requirement in many applications such as data fusion, city modeling and object recognition. Aerial triangulation is a procedure to reconstruct object space from imagery. However, since the different kinds of imagery have their own sensor model, characteristics, and resolution, the previous approach in aerial triangulation (or georeferencing) is purformed on a sensor model separately. This study evaluated the advantages of aerial triangulation of large number of images from multi-sensors simultaneously. The incorporated multi-sensors are frame, push broom, and whisky broom cameras. The limits and problems of push-broom or whisky broom sensor models can be compensated by combined triangulation with other sensors The reconstructed object space from multi-sensor triangulation is more accurate than that from a single model. Experiments conducted in this study show the more accurately reconstructed object space from multi-sensor triangulation.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.411-420
• /
• 2007

The steady evolution of mapping technology is leading to an increasing availability of multi-sensory geo-spatial datasets, such as data acquired by single-head frame cameras, multi-head frame cameras, line cameras, and light detection and ranging systems, at a reasonable cost. The complementary nature of the data collected by these systems makes their integration to obtain a complete description of the object space. However, such integration is only possible after accurate co-registration of the collected data to a common reference frame. The registration can be carried out reliably through a triangulation procedure which considers the characteristics of the involved data. This paper introduces algorithms for a multi-primitive and multi-sensory triangulation environment, which is geared towards taking advantage of the complementary characteristics of spatial data available from the above mentioned sensors. The triangulation procedure ensures the alignment of involved data to a common reference frame. The devised methodologies are tested and proven efficient through experiments using real multi-sensory data.

• Communications for Statistical Applications and Methods
• /
• v.31 no.5
• /
• pp.557-569
• /
• 2024

Based on the investigation of logistic regression models utilizing sparse triangulation within a compact domain in ℝ², this study addresses the limited research extending the triogram model to logistic regression. A primary challenge arises from the potential instability induced by a large number of vertices, hindering the effective modeling of complex relationships. To mitigate this challenge, we propose introducing sparsity to boundary vertices of the triangulation based on the Ramer-Douglas-Peucker algorithm and employing the K-means algorithm for adaptive vertex initialization. A second order coordinate-wise descent algorithm is adopted to implement the proposed method. Validation of the proposed algorithm's stability and performance assessment are conducted using synthetic and handwritten digit data (LeCun et al., 1989). Results demonstrate the advantages of our method over existing methodologies, particularly when dealing with non-rectangular data domains.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.4
• /
• pp.217-224
• /
• 2009

Most divide-and-conquer implementations for Delaunay triangulation utilize quad-edge or winged-edge data structure since triangles are frequently deleted and created during the merge process. How-ever, the proposed divide-and-conquer algorithm utilizes the array based data structure that is much simpler than the quad-edge data structure and requires less memory allocation. The proposed algorithm has two important features. Firstly, the information of space partitioning is represented as a permutation vector sequence in a vertices array, thus no additional data is required for the space partitioning. The permutation vector represents adaptively divided regions in two dimensions. The two-dimensional partitioning of the space is more efficient than one-dimensional partitioning in the merge process. Secondly, there is no deletion of edge in merge process and thus no bookkeeping of complex intermediate state for topology change is necessary. The algorithm is described in a compact manner with the proposed data structures and operators so that it can be easily implemented with computational efficiency.

• 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 Precision Engineering Conference
• /
• 2000.11a
• /
• pp.47-50
• /
• 2000

Optical triangulation is one of the most common methods for acquiring range data. Using this method. We have developed a new type of Laser Displacement Sensor. We used Area CCD instead of linear CCD and PSD (Position Sensitive Detector). And we have developed the robust algorithm for increasing the accuracy and used USB instead of RS-232C for increasing speed. We present results that demonstrate the validity of our method using optical triangulation technique, Area CCD, and USB.

• Journal of Information Technology Services
• /
• v.11 no.sup
• /
• pp.103-111
• /
• 2012

In epigraph field to study ancient scripts, alternative readability improvement technologies have been developed to replace existing rubbing method which has low resolution and causes surface pollution of heritages from the viewpoints of extraction process and used materials. Recently many methods which are based on analysis of pixel data for extracting outlines of the specific image have been developed with advancement of image processing techniques. But these methods are not applicable and the results are not satisfied in the damaged inscriptions which are weathered by wind and rain for a long time and in the narrowed one. In this paper laser scanning techniques which uses optical triangulation measurement principle are developed to minimize scanning error. The proposed techniques are consisted of 3 parts：(1) the understanding of optical triangulation measurement principle to find scanning guideline (2) determinations of points interval, scanning distance and scanning angle to guarantee scanning data quality (3) identification of valid point data area which will be used in registration process. The proposed character identification method contributed in decoding an ancient inscription on SeukBingGo in Kyungju.