Skip to main content

2012 | OriginalPaper | Buchkapitel

17. Volumetric Methods for Surface Reconstruction and Manipulation

verfasst von : Jakob Andreas Bærentzen, Jens Gravesen, François Anton, Henrik Aanæs

Erschienen in: Guide to Computational Geometry Processing

Verlag: Springer London

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The RBF method (introduced in the previous chapter) involves solving a dense linear system. For huge numbers of points, this becomes too computationally demanding. Like the RBF method, volumetric methods for reconstruction produce an implicit representation of the reconstructed surface, but instead of solving a linear system, these methods proceed by solving a partial differential equation discretized on a 3D grid. Volumetric reconstruction algorithms become rather simple: essentially it boils down to repeatedly smoothing data on a 3D grid while keeping the values at some grid points constant. Having discussed the basic approach, we also explain how normals for point data can be estimated, since point normal estimates are generally required for volumetric reconstruction.
This chapter also covers the Level Set Method which, again, is based on the implicit representation of 3D surface using discrete 3D grids. However the LSM allows us to deform a surface. Distance fields are typically used as the input to the LSM and they have numerous other uses, so this chapter also covers the construction of 3D distance fields from triangle meshes.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

Fußnoten
1
We say ‘similar’ because the blurring is done a bit differently, but the principle is the same.
 
2
Using MeshLab’s implementation: http://​meshlab.​sourceforge.​net/​.
 
3
For simplicity and without loss of generality, we will assume in the following that unit time step is used and that the grid spacing is unit.
 
