• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.405-409
• /
• 1997

Voronoi diagrams are applied in varios field such as NC toolpath generation, VLSI design and robot path planning because of their geometric charcteristics. In this paper, Voronoi diagrams are introduced on polygon constructed by line segments only and with constant offset. Bisector curves for two arbitrary objects, which is the combination of line segment and arc, are defined as parametric fuction where the parameter is used as offset. Offset curves are applied on the generation of laser scanning path for the stereolithography and shows a good result from several examples.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.604-606
• /
• 2005

컴퓨터 게임에서 움직이는 캐릭터를 위한 자연스러운 경로의 계획은 게임의 현실감을 측정하는 중요한 척도이다. Voronoi 다이어그램은 컴퓨터 기하학 분야에서 잘 알려진 로봇 경로계획 알고리즘 중 하나이다. Voronoi 다이어그램은 두 장애물로부터 같은 거리에 있는 선분과 점들로 구성되어 생성된 경로가 장애물로부터 멀리 떨어진 안전한 길이고 사람이 실제로 택하는 경로와 유사하다는 것이 장점이다. 본 논문에서는 셀-기반 게임 환경에서 움직이는 캐릭터의 이동경로를 찾기 위해 Voronoi 다이어그램을 적용하는 방법을 제안하고 구현한다. 제안된 방식과 기존에 많이 사용되던 그리드 기반 A* 알고리즘의 적용 결과를 비교 분석한다.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.684-694
• /
• 2019

Information spread in networks is universal in many real-world phenomena such as propagation of infectious diseases, diffusion of a new technology, computer virus/spam infection in the internet, and tweeting and retweeting of popular topics. The problem of finding the information source is to pick out the true source if information spread. It is of practical importance because harmful diffusion can be mitigated or even blocked e.g., by vaccinating human or installing security updates. This problem has been much studied, where it has been shown that the detection probability cannot be beyond 31% even for regular trees if the number of infected nodes is sufficiently large. In this paper, we study the impact of an anti-information spreading on the original information source detection. We consider an active defender in the network who spreads the anti-information against to the original information simultaneously and propose an inverse Voronoi partition based inference approach, called Voronoi Inference to find the source. We perform various simulations for the proposed method and obtain the detection probability that outperforms to the existing prior work.

• Journal of Ocean Engineering and Technology
• /
• v.38 no.3
• /
• pp.115-123
• /
• 2024

USBL systems are essential for providing accurate positions of autonomous underwater vehicles (AUVs). On the other hand, the accuracy can be degraded by outliers because of the environmental conditions. A failure to address these outliers can significantly impact the reliability of underwater localization and navigation systems. This paper proposes a novel outlier rejection algorithm for AUV localization using Voronoi diagrams and query point calculation. The Voronoi diagram divides data space into Voronoi cells that center on ultra-short baseline (USBL) data, and the calculated query point determines if the corresponding USBL data is an inlier. This study conducted experiments acquiring GPS and USBL data simultaneously and optimized the algorithm empirically based on the acquired data. In addition, the proposed method was applied to a sensor fusion algorithm to verify its effectiveness, resulting in improved pose estimations. The proposed method can be applied to various sensor fusion algorithms as a preprocess and could be used for outlier rejection for other 2D-based location sensors.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.2
• /
• pp.127-133
• /
• 2014

This paper proposes a determination method of waypoints to maximize the survivability of a UAV. Voronoi diagram which is used for the initial selection of waypoint candidates is the most widely used path planning technique to avoid the threat as far as possible when the location and strength of the threat are given. But if threat strength is different each other and flight path is constrained along with straight lines, Voronoi diagram has limitations in real applications. In this study, the initial waypoints obtained from Voronoi diagram are optimized considering the shape of each threat. Here, a waypoint is optimized while adjacent waypoints are fixed. By repeating this localized optimization until whole waypoints are converged, computation time for finding the best waypoints is greatly reduced.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1178-1188
• /
• 2003

In this paper, we describe image mosaicing techniques for constructing a large high-resolution image with images taken by a video camera in hand. we propose the method which is automatically retrieving the exact matching area using color information and shape information. The proposed method extracts first candidate areas which have similar form using a Voronoi Distance Matching Method which is rapidly estimating the correspondent points between adjacent images, and calculating initial transformations of them and finds the final matching area using color information. It is a method that creates Voronoi Surface which set the distance value among feature points and other points on the basis of each feature point of a image, and extracts the correspondent points which minimize Voronoi Distance in matching area between an input image and a basic image using the binary search method. Using the Levenberg-Marquadt method we turn an initial transformation matrix to an optimal transformation matrix, and using this matrix combine a basic image with a input image.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.

• Spatial Information Research
• /
• v.10 no.3
• /
• pp.439-453
• /
• 2002

Researches using DEM are actively progressed in field of water resource, and especially the extraction of watershed and stream based on topographic and hydrologic analysis, is widely used in GIS analysis recently. However, because it is extracted that watershed which is type of sliver polygon and stream which is type of straight line in low topographic region, they're not efficient for application. This study determined buffer zone from stream and tried smooth elevation change to buffer zone in order to efficiently extract abnormal watershed and stream being occurred in low topographic region. Especially, we applied equal-distance assignment model using Voronoi Diagram to determine smooth elevation change. Also, we extracted watershed and stream using stream recognition DEM and origional DEM, and evaluated the efficiency of research through comparing the shape of watershed and stream in low topographic region.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.866-870
• /
• 1995

To make a mobile robot to get to a goal point, path which connects the mobile robot and the goal point is needed and a path planning is necessary. There are various kinds of a path planning. Well known methods are skeleton method, cell decomposition method and potential field method. But each method has both fortes and defects. In this paper, we propose a new method of path planning to find a path for mobile robot. It is obtained by modifying a Voronoi diagram. An original Voronoi diagram can make a safe path but its result is not satisfied. First defect of path, finded by the original Voronoi diagram, is sulplus of safty which make a path longer. Second defect is that the original Voronoi diagram method has a problem of connecting the Voronoi daigram with start/goal point of mobile robot. These defects are removed in proposed algorithm in this paper. We define a function to show the quality of paths. And by computer simulation, paths are compared and its result are shown.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.39-45
• /
• 2004

A design method is proposed for the sequence detection with fixed decision delay with less hardware complexity using the concept of the Voronoi diagram and its dual, the Delaunay tessellation. This detector design is based on the Fixed Delay Tree Search (FDTS) detection. The FDTS is a computationally efficient sequence detection algerian and has been shown to achieve near-optimal performance in the severe Intersymbol Interference (ISI) channels when combined with decision feedback equalization and the appropriate channel coding. In this approach, utilizing the information contained in the Voronoi diagram or equivalently the Delaunay tessellation, the relative location of the detector input sequence in the multi-dimensional Euclidean space is found without any computational redundancy, which leads to a reduced complexity implementation of the detector.