-
Optimal succinct representation of planar maps
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression... -
Dynamic updates of succinct triangulations
In a recent article, we presented a succinct representation of triangulations that supports efficient navigation operations. Here this representation is improved to... -
Compact representation of triangulations
We consider the problem of representing compact geometric data structures maintaining an efficient implementation of navigation operations. For the case of planar... -
(Nearly-)tight bounds on the contiguity and linearity of cographs
International audience
