skip to main content
research-article
Open Access

Lifting simplices to find injectivity

Published:12 August 2020Publication History
Skip Abstract Section

Abstract

Mapping a source mesh into a target domain while preserving local injectivity is an important but highly non-trivial task. Existing methods either require an already-injective starting configuration, which is often not available, or rely on sophisticated solving schemes. We propose a novel energy form, called Total Lifted Content (TLC), that is equipped with theoretical properties desirable for injectivity optimization. By lifting the simplices of the mesh into a higher dimension and measuring their contents (2D area or 3D volume) there, TLC is smooth over the entire embedding space and its global minima are always injective. The energy is simple to minimize using standard gradient-based solvers. Our method achieved 100% success rate on an extensive benchmark of embedding problems for triangular and tetrahedral meshes, on which existing methods only have varied success.

Skip Supplemental Material Section

Supplemental Material

3386569.3392484.mp4

Presentation video

mp4

68.3 MB

References

  1. Pankaj K Agarwal, Bardia Sadri, and Hai Yu. 2008. Untangling triangulations through local explorations. In Proceedings of the twenty-fourth annual symposium on Computational geometry. ACM, 288--297.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Noam Aigerman and Yaron Lipman. 2013. Injective and bounded distortion mappings in 3D. ACM Transactions on Graphics (TOG) 32, 4 (2013), 106.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Noam Aigerman and Yaron Lipman. 2015. Orbifold Tutte embeddings. ACM Trans. Graph. 34, 6 (2015), 190--1.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Marcel Campen, Cláudio T Silva, and Denis Zorin. 2016. Bijective maps from simplicial foliations. ACM Transactions on Graphics (TOG) 35, 4 (2016), 74.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Yanqing Chen, Timothy A Davis, William W Hager, and Sivasankaran Rajamanickam. 2008. Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate. ACM Transactions on Mathematical Software (TOMS) 35, 3 (2008), 22.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sebastian Claici, Mikhail Bessmeltsev, Scott Schaefer, and Justin Solomon. 2017. Isometry-Aware Preconditioning for Mesh Parameterization. In Computer Graphics Forum, Vol. 36. Wiley Online Library, 37--47.Google ScholarGoogle Scholar
  7. Michael Floater. 2003. One-to-one piecewise linear mappings over triangulations. Math. Comp. 72, 242 (2003), 685--696.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Michael S Floater and Kai Hormann. 2005. Surface parameterization: a tutorial and survey. In Advances in multiresolution for geometric modelling. Springer, 157--186.Google ScholarGoogle Scholar
  9. Xiao-Ming Fu, Chong-Yang Bai, and Yang Liu. 2016. Efficient Volumetric PolyCube-Map Construction. Comput. Graph. Forum 35, 7 (2016), 97--106.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Xiao-Ming Fu and Yang Liu. 2016. Computing inversion-free mappings by simplex assembly. ACM Transactions on Graphics (TOG) 35, 6 (2016), 216.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Xiao-Ming Fu, Yang Liu, and Baining Guo. 2015. Computing locally injective mappings by advanced MIPS. ACM Transactions on Graphics (TOG) 34, 4 (2015), 71.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Steven Gortler, Craig Gotsman, and Dylan Thurston. 2006. Discrete one-forms on meshes and applications to 3D mesh parameterization. Computer Aided Geometric Design (2006).Google ScholarGoogle Scholar
  13. Xianfeng Gu, Ren Guo, Feng Luo, Jian Sun, Tianqi Wu, et al. 2018. A discrete uniformization theorem for polyhedral surfaces II. Journal of differential geometry 109, 3 (2018), 431--466.Google ScholarGoogle ScholarCross RefCross Ref
  14. Eden Fedida Hefetz, Edward Chien, and Ofir Weber. 2019. A Subspace Method for Fast Locally Injective Harmonic Mapping. In Computer Graphics Forum, Vol. 38. Wiley Online Library, 105--119.Google ScholarGoogle Scholar
  15. Kai Hormann and Giinther Greiner. 2000. MIPS: An Efficient Global Parametrization Method. France on 1-7 July 1999. Proceedings, Volume 1. Curve and Surface Design. F61775-99-WF068 (2000), 153.Google ScholarGoogle Scholar
  16. Kai Hormann, Bruno Lévy, and Alla Sheffer. 2007. Mesh parameterization: Theory and practice. (2007).Google ScholarGoogle Scholar
  17. Zhongshi Jiang, Scott Schaefer, and Daniele Panozzo. 2017. Simplicial complex augmentation framework for bijective maps. ACM Transactions on Graphics 36, 6 (2017).Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Shahar Z Kovalsky, Noam Aigerman, Ronen Basri, and Yaron Lipman. 2015. Large-scale bounded distortion mappings. ACM Trans. Graph. 34, 6 (2015), 191--1.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Minchen Li, Zachary Ferguson, Teseo Schneider, Timothy Langlois, Denis Zorin, Daniele Panozzo, Chenfanfu Jiang, and Danny M. Kaufman. 2020. Incremental potential contact: intersection- and inversion-free, large-deformation dynamics. ACM Transactions on Graphics (TOG) 39, 4 (2020).Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Minchen Li, Ming Gao, Timothy Langlois, Chenfanfu Jiang, and Danny M. Kaufman. 2019. Decomposed Optimization Time Integrator for Large-Step Elastodynamics. ACM Transactions on Graphics 38, 4 (2019).Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Yaron Lipman. 2014. Bijective Mappings of Meshes with Boundary and the Degree in Mesh Processing. SIAM Journal on Imaging Sciences [electronic only] 7 (04 2014). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Ligang Liu, Chunyang Ye, Ruiqi Ni, and Xiao-Ming Fu. 2018. Progressive parameterizations. ACM Transactions on Graphics (TOG) 37, 4 (2018), 41.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Tiantian Liu, Ming Gao, Lifeng Zhu, Eftychios Sifakis, and Ladislav Kavan. 2016. Fast and Robust Inversion-Free Shape Manipulation. In Computer Graphics Forum, Vol. 35. Wiley Online Library, 1--11.Google ScholarGoogle Scholar
  24. Ulrich Pinkall and Konrad Polthier. 1993. Computing discrete minimal surfaces and their conjugates. Experimental mathematics 2, 1 (1993), 15--36.Google ScholarGoogle Scholar
  25. Michael Rabinovich, Roi Poranne, Daniele Panozzo, and Olga Sorkine-Hornung. 2017. Scalable locally injective mappings. ACM Transactions on Graphics (TOG) 36, 4 (2017), 37a.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Christian Schüller, Ladislav Kavan, Daniele Panozzo, and Olga Sorkine-Hornung. 2013. Locally injective mappings. In Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing. Eurographics Association, 125--135.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Hanxiao Shen, Zhongshi Jiang, Denis Zorin, and Daniele Panozzo. 2019. Progressive embedding. ACM Transactions on Graphics (TOG) 38, 4 (2019), 32.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Anna Shtengel, Roi Poranne, Olga Sorkine-Hornung, Shahar Z Kovalsky, and Yaron Lipman. 2017. Geometric optimization via composite majorization. ACM Trans. Graph. 36, 4 (2017), 38--1.Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Jason Smith and Scott Schaefer. 2015. Bijective parameterization with free boundaries. ACM Transactions on Graphics (TOG) 34, 4 (2015), 70.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Jian-Ping Su, Xiao-Ming Fu, and Ligang Liu. 2019. Practical Foldover-Free Volumetric Mapping Construction. In Computer Graphics Forum, Vol. 38. Wiley Online Library, 287--297.Google ScholarGoogle Scholar
  31. Joseph Teran, Eftychios Sifakis, Geoffrey Irving, and Ronald Fedkiw. 2005. Robust quasistatic finite elements and flesh simulation. In Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation. ACM, 181--190.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. William Thomas Tutte. 1963. How to draw a graph. Proceedings of the London Mathematical Society 3, 1 (1963), 743--767.Google ScholarGoogle ScholarCross RefCross Ref
  33. Ofir Weber, Ashish Myles, and Denis Zorin. 2012. Computing extremal quasiconformal maps. In Computer Graphics Forum, Vol. 31. Wiley Online Library, 1679--1689.Google ScholarGoogle Scholar
  34. Ofir Weber and Denis Zorin. 2014. Locally injective parametrization with arbitrary fixed boundaries. ACM Transactions on Graphics (TOG) 33, 4 (2014), 75.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Stephen J Wright and Jorge Nocedal. 1999. Numerical optimization. Vol. 2. Springer New York.Google ScholarGoogle Scholar
  36. Yin Xu, Renjie Chen, Craig Gotsman, and Ligang Liu. 2011. Embedding a triangular graph within a given boundary. Computer Aided Geometric Design 28, 6 (2011), 349--356.Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Yufeng Zhu, Robert Bridson, and DannyM Kaufman. 2018. Blended cured quasi-newton for distortion optimization. ACM Transactions on Graphics (TOG) 37, 4 (2018), 40.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Lifting simplices to find injectivity

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Graphics
      ACM Transactions on Graphics  Volume 39, Issue 4
      August 2020
      1732 pages
      ISSN:0730-0301
      EISSN:1557-7368
      DOI:10.1145/3386569
      Issue’s Table of Contents

      Copyright © 2020 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 12 August 2020
      Published in tog Volume 39, Issue 4

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader