![]() | There is another version of this document. Click here to view it. |
|
PDF
License: Creative Commons: Attribution-Noncommercial 3.0 (CC BY-NC 3.0) Download (232kB) | Preview |
Abstract
Reeb graphs are combinatorial signatures that capture shape properties from the perspective of a chosen function. One of the most important questions is whether Reeb graphs are robust against function perturbations that may occur because of noise and approximation errors in the data acquisition process. In this work we tackle the problem of stability providing an editing distance between Reeb graphs of orientable surfaces in terms of the cost necessary to transform one graph into another by edit operations. Our main result is that changes in the functions, measured by the maximum norm, imply not greater changes in this distance, yielding the stability property under function perturbations.
Other metadata
Available versions of this document
- Reeb graphs of surfaces are stable under function perturbations. (deposited 21 Feb 2014 09:13) [Currently displayed]