Abstract:
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.
Keywords:triangulation, computational geometry, computer graphycs, grid construction, data structure, data packing, topological relations.
Fulltext:
PDF file (176 kB)