Skip to main content
Top

2021 | OriginalPaper | Chapter

Towards Understanding Time Varying Triangle Meshes

Authors : Jan Dvořák, Petr Vaněček, Libor Váša

Published in: Computational Science – ICCS 2021

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Time varying meshes are more popular than ever as a representation of deforming shapes, in particular for their versatility and inherent ability to capture both true and spurious topology changes. In contrast with dynamic meshes, however, they do not capture the temporal correspondence, which (among other problems) leads to very high storage and processing costs. Unfortunately, establishing temporal correspondence of surfaces is difficult, because it is generally not bijective: even when the full visible surface is captured in each frame, some parts of the surface may be missing in some frames due to self-contact. We observe that, in contrast with the inherent absence of bijectivity in surface correspondence, volume correspondence is bijective in a wide class of possible input data. We demonstrate that using a proper intitialization and objective function, it is possible to track the volume, even when considering only a pair of subsequent frames at the time. Currently, the process is rather slow, but the results are promising and may lead to a new level of understanding and new algorithms for processing of time varying meshes, including compression, editing, texturing and others.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Belkin, M., Sun, J., Wang, Y.: Discrete Laplace operator on meshed surfaces. In: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, SCG 2008. Association for Computing Machinery, New York (2008) Belkin, M., Sun, J., Wang, Y.: Discrete Laplace operator on meshed surfaces. In: Proceedings of the Twenty-Fourth Annual Symposium on Computational Geometry, SCG 2008. Association for Computing Machinery, New York (2008)
2.
go back to reference Bojsen-Hansen, M., Li, H., Wojtan, C.: Tracking surfaces with evolving topology. ACM Trans. Graph. 31(4), 53-1 (2012) Bojsen-Hansen, M., Li, H., Wojtan, C.: Tracking surfaces with evolving topology. ACM Trans. Graph. 31(4), 53-1 (2012)
3.
go back to reference Celebi, M.E., Kingravi, H.A., Vela, P.A.: A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst. Appl. 40(1), 200–210 (2013)CrossRef Celebi, M.E., Kingravi, H.A., Vela, P.A.: A comparative study of efficient initialization methods for the k-means clustering algorithm. Expert Syst. Appl. 40(1), 200–210 (2013)CrossRef
4.
go back to reference Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 26, pp. 2292–2300. Curran Associates, Inc. (2013) Cuturi, M.: Sinkhorn distances: lightspeed computation of optimal transport. In: Burges, C.J.C., Bottou, L., Welling, M., Ghahramani, Z., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol. 26, pp. 2292–2300. Curran Associates, Inc. (2013)
10.
13.
go back to reference Jacobson, A., Kavan, L., Sorkine, O.: Robust inside-outside segmentation using generalized winding numbers. ACM Trans. Graph. 32(4), 1–12 (2013)CrossRef Jacobson, A., Kavan, L., Sorkine, O.: Robust inside-outside segmentation using generalized winding numbers. ACM Trans. Graph. 32(4), 1–12 (2013)CrossRef
18.
go back to reference Li, H., Sumner, R.W., Pauly, M.: Global correspondence optimization for non-rigid registration of depth scans. In: Computer Graphics Forum, vol. 27, pp. 1421–1430. Wiley Online Library (2008) Li, H., Sumner, R.W., Pauly, M.: Global correspondence optimization for non-rigid registration of depth scans. In: Computer Graphics Forum, vol. 27, pp. 1421–1430. Wiley Online Library (2008)
22.
go back to reference Myronenko, A., Song, X.: Point set registration: coherent point drift. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2262–2275 (2010)CrossRef Myronenko, A., Song, X.: Point set registration: coherent point drift. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2262–2275 (2010)CrossRef
23.
go back to reference Myronenko, A., Song, X., Carreira-Perpinán, M.A.: Non-rigid point set registration: coherent point drift. In: Advances in Neural Information Processing Systems, pp. 1009–1016 (2007) Myronenko, A., Song, X., Carreira-Perpinán, M.A.: Non-rigid point set registration: coherent point drift. In: Advances in Neural Information Processing Systems, pp. 1009–1016 (2007)
27.
go back to reference Váša, L., Skala, V.: CODDYAC: connectivity driven dynamic mesh compression. In: 3DTV Conference Proceedings (2007) Váša, L., Skala, V.: CODDYAC: connectivity driven dynamic mesh compression. In: 3DTV Conference Proceedings (2007)
28.
go back to reference Vlasic, D., Baran, I., Matusik, W., Popović, J.: Articulated mesh animation from multi-view silhouettes. ACM Trans. Graph. 27(3), 1–9 (2008)CrossRef Vlasic, D., Baran, I., Matusik, W., Popović, J.: Articulated mesh animation from multi-view silhouettes. ACM Trans. Graph. 27(3), 1–9 (2008)CrossRef
Metadata
Title
Towards Understanding Time Varying Triangle Meshes
Authors
Jan Dvořák
Petr Vaněček
Libor Váša
Copyright Year
2021
DOI
https://doi.org/10.1007/978-3-030-77977-1_4

Premium Partner