Skip to Main content Skip to Navigation
New interface
Journal articles

Restricting Voronoi diagrams to meshes using corner validation

Maxime Sainlot 1, 2 Vincent Nivoliers 1 Dominique Attali 2 
1 R3AM - Rendu Réaliste pour la Réalité Augmentée Mobile
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : 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 ⊂ 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Maxime Sainlot Connect in order to contact the contributor
Submitted on : Monday, October 30, 2017 - 1:04:20 PM
Last modification on : Friday, September 30, 2022 - 11:34:16 AM
Long-term archiving on: : Wednesday, January 31, 2018 - 12:38:44 PM


Files produced by the author(s)



Maxime Sainlot, Vincent Nivoliers, Dominique Attali. Restricting Voronoi diagrams to meshes using corner validation. Computer Graphics Forum, 2017, 36 (5), pp.81 - 91. ⟨10.1111/cgf.13247⟩. ⟨hal-01626140⟩



Record views


Files downloads