|
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
|
|
168
|
Embedding planar graphs on the grid
– W Schnyder
- 1990
|
|
116
|
Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs
– J. Ian Munro, Venkatesh Raman, J. Ian, Munro Venkatesh Raman
- 1999
|
|
233
|
Edgebreaker: Connectivity compression for triangle meshes
– Jarek Rossignac
- 1999
|
|
136
|
Space-efficient static trees and graphs
– Guy Jacobson
- 1989
|
|
69
|
On the succinct representation of graphs
– G Turán
- 1984
|
|
39
|
Short Encodings of Planar Graphs and Maps
– Kenneth Keeler, Jeffery Westbrook
- 1993
|
|
29
|
Compact Routing Tables for Graphs of Bounded Genus
– Cyril Gavoille, Nicolas Hanusse
- 2000
|
|
96
|
A census of planar triangulation
– W T Tutte
- 1962
|
|
45
|
Near-Optimal Connectivity Encoding of 2-Manifold Polygon Meshes
– Andrei Khodakovsky, Pierre Alliez, Mathieu Desbrun, Peter Schröder
- 2002
|
|
56
|
How to draw a planar graph on a grid. Combinatorica 10(1):41–51
– H de Fraysseix, J Pach, R Pollack
- 1990
|
|
25
|
Drawing planar graphs using the canonical ordering. Algorithmica 16(1):4–32
– G Kant
- 1996
|
|
21
|
A Fast General Methodology For Information-Theoretically Optimal Encodings Of Graphs
– Xin He, Ming-yang Kao, Hsueh-I Lu
- 1999
|
|
18
|
Dissections and trees, with applications to optimal mesh encoding and . . .
– Éric Fusy, Dominique Poulalhon, Gilles Schaeffer
|
|
35
|
Optimal Coding and Sampling of Triangulations
– Dominique Poulalhon, Gilles Schaeffer
- 2003
|
|
44
|
Planar graphs and poset dimension
– W Schnyder
- 1989
|
|
10
|
2-visibility drawings of planar graphs
– U Fomeier, G Kant, M Kaufmann
|
|
54
|
Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
– G Kant, X He
- 1997
|
|
27
|
On triangle contact graphs
– H de Fraysseix, P O de Mendez, P Rosenstiehl
- 1994
|
