-
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... -
Triangulations and quadrics
Given a set S of data points on a surface F whose equation is z = f(x,y), we would like to triangulate the convex hull of the projection of F on the xy-plane. This... -
ESQ: Editable SQuad Representation for Triangle Meshes
International audience -
Random Sampling of Large Planar Maps and Convex Polyhedra
Colloque avec actes et comité de lecture.
