Reeb graphs for shape analysis and applications

  • Authors:
  • S. Biasotti;D. Giorgi;M. Spagnuolo;B. Falcidieno

  • Affiliations:
  • IMATI - CNR, Via De Marini 6, Genova, Italy;IMATI - CNR, Via De Marini 6, Genova, Italy;IMATI - CNR, Via De Marini 6, Genova, Italy;IMATI - CNR, Via De Marini 6, Genova, Italy

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

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.