Geodesic
Compression of triangulation topological relations
Numerical methods and programming, Tome 3 (2002) no. 1, pp. 124-132.

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem on packing topological relations of triangles of triangulation is considered. Several modifications of an algorithm for triangle shelling is proposed. On the average, these modifications allow one to achieve the packing density of order 2.12 bits per a triangulation node.
Mots-clés : triangulation, data structure
Keywords: computational geometry, computer graphycs, grid construction, data packing, topological relations. 
@article{VMP_2002_3_1_a8,
     author = {A. V. Skvortsov},
     title = {Compression of triangulation topological relations},
     journal = {Numerical methods and programming},
     pages = {124--132},
     publisher = {mathdoc},
     volume = {3},
     number = {1},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a8/}
}
TY  - JOUR
AU  - A. V. Skvortsov
TI  - Compression of triangulation topological relations
JO  - Numerical methods and programming
PY  - 2002
SP  - 124
EP  - 132
VL  - 3
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a8/
LA  - ru
ID  - VMP_2002_3_1_a8
ER  - 
%0 Journal Article
%A A. V. Skvortsov
%T Compression of triangulation topological relations
%J Numerical methods and programming
%D 2002
%P 124-132
%V 3
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a8/
%G ru
%F VMP_2002_3_1_a8
A. V. Skvortsov. Compression of triangulation topological relations. Numerical methods and programming, Tome 3 (2002) no. 1, pp. 124-132. http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a8/