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

• Spatial Information Research
• /
• v.15 no.3
• /
• pp.203-218
• /
• 2007

The purpose of this article is to set up the scientific and reasonable norm of location and service area determination instead of the pro-administrative lacking availability, so as to propose more practical and reasonable standard of space unit for the location of facilities. This article has accepted the method of Voronoi Diagram as a new scientific and reasonable criteria. The article chooses and realizes a model that can propose a new service area, transform and apply to improve its reality, and assesses which has more reality and compatibility by comparing the models. The result from this procedure can be adapted in objectification of the service area determination and formation of the standard space unit.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.9 no.5
• /
• pp.490-495
• /
• 1999

In this paper. a learning method VoD-EBP for neural networks is proposed, which learn patterns by error back propagation. Based on Voronoi diagram, the method initializes the weights of the neural networks systematically, wh~ch results in faster learning speed and alleviated local optimum problem. The method also shows better the reliability of the design of neural network because proper number of hidden nodes are determined from the analysis of Voronoi diagram. For testing the performance, this paper shows the results of solving the XOR problem and the parity problem. The results were showed faster learning speed than ordinary error back propagation algorithm. In solving the problem, local optimum problems have not been observed.

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

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.24 no.1
• /
• pp.98-102
• /
• 2015

This paper proposes an autonomous navigation method for a nonholonomic mobile robot, based on the generalized Voronoi diagram (GVD). We define the look-ahead point for a given motion constraint to determine the direction of motion, which solves the problem of a minimum turning radius for the real nonholonomic mobile robot. This method can be used to direct the robot to explore an unknown environment and construct smooth feedback curves for the nonholonomic robot. As the trajectories can be smoothed, the position of the robot can be stabilized in the plane. The simulation results are presented to verify the performance of the proposed methods for the nonholonomic mobile robot. Furthermore, this approach is worth drawing on the experience of any other mobile robots.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1274-1279
• /
• 2003

In this paper, a new meshfree technique which improves the numerical integration accuracy is introduced. This new method called the Petrov-Galerkin natural element(PG-NE) is based on the Voronoi diagram and the Delaunay triangulation which is based on the same concept used for conventional natural element method called the Bubnov-Galerkin natural element(BG-NE). But, unlike BG-NE method, the test shape function is differently chosen from the trial shape function. The proposed technique ensures that the numerical integration error is remarkably reduced.

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

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.2
• /
• pp.193-198
• /
• 2004

This paper describes an automatic finite element (FE) mesh generation for three-dimensional structures consisting of tree-form surfaces. This mesh generation process consists of three subprocesses: (a) definition of geometric model, (b) generation of nodes, and (c) generation of elements. One of commercial solid modelers is employed for three-dimensional solid structures. Node is generated if its distance from existing node points is similar to the node spacing function at the point. The node spacing function is well controlled by the fuzzy knowledge processing. The Voronoi diagram method is introduced as a basic tool for element generation. Automatic generation of FE meshes for three-dimensional solid structures holds great benefits for analyses. Practical performances of the present system are demonstrated through several mesh generations for three-dimensional complex geometry.

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

Presented in the paper is a procedure to reconstruct a triangular mesh from a point cloud. Although, the proposed procedure is based on the well-known Voronoi diagram approach, it introduces a selection method of 'Pole' to improve the quality of resulting mesh. To select the appropriate Poles for high quality of Triangular mesh, the patterns that the Poles affect to the mesh quality are carefully analyzed. It is possible to improve the mesh quality by controlling the selection method of 'Pole' in terms of distance limit. The initial mesh obtained by the proposed procedure may include invalid triangles. To relieve this problem, a slicing method is proposed to remove invalid triangles from the initial mesh. At last, correcting technique of normal vectors of generated mesh is introduced.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.469-479
• /
• 2007

This paper focuses on the capacitated vehicle routing problem that determines the routes of vehicles in such a way that each customer must be visited exactly once by one vehicle starting and terminating at the depot while the vehicle capacity and the travel time constraints must be satisfied. The objective is to minimize the total traveling cost. Due to the complexity of the problem, we suggest a tabu search algorithm that combines the features of the existing search heuristics. In particular, our algorithm incorporates the neighborhood reduction method using the proximity information of the Voronoi diagram corresponding to each problem instance. To show the performance of the Voronoi tabu search algorithm suggested in this paper, computational experiments are done on the benchmark problems and the test results are reported.