|
69
|
On the succinct representation of graphs
– G Turán
- 1984
|
|
116
|
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs
– J. Ian Munro, Venkatesh Raman, J. Ian, Munro Venkatesh Raman
- 1999
|
|
136
|
Space-efficient static trees and graphs
– Guy Jacobson
- 1989
|
|
233
|
Edgebreaker: Connectivity compression for triangle meshes
– Jarek Rossignac
- 1999
|
|
41
|
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
– Richie Chih-nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, Hsueh-i Lu
- 1998
|
|
283
|
Universal codeword sets and representations of the integers
– P Elias
- 1975
|
|
27
|
representation of general unlabeled graphs
– Succinct M Naor
- 1990
|
|
19
|
Representation of graphs
– A Itai, M Rodeh
- 1982
|
|
18
|
Linear-time succinct encodings of planar graphs via canonical orderings
– Xin He, Ming-yang Kao, Hsueh-i Lu
- 1999
|
|
21
|
A Fast General Methodology For Information-Theoretically Optimal Encodings Of Graphs
– Xin He, Ming-yang Kao, Hsueh-I Lu
- 1999
|
|
264
|
Triangle mesh compression
– C Touma, C Gotsman
- 1998
|
|
159
|
Real Time Compression of Triangle Mesh Connectivity
– Stefan Gumhold, Wolfgang Straßer
- 1998
|
|
53
|
Guaranteed 3.67V bit encoding of planar triangle graphs
– Davis King, Jarek Rossignac
- 1999
|
|
96
|
A census of planar triangulation
– W T Tutte
- 1962
|
|
288
|
Geometry Compression
– Michael Deering
|
|
168
|
Embedding planar graphs on the grid
– W Schnyder
- 1990
|
|
13
|
Linear-Time Compression of Bounded-Genus Graphs into Information-Theoretically Optimal Number of Bits
– Hsueh-I Lu
- 2002
|
|
16
|
Tutte, A census of planar triangulations
– W T
- 1962
|
|
45
|
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
– Andrei Khodakovsky, Pierre Alliez, Mathieu Desbrun, Peter Schröder
- 2002
|
