non-uniformtilingdensity.UsethespaceVoronoigraphpartitionalgorithmcanalsobe appliedtocomputergraphicsandtheunevensurfacesubdivision,alsocanbeusedin3d spaceconstructedincomputationalchemistryinmolecular,haveextensiveapplication. Keywords:SpaceDivision,VoronoiDivision,IterativeMethod 1引言 区域划分在计算几何、计算机图形学以及...
Voronoipartitionisthebottleneckofthealgorithm,theadoptionofdualpolygonalmeshes substantiallyreducesthetimeforcheckingthevalidityofVoronoipartition,hencethealgorithmπs efficiency. Keywordsmultiresolution;dualpatch;remeshing;subdivision;Laplacian 在三维动画游戏中,人们希望以最短的时间、最 快的速度,甚至实时地展现“真实”...
The algorithm is based on minimizing the area of the generalized Voronoi partition of the evader. The pursuers share state information but compute their inputs independently. No assumptions are made about the evader’s control strategies other than requiring the evader control inputs to conform to...
At each time instant, a bounded convex polyhedral working region is partitioned using a Voronoi algorithm providing the agents with non-overlapping functioning zones. The agents' deployment objective is to drive the entire system into a stable static configuration which corresponds to a stationary ...
we presented an algorithm for constructing a smooth computable function f defined over the surface of a sphere and interpolating a set of n data values z associated with n locations p on the i i surface of the sphere. Key word: Triangulation, Voronoi diagram, sector partition, surfaces, trian...
We prove the Voronoi conjecture for five-dimensional parallelohedra. Namely, we show that if a convex five-dimensional polytopeP\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs}...
An efficient algorithm for generating diverse microstructure sets and delineating properties closures,Acta Materialia , vol. 147, pp. 313-321, 2018. Müller, T. Frühwirt, D. Haase, R. Schlegel and H. Konietzky, Modeling deformation and damage of rock salt using the discrete element method,Inte...
The new set of pivots \({\mathcal {O}}_k\) is used to compute the Voronoi partition for the next iteration. The algorithm stops when the set of pivots is no longer updated. Finally, we update the set of ranked points \({\mathcal {O}}_0\) adding to it (in ascending order) ...
This work presents a decentralized, real-time algorithm for cooperative pursuit of a single evader by multiple pursuers in bounded, simply-connected planar domains. The algorithm is based on minimizing the area of the generalized Voronoi partition of the evader. The pursuers share state information...
Finally, it should also be noted that Voronoi diagrams are tightly linked with the k-nearest neighbours algorithm (k-NN) — a very popular algorithm in classification, regression and clustering problems. The algorithm uses thekclosest examples in the training dataset to make value predictions. Sinc...