Literatur
1.
Zurück zum Zitat Davis, J., Marschner, S., Garr, M., Levoy, M.: Filling holes in complex surfaces using volumetric diffusion. In: First International Symposium on 3D Data Processing Visualization and Transmission, 2002. Proceedings, pp. 428–861 (2002) CrossRef Davis, J., Marschner, S., Garr, M., Levoy, M.: Filling holes in complex surfaces using volumetric diffusion. In: First International Symposium on 3D Data Processing Visualization and Transmission, 2002. Proceedings, pp. 428–861 (2002) CrossRef
3.
Zurück zum Zitat Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W.: Surface reconstruction from unorganized points. Comput. Graph. 26(2), 71–78 (1992) CrossRef Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., Stuetzle, W.: Surface reconstruction from unorganized points. Comput. Graph. 26(2), 71–78 (1992) CrossRef
4.
Zurück zum Zitat Alliez, P., Cohen-Steiner, D., Tong, Y., Desbrun, M.: Voronoi-based variational reconstruction of unoriented point sets. In: Proceedings of the Fifth Eurographics Symposium on Geometry Processing, pp. 39–48 (2007). Eurographics Association Alliez, P., Cohen-Steiner, D., Tong, Y., Desbrun, M.: Voronoi-based variational reconstruction of unoriented point sets. In: Proceedings of the Fifth Eurographics Symposium on Geometry Processing, pp. 39–48 (2007). Eurographics Association
5.
Zurück zum Zitat Paulsen, R.R., Baerentzen, J.A., Larsen, R.: Markov random field surface reconstruction. In: IEEE Transactions on Visualization and Computer Graphics, pp. 636–646 (2009) Paulsen, R.R., Baerentzen, J.A., Larsen, R.: Markov random field surface reconstruction. In: IEEE Transactions on Visualization and Computer Graphics, pp. 636–646 (2009)
6.
Zurück zum Zitat Kazhdan, M., Bolitho, M., Hoppe, H.: Poisson surface reconstruction. In: Proceedings of the Fourth Eurographics Symposium on Geometry Processing, pp. 61–70 (2006). Eurographics Association Kazhdan, M., Bolitho, M., Hoppe, H.: Poisson surface reconstruction. In: Proceedings of the Fourth Eurographics Symposium on Geometry Processing, pp. 61–70 (2006). Eurographics Association
7.
Zurück zum Zitat Sethian, J.A.: Level Set Methods and Fast Marching Methods, 2nd edn. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge (1999) MATH Sethian, J.A.: Level Set Methods and Fast Marching Methods, 2nd edn. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge (1999) MATH
8.
9.
Zurück zum Zitat Osher, S., Paragios, N. (eds.): Geometric Level Set Methods in Imaging, Vision, and Graphics. Springer, Berlin (2003) MATH Osher, S., Paragios, N. (eds.): Geometric Level Set Methods in Imaging, Vision, and Graphics. Springer, Berlin (2003) MATH
10.
Zurück zum Zitat Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. USA 93(4), 1591–1595 (1996) MathSciNetMATHCrossRef Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. USA 93(4), 1591–1595 (1996) MathSciNetMATHCrossRef
12.
Zurück zum Zitat Jones, M., Bærentzen, A., Sramek, M.: 3D distance fields: a survey of techniques and applications. Trans. Vis. Comput. Graph. 12(4), 581–599 (2006) CrossRef Jones, M., Bærentzen, A., Sramek, M.: 3D distance fields: a survey of techniques and applications. Trans. Vis. Comput. Graph. 12(4), 581–599 (2006) CrossRef
13.
Zurück zum Zitat Peng, D., Merriman, B., Osher, S., Zhao, H., Kang, M.: A PDE-based fast local level set method. J. Comput. Phys. 155(2), 410–438 (1999) MathSciNetMATHCrossRef Peng, D., Merriman, B., Osher, S., Zhao, H., Kang, M.: A PDE-based fast local level set method. J. Comput. Phys. 155(2), 410–438 (1999) MathSciNetMATHCrossRef
14.
Zurück zum Zitat Sussman, M., Smereka, P., Osher, S.: A level set approach for computing solutions to incompressible two-phase flow. J. Comput. Phys. 114(1), 146–159 (1994) MATHCrossRef Sussman, M., Smereka, P., Osher, S.: A level set approach for computing solutions to incompressible two-phase flow. J. Comput. Phys. 114(1), 146–159 (1994) MATHCrossRef
16.
Zurück zum Zitat Bærentzen, J.A., Christensen, N.J.: Interactive modelling of shapes using the level-set method. Int. J. Shape Model. 8(2), 79–97 (2002) MATHCrossRef Bærentzen, J.A., Christensen, N.J.: Interactive modelling of shapes using the level-set method. Int. J. Shape Model. 8(2), 79–97 (2002) MATHCrossRef
17.
Zurück zum Zitat Mauch, S.: A fast algorithm for computing the closest point and distance transform. Technical report caltechASCI/2000.077, Applied and Computational Mathematics, California Institute of Technology (2000) Mauch, S.: A fast algorithm for computing the closest point and distance transform. Technical report caltechASCI/2000.077, Applied and Computational Mathematics, California Institute of Technology (2000)
18.
Zurück zum Zitat Erleben, K., Dohlmann, H.: Signed distance fields using single-pass GPU scan conversion of tetrahedra. In: Nguyen, H. (ed.) GPU Gems 3, pp. 741–763. Addison–Wesley, Upper Saddle River (2008) Erleben, K., Dohlmann, H.: Signed distance fields using single-pass GPU scan conversion of tetrahedra. In: Nguyen, H. (ed.) GPU Gems 3, pp. 741–763. Addison–Wesley, Upper Saddle River (2008)
19.
Zurück zum Zitat Bærentzen, J., Aanæs, H.: Signed distance computation using the angle weighted pseudo-normal. IEEE Trans. Vis. Comput. Graph. 11(3), 243–253 (2005) CrossRef Bærentzen, J., Aanæs, H.: Signed distance computation using the angle weighted pseudo-normal. IEEE Trans. Vis. Comput. Graph. 11(3), 243–253 (2005) CrossRef
20.
Zurück zum Zitat Guéziec, A.: Meshsweeper: Dynamic point-to-polygonal mesh distance and applications. IEEE Trans. Vis. Comput. Graph. 7(1), 47–60 (2001) CrossRef Guéziec, A.: Meshsweeper: Dynamic point-to-polygonal mesh distance and applications. IEEE Trans. Vis. Comput. Graph. 7(1), 47–60 (2001) CrossRef
Metadaten
Titel
Volumetric Methods for Surface Reconstruction and Manipulation
verfasst von
Jakob Andreas Bærentzen
Jens Gravesen
François Anton
Henrik Aanæs
Copyright-Jahr
2012
Verlag
Springer London
DOI
https://doi.org/10.1007/978-1-4471-4075-7_17

Premium Partner