Reeb graphs for shape analysis and applications

By Silvia Biasotti, Daniela Giorgi, Michela Spagnuolo, Bianca Falcidieno. Theoretical Computer Science, 2008

316 citations recorded by the source corpus.

Reeb graphs are compact shape descriptors which convey topological information related to the level sets of a function defined on the shape. Their definition dates back to 1946, and finds its root in Morse theory. Reeb graphs as shape descriptors have been proposed to solve different problems arising in Computer Graphics, and nowadays they play a fundamental role in the field of computational topology for shape analysis. This paper provides an overview of the mathematical properties of Reeb graphs and reconstructs its history in the Computer Graphics context, with an eye towards directions of future research.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/575cf289eb5b7fe69c5d6f69d55a5e122832dd0e

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Osamu Saeki
  2. Andrea Cerri
  3. Michael M. Bronstein
  4. Silvia Biasotti
  5. Hao Zhang
  6. A. Bronstein

In Computer Vision and Pattern Recognition

  1. Michael M. Bronstein
  2. A. Bronstein
  3. Daniel Cohen-Or
  4. Hao Zhang
  5. Luc Van Gool
  6. Leonidas J. Guibas
  7. Dacheng Tao
  8. Thomas A. Funkhouser

Citations in the corpus