• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.12
• /
• pp.1132-1137
• /
• 2013

In swarm robot systems, it is vital to maintain network connectivity to ensure cooperative behavior between robots. This paper deals with the behavior control algorithm of the swarm robots for maintaining network connectivity. To do this, we divide swarm robots into search-robots, base-robots, and relay-robots. Using these robots, we propose behavior control algorithm to maintain network connectivity. The behavior control algorithms to maintain network connectivity are proposed for the local path planning using virtual force and global path planning using the Delaunay triangulation, respectively. Finally, we demonstrate the effectiveness and applicability of the proposed method through some simulations.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3177-3195
• /
• 2014

In many moving object detection problems of an aerial video, accurate and robust stabilization is of critical importance. In this paper, a novel accurate image alignment algorithm for aerial electronic image stabilization (EIS) is described. The feature points are first selected using optimal derivative filters based Harris detector, which can improve differentiation accuracy and obtain the precise coordinates of feature points. Then we choose the Delaunay Triangulation edges to find the matching pairs between feature points in overlapping images. The most "useful" matching points that belong to the background are used to find the global transformation parameters using the projective invariant. Finally, intentional motion of the camera is accumulated for correction by Sage-Husa adaptive filtering. Experiment results illustrate that the proposed algorithm is applied to the aerial captured video sequences with various dynamic scenes for performance demonstrations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.605-607
• /
• 2021

본 논문에서는 지형 API를 활용해 사용자와 병원들의 위치를 들로네 삼각화로 그래프를 구성하고, 교통정보를 기반으로 사용자에게 최적의 경로를 알려주는 새로운 길 찾기 알고리즘을 제안한다. 경로를 분석하는 과정에서 교통정보를 활용하여 최단 시간이 걸리는 구간을 알려주어 전체적인 처리 시간을 최소화한다. 또한, 본 논문에서는 교통정보와 지형 API를 기반으로 들로네 삼각화를 구성하고, 구성된 간선을 기반으로 최적화 문제를 풀어냄으로써, 사용자에게 최적의 경로를 알려준다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.721-724
• /
• 2000

This paper presents fingerprint authentication method based on minutiae quadrangle definded by neighboring two Delaunay triangles. In this method, we first make minutiae triangle through Delaunay triangulation which adaptively connect neighboring minutiae according to the local minutiae density distribution, and then use feature vectors in authentication which is extracted from the minutiae quadrangle formed by neighboring two minutiae triangles. This prevents the degradation of matching ratio caused by the errors in image processing or local deformation of the fingerprint, and we can authenticate more discriminately as this method reflects wider local area's topological features than the features extracted from the individual minutiae triangles. To evaluate the proposed algorithm's performance, experiment are conducted on 120 fingerprints, of which size is 256 ${\times}$ 364 with 500dpi resolution. Robust authentications are possible with low FRR.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.69-70
• /
• 2007

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.62-68
• /
• 2002

This paper presents a method for tessellating trimmed NURBS surface with preserving sharp shape Although several existing approaches need a large number of triangular meshes to represent sharp shape of surface, resulting triangular meshes may not reflect sharp edges properly. In this study, we flit detect the sharp shape of NURBS surface automatically using C1 continuous condition and then use constraint Delaunay triangulation method to present exact sharp shape with the minimum triangular meshes. And we also use approximated developed surface domain as triangulation domain of rimmed NURBS surface. In this way, the shape of triangular elements on the triangular domains is approximately preserved and can avoid distortion when mapped into three-dimensional space. finally, we show examples that demonstrate the effectiveness of the proposed scheme in terms of reducing the number of triangular meshes and preserving sharp shape of surface more exactly.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.57-64
• /
• 2014

As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.32 no.2
• /
• pp.87-93
• /
• 2014

Cadastral parcel objects as polygons are fundamental dataset which represent land administration and management of the real world. Thus it is necessary to assure topological seamlessness of cadastral datasets which means no overlaps or gaps between adjacent parcels. However, the problem of overlaps or gaps are frequently found due to non-coinciding edges between adjacent parcels. These erroneous edges are called uncertain edges, and polygons containing at least one uncertain edge are called uncertain polygons. In this paper, we proposed a new algorithm to efficiently search parcels of uncertain polygons between two adjacent cadastral datasets. The algorithm first selects points and polylines around adjacent datasets. Then the Constrained Delaunay Triangulation (CDT) is applied to extract triangles. These triangles are tagged by the number of the original cadastral datasets which intersected with the triangles. If the tagging value is zero, the area of triangles mean gaps, meanwhile, the value is two, the area means overlaps. Merging these triangles with the same tagging values according to adjacency analysis, uncertain edges and uncertain polygons could be found. We have performed experimental application of this automated derivation of partitioned boundary from a real land-cadastral dataset.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.11
• /
• pp.81-90
• /
• 2014

For necessary information sharing or operation control via wire-wireless/mobile network connecting of devices at disaster area in greatest need of attention, an emergency network efficient construction method quickly connecting nodes within specific range using Delaunay triangulation is proposed. The emergency network constructed by proposed method shows the same aggregate network length, but does more excellent performance in term of network construction time the more long max length connectable to adjacent node as compared with the network by naive method. In experiment of 1000 input terminal nodes, 5 max length connectable to adjacent node, our proposed method enhances 89.1% in execution time without network length increase compared to naive method. So our method can go well to many useful applications as shift construction of communication network of adjacent devices, internet of things and efficient routing in the sensor network in continuous improvement of communication capability.