• Journal of Korea Multimedia Society
• /
• v.22 no.2
• /
• pp.311-321
• /
• 2019

Virtual reality applications in Head-Mounted Displays require high frame rates and low latency rendering techniques. Ray tracing offers many benefits, such as high-quality image generation, but has not been utilized due to lower performance than rasterization. But that can obtain good result combined with gaze-tracking technology and human visual system's operation principle. In this paper, we propose a method to optimize the foveated sampling map and to maintain the visual quality through the fast voronoi nearest interpolation. The proposed method further reduces the computational cost that has been improved by the previous foveated sampling. It also smoothes the voronoi boundary using adaptive sibson interpolation, which was not possible in real-time. As a result, the proposed method can render real-time high-quality images with low visual difference.

• International Journal of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.22-30
• /
• 2023

The portable mobile devices with high performance and high speed 5G network activate and explode the demands for ubiquitous information services that remove the limitations of time for the communication and places to request for the information. NN (Nearest Neighbor) search is one of the most important types of queries to be processed efficiently in the information services. Various indexes have been proposed to support efficient NN search in the wireless broadcast system. The indexes adopting Hilbert curve, grid partition or Voronoi diagram enable the clients to search for NN quickly in the wireless broadcast channel. It is necessary that an efficient means to evaluate the performances of various indexes. In this paper, we propose an open framework that can adopt a variety of indexing schemes and evaluate and compare the performances of them. The proposed framework is organized with open and flexible structure that can adopt hybrid indexing schemes extensible to Voronoi diagram as well as simple indexing schemes. With the implemented framework, we demonstrate the efficiency and scalability and flexibility of the proposed framework by evaluating various indexing schemes for NN query.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1892-1893
• /
• 2011

본 논문에서는 Centroidal Voronoi Tessellation을 이용하여 군집로봇의 협조탐색을 위한 공간분할기법을 제안한다. 탐색공간은 Centroidal Voronoi Tessellation을 이용하여 분할한다. 전역 경로 계획 및 군집 로봇 간의 충돌 회피는 포텐셜 필드를 이용한다. 탐색공간에 밀도 함수를 사용하여 공간분할의 유동성을 부여한다. 마지막으로, 군집로봇의 협조탐색의 가능성을 시뮬레이션을 통하여 확인한다.

• Communications for Statistical Applications and Methods
• /
• v.4 no.1
• /
• pp.129-138
• /
• 1997

In this paper, the problem for choosing design points in the two dimensional case is condidered. In the one dimensional case, given the design density function, we can choose design points using the quantile function. However, in the two dimensional case, there is no clear definition of the percentile. Therefore, the idea of choosing design points in the univariate case can not be applied directly to the two dimensional case. We convert this problem into an optimization problem using the Voronoi diagram.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.283-284
• /
• 2016

사물인터넷이란 인간의 일상생활에 사용 중인 가전제품, 의료기기, 기타 센서 부착 기기들이 인터넷에 연결되어 스스로 통신하고 제어하는 환경이다. 본 논문에서는 사물인터넷을 구성하는 각 사물들 간의 효율적인 통신을 위해 센터노드를 설정하고 각 사물들이 센터 노드를 중계기로 활용하여 다른 사물들과 효과적인 통신할 때 보로노이 다이어그램을 적용하는 방법을 제안한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.174-179
• /
• 2003

Through the simultaneous localization and map building (SLAM) technique, a robot can create maps about its unknown environment while it continuously localizes its position. Grid maps and feature maps have been widely used for SLAM together with application of probability methods and POMDP (partially observed Markov decision process). But this approach based on grid maps suffers from enormous computational burden. Topological maps, however, have drawn more attention these days because they are compact, provide natural interfaces, and are easily applicable to path planning in comparison with grid maps. Some topological SLAM techniques like GVG (generalized Voronoi diagram) were introduced, but it enables the robot to decide only whether the current position is part of GVG branch or not in the GVG algorithm. In this paper, therefore, to overcome these problems, we present a method for updating a global topological map from the local topological maps. These local topological maps are created through a labeled Voronoi diagram algorithm from the local grid map built based on the sensor information at the current robot position. And the nodes of a local topological map can be utilized as the features of the environment because it is robust in light of visibility problem. The geometric information of the feature is applied to the extended Kalman filter and the SLAM in the indoor environment is accomplished. A series of simulations have been conducted using a two-wheeled mobile robot equipped with a laser scanner. It is shown that the proposed scheme can be applied relatively well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.758-766
• /
• 2011

