Premium
Restricting Voronoi diagrams to meshes using corner validation
Author(s) -
Sainlot M.,
Nivoliers V.,
Attali D.
Publication year - 2017
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.13247
Subject(s) - voronoi diagram , centroidal voronoi tessellation , power diagram , intersection (aeronautics) , weighted voronoi diagram , polygon mesh , bowyer–watson algorithm , dimension (graph theory) , surface (topology) , computational geometry , computer science , k nearest neighbors algorithm , diagram , mathematics , algorithm , combinatorics , geometry , geography , cartography , artificial intelligence , database
Restricted 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 = { v k } n k=1 ⊂ ℝ d and a mesh X with vertices in ℝ 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.