Results 11 to 20 of about 1,330 (153)
Non-Obtuse Remeshing with Centroidal Voronoi Tessellation [PDF]
IEEE Transactions on Visualization and Computer Graphics, 2016 We present a novel remeshing algorithm that avoids triangles with small (acute) angles and those with large (obtuse) angles. Our solution is based on an extension of Centroidal Voronoi Tesselation (CVT). We augment the original CVT formulation with a penalty term that penalizes short Voronoi edges, while the CVT term helps to avoid small angles.
Dong-Ming Yan, Peter Wonka
openaire +3 more sources
Computing 2D Periodic Centroidal Voronoi Tessellation [PDF]
2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011 In this paper, we propose an efficient algorithm to compute the centroidal Voronoi tessellation in 2D periodic space. We first present a simple algorithm for constructing the periodic Voronoi diagram (PVD) from a Euclidean Voronoi diagram. The presented PVD algorithm considers only a small set of periodic copies of the input sites, which is more ...
Yan, Dong-Ming +3 more
openaire +1 more source
Approximation by finitely supported measures [PDF]
, 2010 Given a compactly supported probability measure on a Riemannian manifold, we study the asymptotic speed at which it can be approximated (in Wasserstein distance of any exponent p) by finitely supported measure.
Kloeckner, Benoit
core +3 more sources
Design of Nonperiodic Density Tapered Arrays with CVT Distributions
Leida xuebao, 2014 Density Tapered Arrays (DTA) with nonperiodic spaced elements have many interesting features when compared to traditional DTA in which antenna elements are located only at the intersections of periodic grid; however, a design method is yet to be fully ...
Xue Dong-hai +4 more
doaj +1 more source
Using Centroidal Voronoi Tessellations to Scale Up the Multi-dimensional Archive of Phenotypic Elites Algorithm [PDF]
, 2017 The recently introduced Multi-dimensional Archive of Phenotypic Elites (MAP-Elites) is an evolutionary algorithm capable of producing a large archive of diverse, high-performing solutions in a single run.
Chatzilygeroudis, Konstantinos +2 more
core +5 more sources
2D Centroidal Voronoi Tessellations with Constraints [PDF]
Numerical Mathematics: Theory, Methods and Applications, 2010 We tackle the problem of constructing 2D centroidal Voronoi tessellations with constraints through an efficient and robust construction of bounded Voronoi diagrams, the pseudo-dual of the constrained Delaunay triangulation. We exploit the fact that the cells of the bounded Voronoi diagram can be obtained by clipping the ordinary ones against the ...
Tournois, Jane +2 more
openaire +2 more sources
JIGSAW-GEO (1.0): locally orthogonal staggered unstructured grid generation for general circulation modelling on the sphere [PDF]
, 2017 An algorithm for the generation of non-uniform, locally-orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered Voronoi/Delaunay meshes appropriate for general circulation ...
Engwirda, Darren
core +2 more sources
A numerical algorithm for $L_2$ semi-discrete optimal transport in 3D [PDF]
, 2014 This paper introduces a numerical algorithm to compute the $L_2$ optimal transport map between two measures $\mu$ and $\nu$, where $\mu$ derives from a density $\rho$ defined as a piecewise linear function (supported by a tetrahedral mesh), and where ...
Levy, Bruno
core +6 more sources
On centroidal voronoi tessellation—energy smoothness and fast computation [PDF]
ACM Transactions on Graphics, 2009 Centroidal Voronoi tessellation (CVT) is a particular type of Voronoi tessellation that has many applications in computational sciences and engineering, including computer graphics. The prevailing method for computing CVT is Lloyd's method, which has linear convergence and is inefficient in practice. We develop new efficient methods for CVT computation
Liu, Yang +6 more
openaire +5 more sources
Dynamic distributed clustering in wireless sensor networks via Voronoi tessellation control [PDF]
, 2019 This paper presents two dynamic and distributed clustering algorithms for Wireless Sensor Networks (WSNs). Clustering approaches are used in WSNs to improve the network lifetime and scalability by balancing the workload among the clusters.
Liberati, Francesco +1 more
core +1 more source