Name
Abstract | ||
|---|---|---|
Extending a bijection recently introduced by Poulalhon and Schaeffer (15) for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulations and bipartite quadrangulations on an ori- entable surface of fixed topology τ (given by the genus g and number of boundaries b). To our knowledge, our encoding procedure is the first to be asymptotically op- timal (in the information theory sense) with respect to two natural parameters, the number n of inner vertices and the number k of boundary vertices. |
Year | Venue | Keywords |
|---|---|---|
2010 | CCCG | information theory |
Field | DocType | Citations |
Information theory,Discrete mathematics,Combinatorics,Bijection,Polygon mesh,Vertex (geometry),Bipartite graph,Fixed topology,Asymptotically optimal algorithm,Mathematics,Encoding (memory) | Conference | 1 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luca Castelli Aleardi | 1 | 87 | 7.96 |
| Eric Fusy | 2 | 22 | 2.40 |
| Thomas Lewiner | 3 | 700 | 43.70 |