• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.10
• /
• pp.917-923
• /
• 2015

In this paper, the TSE (Triangulation based target Size Estimator) algorithm is presented to estimate static target size at IIR (Imaging Infrared) environment. The size information is important factor for accurate IIR target tracking. But the IIR sensor can't generate distance between missile and target to calculate target size. In order to overcome the problem, we propose TSE algorithm which based on triangulation measurement. The performance of proposed method is tested at target intercept scenario. The experiment results show that the proposed algorithm has suitable performance for the accurate static target size estimating.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.435-440
• /
• 2009

The scalable vector graphics (SVG) standard has allowed the complex bitmap images to be represented by vector based graphics and provided some advantages over the raster based graphics in applications, for example, where scalability is required. This paper presents an algorithmto convert bitmap images into SVG format. The algorithm is an integration of pixel-level triangulation, data dependent triangulation, a new image mesh simplification algorithm, and a polygonization process. Both triangulation techniques enable the image quality (especially the edge features) to be preserved well in the reconstructed image and the simplification and polygonization procedures reduce the size of the SVG file. Experiments confirm the effectiveness of the proposed algorithm.

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

• 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 the Korean Society for Precision Engineering
• /
• v.22 no.4
• /
• pp.13-18
• /
• 2005

• Journal of Cadastre & Land InformatiX
• /
• v.45 no.2
• /
• pp.45-56
• /
• 2015

The main purpose of this investigation is to make up for the limitations of parcel addressing and to seek the application plan of cadastral triangulation point to effective installation of national index numbers. The test-bed has been constructed at the mountainous area located in Nowon-gu, seven cadastral triangulation points within the test-bed was directly applied to this investigation. Each points have been firstly converted from a plane rectangular coordinates to a single plane rectangular coordinates (UTM-K). To verify positioning results achieved from these points, a single plane rectangular coordinates through the Network-RTK was considered. With regards to verification result, maximum coordinate shift was revealed by 6 cm, this level of difference can be satisfied to Article 7, paragraph 2 "the regulation for National Index Number". This means that coordinate transformation applied with cadastral triangulation points can achieve the sastisfied result without local surveying. And also, remarkable effects have been created in terms of financial effectiveness and safe preservation of cadastral triangulation points due to the omission of local surveying.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.123-134
• /
• 2000

This paper addresses a new triangulation method for constructing surface model from a set of wire-frame contours. The most important problem of contour triangulation is the branching problem, and we provide a new solution for the double branching problem, which occurs frequently in real data. The multiple branching problem is treated as a set of double branchings and an algorithm based on contour merging is developed. Our double branching algorithm is based on partitioning of root contour by Toussiant's polygon triangulation algorithml[14]. Our double branching algorithm produces quite natural surface model even if the branch contours are very complicate in shape. We treat the multiple branching problem as a problem of coarse section sampling in z-direction, and provide a new multiple branching algorithm which iteratively merge a pair of branch contours using imaginary interpolating contours. Our method is a natural and systematic solution for the general branching problem of contour triangulation. The result shows that our method works well even though there are many complicated branches in the object.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.217-224
• /
• 2012

Location-Based Services(LBS) is a service that provide location information by using communication network or satellite signal. In order to provide LBS precisely and efficiently, we studied how we can reduce the error on location determination of objects such people and things. We focus on using the least square method and triangulation positioning method to improves the accuracy of the existing location determination method. Above two methods is useful if the distance between the AP and the tags can be find. Though there are a variety of ways to find the distance between the AP and tags, least squares and triangulation positioning method are wildely used. In this thesis, positioning method is composed of preprocessing and calculation of location coordinate and detail of methodology in each stage is explained. The distance between tag and AP is adjusted in the preprocessing stage then we utilize least square method and triangulation positioning method to calculate tag coordinate. In order to confirm the performance of suggested method, we developed the test program for location determination with Labview2010. According to test result, triangulation positioning method showed up loss error than least square method by 38% and also error reduction was obtained through adjustment process and filtering process. It is necessary to study how to reduce error by using additional filtering method and sensor addition in the future and also how to improve the accuracy of location determination at the boundary location between indoor and outdoor and mobile tag.

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

• Journal of Engineering Education Research
• /
• v.15 no.5
• /
• pp.93-97
• /
• 2012

Most of ubiquitous computing devices such as stereo camera, ultrasonic sensor based MIT cricket system and other wireless sensor network devices are widely applied to the 2 Dimensional(2D) localization system in today. Because stereo camera cannot estimate the optimal location between moving node and beacon node in Wireless Personal Area Network(WPAN) under Non Line Of Sight(NLOS) environment, it is a great weakness point to the design of the 2D localization system in indoor environment. But the conventional 2D triangulation scheme that is adapted to the MIT cricket system cannot estimate the 3 Dimensional(3D) coordinate values for estimation of the optimal location of the moving node generally. Therefore, the 3D triangulation scheme based on the space segmentation in WPAN is suggested in this paper. The measuring data in the suggested scheme by computer simulation is compared with that of the geographic measuring data in the AutoCAD software system. The average error of coordinates values(x,y,z) of the moving node is calculated to 0.008m by the suggested scheme. From the results, it can be seen that the location correctness of the suggested scheme is very excellent for using the localization system in WPAN.