By Topic

A Minimal Contouring Approach to the Computation of the Reeb Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Patane, G. ; Ist. di Mat. Applicata e Tecnol. Inormatiche, Consiglio Naz. delle Ric., Genova ; Spagnuolo, M. ; Falcidieno, B.

Given a manifold surface M and a continuous scalar function f:Mrarr IR, the Reeb graph of (M, f) is a widely used high-level descriptor of M and its usefulness has been demonstrated for a variety of applications, which range from shape parameterization and abstraction to deformation and comparison. In this context, we propose a novel contouring algorithm for the construction of a discrete Reeb graph with a minimal number of nodes, which correspond to the critical points of f (i.e., minima, maxima, and saddle points) and its level sets passing through the saddle points. In this way, we do not need to sample, sweep, or increasingly sort the f-values. Since most of the computation uses only local information on the mesh connectivity, equipped with the f-values at the surface vertices, the proposed approach is insensitive to noise and requires a small-memory footprint and temporary data structures. Furthermore, we maintain the parametric nature of the Reeb graph with respect to the input scalar function and we efficiently extract the Reeb graph of time-varying maps. Indicating with n and s the number of vertices of M and saddle points of f, the overall computational cost O(sn) is competitive with respect to the O(n log n) cost of previous work. This cost becomes optimal if M is highly sampled or s les log n, as it happens for Laplacian eigenfunctions, harmonic maps, and one-forms.

Published in:

Visualization and Computer Graphics, IEEE Transactions on  (Volume:15 ,  Issue: 4 )