Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal succinct representations of planar maps
 

Summary: Optimal succinct representations
of planar maps
Luca Castelli Aleardi
(joint work with Olivier Devillers and Gilles Schaeffer)
6th june 2006, SoCG 2006
Projet Geometrica LIX
INRIA Sophia-Antipolis Ecole Polytechnique
Optimal succinct representations of planar maps ­ p.1/34
Succinct and compact representations
Given a class Cm of objects of size m, the goal is to design a
space efficient data structure such that:
ˇ queries on objects are answered in constant time;
ˇ the encoding is succinct: the cost of an object R Cm
matches asymptotically the entropy of the class
size(R) = log2 Cm (1 + o(1))
ˇ or compact: we content of a cost
size(R) = O( Cm )
ˇ for dynamic data structures: updates are supported in
O(lgc
m) amortized time

  

Source: Aleardi, Luca Castelli - Département d'Informatique, Université Libre de Bruxelles

 

Collections: Computer Technologies and Information Sciences