Sciweavers

22 search results - page 1 / 5
» Succinct Representation of Triangulations with a Boundary
Sort
View
WADS
2005
Springer
69views Algorithms» more  WADS 2005»
13 years 10 months ago
Succinct Representation of Triangulations with a Boundary
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
ISAAC
2007
Springer
120views Algorithms» more  ISAAC 2007»
13 years 10 months ago
Succinct Representation of Labeled Graphs
Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs a...
Jérémy Barbay, Luca Castelli Aleardi...
COMPGEOM
2006
ACM
13 years 10 months ago
Optimal succinct representations 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 issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
TCS
2008
13 years 4 months ago
Succinct representations 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 issues, the fo...
Luca Castelli Aleardi, Olivier Devillers, Gilles S...
CCCG
2008
13 years 6 months ago
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic