Fiedler trees for multiscale surface analysis

Matt Berger, Luis Gustavo Nonato, Valerio Pascucci, Cludio T. Silva

Research output: Contribution to journalArticle

Abstract

In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the LaplaceBeltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales.

Original languageEnglish (US)
Pages (from-to)272-281
Number of pages10
JournalComputers and Graphics (Pergamon)
Volume34
Issue number3
DOIs
StatePublished - Jun 2010

Fingerprint

Surface analysis
Decomposition
Eigenvalues and eigenfunctions

Keywords

  • Multiresolution shape analysis
  • Multiscale representation
  • Surface partition

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Human-Computer Interaction
  • Engineering(all)

Cite this

Fiedler trees for multiscale surface analysis. / Berger, Matt; Gustavo Nonato, Luis; Pascucci, Valerio; Silva, Cludio T.

In: Computers and Graphics (Pergamon), Vol. 34, No. 3, 06.2010, p. 272-281.

Research output: Contribution to journalArticle

Berger, Matt ; Gustavo Nonato, Luis ; Pascucci, Valerio ; Silva, Cludio T. / Fiedler trees for multiscale surface analysis. In: Computers and Graphics (Pergamon). 2010 ; Vol. 34, No. 3. pp. 272-281.
@article{daf8d8a9408b4d8a91ca24d53c83ff09,
title = "Fiedler trees for multiscale surface analysis",
abstract = "In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the LaplaceBeltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales.",
keywords = "Multiresolution shape analysis, Multiscale representation, Surface partition",
author = "Matt Berger and {Gustavo Nonato}, Luis and Valerio Pascucci and Silva, {Cludio T.}",
year = "2010",
month = "6",
doi = "10.1016/j.cag.2010.03.009",
language = "English (US)",
volume = "34",
pages = "272--281",
journal = "Computers and Graphics",
issn = "0097-8493",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - Fiedler trees for multiscale surface analysis

AU - Berger, Matt

AU - Gustavo Nonato, Luis

AU - Pascucci, Valerio

AU - Silva, Cludio T.

PY - 2010/6

Y1 - 2010/6

N2 - In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the LaplaceBeltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales.

AB - In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the LaplaceBeltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales.

KW - Multiresolution shape analysis

KW - Multiscale representation

KW - Surface partition

UR - http://www.scopus.com/inward/record.url?scp=77955268715&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955268715&partnerID=8YFLogxK

U2 - 10.1016/j.cag.2010.03.009

DO - 10.1016/j.cag.2010.03.009

M3 - Article

VL - 34

SP - 272

EP - 281

JO - Computers and Graphics

JF - Computers and Graphics

SN - 0097-8493

IS - 3

ER -