On Graph Partitioning, Spectral Analysis, and Digital Mesh Processing

Authors:
Craig Gotsman
Affiliations:
-
Venue:
SMI '03 Proceedings of the Shape Modeling International 2003
Year:
2003

Citing 0
Cited 10

On the optimality of spectral compression of mesh data

ACM Transactions on Graphics (TOG)
Mesh parameterization: theory and practice Video files associated with this course are available from the citation page

ACM SIGGRAPH 2007 courses
Geometric modeling based on polygonal meshes Video files associated with this course are available from the citation page

ACM SIGGRAPH 2007 courses
Mesh parameterization: theory and practice

ACM SIGGRAPH ASIA 2008 courses
Spectral mesh processing

ACM SIGGRAPH ASIA 2009 Courses
Spectral conformal parameterization

SGP '08 Proceedings of the Symposium on Geometry Processing
Spectral mesh processing

ACM SIGGRAPH 2010 Courses
Review: Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research
Elements of geometry processing

SIGGRAPH Asia 2011 Courses
A time series 3D hierarchy for real-time dynamic point cloud interaction

SIGGRAPH Asia 2012 Technical Briefs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partitioning is a fundamental operation on graphs. In thispaper we briefly review the basic concepts of graph partitioningand its relationship to digital mesh processing. Wealso elaborate on the connection between graph partitioningand spectral graph theory. Applications in computergraphics are described.