Graph Coding and Connectivity Compression

@inproceedings{Isenburg2005GraphCA,
  title={Graph Coding and Connectivity Compression},
  author={Martin Isenburg and Jack Snoeyink},
  year={2005}
}
This paper looks at the theoretic roots of current connectivity compression schemes to establish a visual framework within which the differences and similarities of various scheme become intuitive. We show the intimate connections between the classic work on planar graph coding by Turan and recent schemes, such as Edgebreaker, Face Fixer, and the optimal coding by method of Poulalhon and Schaefer. Furthermore we fit Touma and Gotsman’s valence coder into this classification. This helps to… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
56 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Similar Papers

Loading similar papers…