The Power of Orthogonal Duals (Invited Talk)

Chapter

Abstract

Triangle meshes have found widespread acceptance in computer graphics as a simple, convenient, and versatile representation of surfaces. In particular, computing on such simplicial meshes is a workhorse in a variety of graphics applications. In this context, mesh duals (tied to Poincaré duality and extending the well known relationship between Delaunay triangulations and Voronoi diagrams) are often useful, be it for physical simulation of fluids or parameterization. However, the precise embedding of a dual diagram with respect to its triangulation (i.e., the placement of dual vertices) has mostly remained a matter of taste or a numerical after-thought, and barycentric versus circumcentric duals are often the only options chosen in practice. In this chapter we discuss the notion of orthogonal dual diagrams, and show through a series of recent works that exploring the full space of orthogonal dual diagrams to a given simplicial complex is not only powerful and numerically beneficial, but it also reveals (using tools from algebraic topology and computational geometry) discrete analogs to continuous properties.

Keywords

Orthogonal dual Blue noise Masonry structure Discrete exterior calculus 

References

  1. 1.
    de Goes F, Breeden K, Ostromoukhov V, Desbrun M (2012) Blue noise through optimal transport. ACM Trans Graph (SIGGRAPH Asia) 31(4):171:1–171:11Google Scholar
  2. 2.
    de Goes F, Alliez P, Owhadi H, Desbrun M (2013) On the equilibrium of simplicial masonry structures. ACM Trans Graph (SIGGRAPH) 32(4):93:1–93:10Google Scholar
  3. 3.
    de Goes F, Mullen P, Memari P, Desbrun M (2013) Weighted triangulations for geometry processing. ACM Trans Graph 31:103:1–103:12Google Scholar
  4. 4.
    Elcott S, Tong Y, Kanso E, Schröder P, Desbrun MP (2007) Stable, circulation-preserving, simplicial fluids. ACM Trans Graph 26(1):140–164Google Scholar
  5. 5.
    Glickenstein D (2005) Geometric triangulations and discrete Laplacians on manifolds. Preprint at arXiv.org:math/0508188Google Scholar
  6. 6.
    Heyman J (1966) The stone skeleton. Int J Solids Struct 2(2):249–279CrossRefGoogle Scholar
  7. 7.
    Mercat C (2001) Discrete Riemann surfaces and Ising model. Comm Math Phys 218:177–216CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Mullen P, Memari P, de Goes F, Desbrun M (2011) HOT: Hodge-optimized triangulations. ACM Trans Graph (SIGGRAPH) 30(4):103:1–103:12CrossRefGoogle Scholar
  9. 9.
    Munkres JR (1984) Elements of algebraic topology. Addison-Wesley, BostonGoogle Scholar
  10. 10.
    Rajan VT (1994) Optimality of Delaunay triangulation in riptsize \(\mathbb{R}^d\). Disc Comp Geo 12(1):189–202CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Ulichney RA (1987) Digital halftoning. MIT Press, New YorkGoogle Scholar
  12. 12.
    VanderZee Evan, Hirani Anil N, Guoy Damrong, Ramos Edgar (2010) Well-centered triangulation. SIAM Journal on Scientific Computing 31(6):4497–4523CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Japan 2014

Authors and Affiliations

  1. 1.The Applied Geometry LabCalifornia Institute of TechnologyPasadenaUSA

Personalised recommendations