Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

43

SMI
2003
IEEE

favoriteEmaildiscussreport

188views Image Analysis» more SMI 2003»

On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing

14 years 4 months ago

On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing

Download www.cs.technion.ac.il

Partitioning is a fundamental operation on graphs. In this paper we briefly review the basic concepts of graph partitioning and its relationship to digital mesh processing. We also elaborate on the connection between graph partitioning and spectral graph theory. Applications in computer graphics are described.

Craig Gotsman

Real-time Traffic

Digital Mesh Processing | Graph Partitioning | SMI 2003 | Spectral Graph Theory |

claim paper

Related Content

» Spectral mesh processing

» Hierarchical clustering of WWW image search results using visual textual and link informat...

» Molecular shape analysis based upon the morsesmale complex and the connolly function

» High Performance ParallelDistributed Biclustering Using Barycenter Heuristic

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	SMI
Authors	Craig Gotsman

Comments (0)