| | |
Summary: CCCG 2006, Kingston, Ontario, August 1416, 2006
2D Triangulation Representation Using Stable Catalogs.
Luca Castelli Aleardi
Olivier Devillers
Abdelkrim Mebarki§
Abstract
The problem of representing triangulations has been
widely studied to obtain convenient encodings and space
efficient data structures. In this paper we propose a
new practical approach to reduce the amount of space
needed to represent in main memory an arbitrary trian-
gulation, while maintaining constant time for some basic
queries. This work focuses on the connectivity informa-
tion of the triangulation, rather than the geometry in-
formation (vertex coordinates), since the combinatorial
data represents the main storage part of the structure.
The main idea is to gather triangles into patches, to re-
duce the number of pointers by eliminating the internal
pointers in the patches and reducing the multiple refer-
ences to vertices. To accomplish this, we define stable
|