Cooperative communications are adopted as a promising solution to achieve high data rate over large areas in the future 40 wireless system and the relay station (RS) is the key concept in cooperative communications. However, most existing works in this area focus only on optimal RS selections. In addition, there are only few works consider another crucial issue: how many relay stations we need to place. Only when the number of relay stations is defined, the relay station selection can be performed well. In this paper we derive a formula which describes the impact of varying number of RS on end-to-end link throughput assuming a clustering scheme which is based on Voronoi tessellation. In addition to mathematical analysis on the feasibility of the formula, we also examine its performance through a set of simulations under the Erceg path loss model. Simulation results verify that the link throughput gain of our proposed scheme is promising.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1686-1691
• /
• 2004

In this paper, we present an improved method to calculate Euclidean distance transform based on Guan's method. Compared to the conventional method, Euclidean distance can be computed faster using Guan's method when the number of feature pixels is small; however, overall computational cost increases proportional to the number of feature pixels in an image. To overcome this problem, we divide feature pixels into two groups: boundary feature pixels (BFPs) and non-boundary feature pixels (NFPs). Here BFPs are defined as those in the 4-neighborhood of foreground pixels. Then, only BFPs are used to calculate the Voronoi diagram resulting in a Euclidean distance map. Experimental results indicate that the proposed method takes 40 Percent less computing time on average than Guan's method. To prove the performance of the proposed method, the computing time of Euclidean distance map by proposed method is compared with the computing time of Guan's method in 16 images that are binary and the size of 512${\times}$512.

• Computers and Concrete
• /
• v.27 no.3
• /
• pp.283-295
• /
• 2021

Existing meso-scale models of concrete need to refine the mesh grids of aggregate and cement mortar, which may greatly reduce the computational efficiency. To overcome this problem, a novel meso-scale modeling strategy, which is based on rigid body spring method and Voronoi diagram, is proposed in this study to establish the meso-scale model of concrete. Firstly, establish numerical aggregate models according to user-defined programs. Circle aggregates are adopted due to their high efficiency in generation and packing process, and the grading of aggregate are determined according to the distribution curve proposed by Full and Thompson; Secondly, extract the centroids of aggregates, and then develop the Voronoi diagram in which aggregate centroids are defined as initial scatters; Finally, establish the rigid body spring model for concrete based on the Voronoi diagram. Aggregates are represented by rigid blocks, and assumed to be unbreakable. Cement mortar is concentrated into the interface between adjacent blocks and represented by two uniform springs. The number of grids is consistent with that of aggregates in specimens, and no mesh-refinement of aggregates and cement mortar is required. The accuracy and efficiency of the proposed modeling strategy are firstly identified by comparing the numerical results with the experimental ones, and then the applicability of the proposed strategy with different volume percentage occupied by aggregates is investigated.

• Journal of Aerospace System Engineering
• /
• v.18 no.3
• /
• pp.1-7
• /
• 2024

The utilization of Unmanned Aerial Vehicles (UAVs) is expanding in various industries such as logistics, manufacturing, and transportation. However, to operate a large number of UAVs, it is imperative to first plan a secure and efficient self-configuring communication network for UAVs. In this study, we proposed a method for planning a secure and efficient UAV self-configuring communication network using Voronoi diagrams in the following three steps: 1) generating Voronoi diagrams using obstacles, 2) selecting obstacles to consider for path generation, and 3) planning the optimal path and outputting the path. The real-time feasibility of using the proposed method for planning optimal communication paths for a realistic number of UAVs was experimentally validated.