Fast texture mapping for triangle soups using electrostatic monopole field lines

In: Computers & Graphics (2018), 77(140-155)
 

Abstract

We present an efficient approach for the parameterization of triangle soups. Our technique tackles the problem by first approximating the triangle soup by a watertight 2-manifold offset mesh proxy. By establishing point correspondences between the triangle soup and the shape proxy by tracing electrostatic field lines in time O(kn) instead of O(kn2), we can transfer properties computed on the surface, such as UV-coordinates even for large input meshes. The technique can process large triangle soups by replacing the computational intensive physical calculations by approximations developed initially for large-scale physical simulations. Thus, it is possible to decrease the time complexity of the initial charge distribution algorithm from O(n3) to O(n). We demonstrate our method on a multitude of challenging triangle soups and focus on the transfer of UV-coordinates during our experiments. An intensive run-time analysis and a comparison of our results to state of the art techniques in standard modeling tools concludes our study.

Keywords: parameterization, Point Correspondences, Seamless Mapping, Texturing, Triangle Soups

Author's version available at: https://schier.info/papers.html

Images

Bibtex

@ARTICLE{SCHIER2018140,
    author = {Schier, Alexander and Hartmann, Stefan and Klein, Reinhard},
     pages = {140--155},
     title = {Fast texture mapping for triangle soups using electrostatic monopole field lines},
   journal = {Computers {\&} Graphics},
    volume = {77},
      year = {2018},
  keywords = {parameterization, Point Correspondences, Seamless Mapping, Texturing, Triangle Soups},
  abstract = {We present an efficient approach for the parameterization of triangle soups. Our technique tackles
              the problem by first approximating the triangle soup by a watertight 2-manifold offset mesh proxy.
              By establishing point correspondences between the triangle soup and the shape proxy by tracing
              electrostatic field lines in time O(kn) instead of O(kn^2), we can transfer properties computed on
              the surface, such as UV-coordinates even for large input meshes. The technique can process large
              triangle soups by replacing the computational intensive physical calculations by approximations
              developed initially for large-scale physical simulations. Thus, it is possible to decrease the time
              complexity of the initial charge distribution algorithm from O(n^3) to O(n). We demonstrate our
              method on a multitude of challenging triangle soups and focus on the transfer of UV-coordinates
              during our experiments. An intensive run-time analysis and a comparison of our results to state of
              the art techniques in standard modeling tools concludes our study.},
      issn = {0097-8493},
       url = {https://authors.elsevier.com/a/1XycnMFvHszzt},
       doi = {https://doi.org/10.1016/j.cag.2018.09.020}
}