Robustly computing restricted Voronoi diagrams (RVD) on thin-plate models

Abstract Voronoi diagram based partitioning of a 2-manifold surface in R 3 is a fundamental operation in the field of geometry processing. However, when the input object is a thin-plate model or contains thin branches, the traditional restricted Voronoi diagrams (RVD) cannot induce a manifold structure that is conformal to the original surface. Yan et al. (2014) are the first who proposed a localized RVD (LRVD) algorithm to handle this issue. Their algorithm is based on a face-level clustering technique, followed by a sequence of bisector clipping operations. It may fail when the input model has long and thin triangles. In this paper, we propose a more elegant/robust algorithm for computing RVDs on models with thin plates or even tubular parts. Our idea is inspired by such a fact: the desired RVD must guarantee that each site dominates a single region that is topologically identical to a disk. Therefore, when a site dominates disconnected subregions, we identify those ownerless regions and re-partition them to the nearby sites using a simple and fast local Voronoi partitioning operation. For each site that dominates a tubular part, we suggest add two more sites such that the three sites are almost rotational symmetric. Our approach is easy to implement and more robust to challenging cases than the state-of-the-art approach.

[1]  Dong-Ming Yan,et al.  Non-Obtuse Remeshing with Centroidal Voronoi Tessellation , 2016, IEEE Transactions on Visualization and Computer Graphics.

[2]  Franz Aurenhammer,et al.  Voronoi Diagrams and Delaunay Triangulations , 2013 .

[3]  S. Gortler,et al.  Fast exact and approximate geodesics on meshes , 2005, SIGGRAPH 2005.

[4]  Ivan Stojmenovic,et al.  Voronoi diagram and convex hull based geocasting and routing in wireless networks , 2006, Wirel. Commun. Mob. Comput..

[5]  Dong-Ming Yan,et al.  Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram , 2009, Comput. Graph. Forum.

[6]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[7]  Xiaolong Zhang,et al.  Medial axis tree - an internal supporting structure for 3D printing , 2015, Comput. Aided Geom. Des..

[8]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[9]  Ligang Liu,et al.  Variational Blue Noise Sampling , 2012, IEEE Transactions on Visualization and Computer Graphics.

[10]  Bin Wang,et al.  A Survey of Blue-Noise Sampling and Its Applications , 2015, Journal of Computer Science and Technology.

[11]  Herbert Edelsbrunner,et al.  Triangulating Topological Spaces , 1997, Int. J. Comput. Geom. Appl..

[12]  Shi-Qing Xin,et al.  Intrinsic computation of centroidal Voronoi tessellation (CVT) on meshes , 2015, Comput. Aided Des..

[13]  Qinping Zhao,et al.  Computing Restricted Voronoi Diagram on Graphics Hardware , 2017, PG.

[14]  Rémy Prost,et al.  Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams , 2008, IEEE Transactions on Visualization and Computer Graphics.

[15]  Alexander Keller,et al.  Tiled Blue Noise Samples , 2001, VMV.

[16]  B. Lévy,et al.  L p Centroidal Voronoi Tessellation and its applications , 2010, SIGGRAPH 2010.

[17]  Dong-Ming Yan,et al.  Fitting polynomial surfaces to triangular meshes with Voronoi squared distance minimization , 2012, Engineering with Computers.

[18]  Martin Isenburg,et al.  Centroidal Voronoi diagrams for isotropic surface remeshing , 2005, Graph. Model..

[19]  Christopher M. Gold What is GIS and What is Not? , 2006, Trans. GIS.

[20]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[21]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[22]  Caiming Zhang,et al.  Robust modeling of constant mean curvature surfaces , 2012, ACM Trans. Graph..

[23]  M. Yvinec,et al.  Variational tetrahedral meshing , 2005, SIGGRAPH 2005.

[24]  Kai Tang,et al.  Construction of Iso-Contours, Bisectors, and Voronoi Diagrams on Triangulated Surfaces , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[25]  M. Balzer,et al.  Voronoi treemaps , 2005, IEEE Symposium on Information Visualization, 2005. INFOVIS 2005..

[26]  Mathieu Desbrun,et al.  Blue noise through optimal transport , 2012, ACM Trans. Graph..

[27]  Franz-Erich Wolter,et al.  Geodesic Voronoi diagrams on parametric surfaces , 1997, Proceedings Computer Graphics International.

[28]  Vincent Nivoliers,et al.  Approximating Functions on a Mesh with Restricted Voronoï Diagrams , 2013, SGP '13.

[29]  Bruno Lévy,et al.  Variational Anisotropic Surface Meshing with Voronoi Parallel Linear Enumeration , 2012, IMR.

[30]  Guillaume Caumon,et al.  Automatic surface remeshing of 3D structural models at specified resolution: A method based on Voronoi diagrams , 2014, Comput. Geosci..

[31]  Bruno Lévy,et al.  Surface reconstruction by computing restricted Voronoi cells in parallel , 2017, Comput. Aided Des..

[32]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[33]  Xiaohu Guo,et al.  Hyperbolic centroidal Voronoi tessellation , 2010, SPM '10.

[34]  Adrian Secord,et al.  Weighted Voronoi stippling , 2002, NPAR '02.

[35]  Dong-Ming Yan,et al.  Low-Resolution Remeshing Using the Localized Restricted Voronoi Diagram , 2014, IEEE Transactions on Visualization and Computer Graphics.

[36]  Qiang Du,et al.  Constrained Centroidal Voronoi Tessellations for Surfaces , 2002, SIAM J. Sci. Comput..