Results 31 to 40 of about 1,547 (174)
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
Variational blue noise sampling [PDF]
, 2012 Blue noise point sampling is one of the core algorithms in computer graphics. In this paper, we present a new and versatile variational framework for generating point distributions with high-quality blue noise characteristics while precisely adapting to ...
Chen, Zhonggui +5 more
core +3 more sources
Fast Spherical Centroidal Voronoi Mesh Generation: A Lloyd-preconditioned LBFGS Method in Parallel
, 2018 Centroidal Voronoi tessellation (CVT)-based mesh generation is a very effective technique for creating high-quality Voronoi meshes and their dual Delaunay triangulations that often play a crucial role in applications, including ocean and atmospheric ...
Gunzburger, Max +2 more
core +1 more source
IEEE AccessVoronoi diagrams are widely used for area partitioning and coverage control. Nevertheless, their utilization in non-convex domains often necessitates additional computational procedures, such as diffeomorphism application, geodesic distance calculations,
Kangneoung Lee, Kiju Lee
doaj +1 more source
Intrinsic computation of centroidal Voronoi tessellation (CVT) on meshes [PDF]
Computer-Aided Design, 2015 Centroidal Voronoi tessellation (CVT) is a special type of Voronoi diagram such that the generating point of each Voronoi cell is also its center of mass. The CVT has broad applications in computer graphics, such as meshing, stippling, sampling, etc. The existing methods for computing CVTs on meshes either require a global parameterization or compute ...
Wang, XN +7 more
openaire +4 more sources
, 2018 How to draw the vertices of a complete multipartite graph $G$ on different points of a bounded $d$-dimensional integer grid, such that the sum of squared distances between vertices of $G$ is (i) minimized or (ii) maximized? For both problems we provide a
DA Spielman +12 more
core +1 more source
On Volumetric Shape Reconstruction from Implicit Forms [PDF]
, 2016 International audienceIn this paper we report on the evaluation of volumetric shape reconstruction methods that consider as input implicit forms in 3D.
Boyer, Edmond +2 more
core +4 more sources
L p Centroidal Voronoi Tessellation and its applications [PDF]
ACM SIGGRAPH 2010 papers, 2010 This paper introduces L p -Centroidal Voronoi Tessellation ( L p -CVT), a generalization of CVT that minimizes a higher-order moment of the coordinates on the Voronoi cells. This generalization allows for aligning
Lévy, Bruno, Liu, Yang
openaire +4 more sources
Content-Sensitive Multilevel Point Cluster Construction for ALS Point Cloud Classification
Remote Sensing, 2019 Airborne laser scanning (ALS) point cloud classification is a challenge due to factors including complex scene structure, various densities, surface morphology, and the number of ground objects.
Zongxia Xu +7 more
doaj +1 more source
Experimental verification of coverage control of multi‐agent systems with obstacle avoidance
The Journal of EngineeringMulti‐agent systems are a significant and popular area of study in robotics, focusing on efficient and safe coordination among multiple agents. This paper presents algorithms for safe coverage control in multi‐agent systems, addressing key challenges ...
Fidelia Chaitra Siri +2 more
doaj +1 more source