HOT: Hodge-optimized triangulations

We introduce Hodge-optimized triangulations (HOT), a family of well-shaped primal-dual pairs of complexes designed for fast and accurate computations in computer graphics. Previous work most commonly employs barycentric or circumcentric duals; while barycentric duals guarantee that the dual of each simplex lies within the simplex, circumcentric duals are often preferred due to the induced orthogonality between primal and dual complexes. We instead promote the use of weighted duals ("power diagrams"). They allow greater flexibility in the location of dual vertices while keeping primal-dual orthogonality, thus providing a valuable extension to the usual choices of dual by only adding one additional scalar per primal vertex. Furthermore, we introduce a family of functionals on pairs of complexes that we derive from bounds on the errors induced by diagonal Hodge stars, commonly used in discrete computations. The minimizers of these functionals, called HOT meshes, are shown to be generalizations of Centroidal Voronoi Tesselations and Optimal Delaunay Triangulations, and to provide increased accuracy and flexibility for a variety of computational purposes.

[1]  M. Degroot,et al.  Probability and Statistics , 2021, Examining an Operational Approach to Teaching Probability.

[2]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[3]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

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

[5]  Ulrich Pinkall,et al.  Computing Discrete Minimal Surfaces and Their Conjugates , 1993, Exp. Math..

[6]  V. T. Rajan Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..

[7]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

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

[9]  Jonathan Richard Shewchuk,et al.  What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures , 2002, IMR.

[10]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[11]  Anil N. Hirani,et al.  Discrete exterior calculus , 2005, math/0508341.

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

[13]  Thomas Rylander,et al.  Computational Electromagnetics , 2005, Electronics, Power Electronics, Optoelectronics, Microwaves, Electromagnetics, and Radar.

[14]  B. Auchmann,et al.  A geometrically defined discrete hodge operator on simplicial cells , 2006, IEEE Transactions on Magnetics.

[15]  Peter Schröder,et al.  An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing , 2006, Computing.

[16]  Yiying Tong,et al.  Discrete differential forms for computational modeling , 2005, SIGGRAPH Courses.

[17]  J. Blair Perot,et al.  Discrete calculus methods for diffusion , 2007, J. Comput. Phys..

[18]  E. Grinspun,et al.  Discrete laplace operators: no free lunch , 2007 .

[19]  Mathieu Desbrun,et al.  Barycentric coordinates for convex sets , 2007, Adv. Comput. Math..

[20]  Scott O. Wilson Cochain algebra on manifolds and convergence under refinement , 2007 .

[21]  Yiying Tong,et al.  Stable, circulation-preserving, simplicial fluids , 2007, TOGS.

[22]  Ellen Kuhl,et al.  Diamond elements: a finite element/discrete‐mechanics approximation scheme with guaranteed optimal convergence in incompressible elasticity , 2007, International Journal for Numerical Methods in Engineering.

[23]  D. Glickenstein Geometric triangulations and discrete Laplacians on manifolds , 2005, math/0508188.

[24]  C. Villani Optimal Transport: Old and New , 2008 .

[25]  T. Dey,et al.  Theory of a Practical Delaunay Meshing Algorithm for a Large Class of Domains , 2009 .

[26]  Chenglei Yang,et al.  On centroidal voronoi tessellation—energy smoothness and fast computation , 2009, TOGS.

[27]  Camille Wormser,et al.  Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation , 2009, SIGGRAPH 2009.

[28]  I. Daubechies,et al.  Surface Comparison with Mass Transportation , 2009, 0912.3488.

[29]  B. Lévy,et al.  Lp Centroidal Voronoi Tessellation and its applications , 2010, ACM Trans. Graph..

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

[31]  Damrong Guoy,et al.  Well-Centered Triangulation , 2008, SIAM J. Sci. Comput..

[32]  Christopher Batty,et al.  Tetrahedral Embedded Boundary Methods for Accurate and Flexible Adaptive Fluids , 2010, Comput. Graph. Forum.

[33]  Leo Grady,et al.  Discrete Calculus - Applied Analysis on Graphs for Computational Science , 2010 .

[34]  Pierre Alliez,et al.  Optimizing Voronoi Diagrams for Polygonal Finite Element Computations , 2010, IMR.

[35]  F. Mémoli,et al.  A spectral notion of Gromov–Wasserstein distance and related methods , 2011 .