Restricting Voronoi diagrams to meshes using corner validation

Abstract

International audienceRestricted Voronoi diagrams are a fundamental geometric structure used in many applications such as surface reconstruction from point sets or optimal transport. Given a set of sites V ⊂ R d and a mesh X with vertices in R^d connected by triangles, the restricted Voronoi diagram partitions X by computing for each site the portion of X for which the site is the nearest. The restricted Voronoi diagram is the intersection between the regular Voronoi diagram and the mesh. Depending on the site distribution or the ambient space dimension computing the regular Voronoi diagram may not be feasible using classical algorithms. In this paper, we extend Lévy and Bonneel's approach [LB12] based on nearest neighbor queries. We show that their method is limited when the sites are not located on X. We propose a new algorithm for computing restricted Voronoi which reduces the number of sites considered for each triangle of the mesh and scales smoothly when the sites are far from the surface

VoroTO: Multiscale Topology Optimization of Voronoi Structures using Surrogate Neural Networks

“…The shape of the Voronoi cell associated with a site is only influenced by that site and nearby sites. Voronoi diagrams are valuable for representing and analyzing complex spatial relationships, making them essential in computational geometry [62,63], modeling of porous structures [53], and design problems [39].…”

Biomorphic Clothing Sculpture Interface as an Emotional Communication Space

“…The Voronoi diagram is an outcome of specific space division whereby, starting from a discontinuous point referred to as the "site, " all cells are comprised of points that are closer to the generation seed (Lautensack, 2008;Malinauskas, 2008;Phillips, 2014). All intersections that are not empty are collected to form a Voronoi diagram limited by the domain and used to model the space from a series of calculated points (Sainlot et al, 2017). With these characteristics, the Voronoi diagram is positioned as a generative mechanism of digital space combined with computer programming, explaining the focus on 3D space generation of Voronoi in the parametric design process of clothing sculpture.…”

Initialization Procedures for Discrete and Semi-Discrete Optimal Transport

“…We use the fact that, for the quadratic cost, one can see the Laguerre diagram as the intersection between a Power diagram and the support of the source measure (here a triangulation). One can then use efficient algorithms to compute this intersection, see [27,28] for instance. We observe that the computation time is linear in the number of target points and more than linear in terms of the number of source triangles.…”