On the Optimality of Spectral Compression of Meshes

@inproceedings{BenChen2003OnTO,
  title={On the Optimality of Spectral Compression of Meshes},
  author={Mirela Ben-Chen and Craig Gotsman},
  year={2003}
}
Spectral compression of triangle meshes has shown good results in practice, but there has been little or no theoretical support for the optimality of this compression. We show that for certain classes of geometric mesh models, spectral decomposition using the eigenvectors of the symmetric Laplacian of the connectivity graph is equivalent to principal component analysis. The key component of the proof is that the Laplacian is identical, up to a constant factor, to the inverse covariance matrix… CONTINUE READING
8 Citations
15 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Gotsman, C

  • SIGGRAPH
  • 2003. On graph partitioning, spectral analysis…
  • 2003

Geometric compression through topological surgery

  • C. TOUMA, C. GOTSMAN
  • ACM Transactions on Graphics
  • 1998
2 Excerpts

Spectral graph theory

  • F. R. K. CHUNG
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…