Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

157

Voted

ISAAC
2010
Springer

231views Algorithms» more ISAAC 2010»

Entropy-Bounded Representation of Point Grids

15 years 19 days ago

Entropy-Bounded Representation of Point Grids

Download www.cs.uwaterloo.ca

We give the first fully compressed representation of a set of m points on an n

Arash Farzan, Travis Gagie, Gonzalo Navarro

Real-time Traffic

Algorithms | ISAAC 2010 | N×n Grid | Uncompressed Structures | Well-studied Area |

claim paper

Related Content

» Integer representations of convex polygon intersection graphs

» 3D Shape Representation Transforming Polygons into Voxels

» A SelfOrganising System for Resource Finding in LargeScale Computational Grids

» Flexible PointBased Rendering on Mobile Devices

» Compact data structure and scalable algorithms for the sparse grid technique

» A Sequent Based Logic for Coincidence Grids

» Dense Interest Points

» Point Set Surface Editing Techniques Based on LevelSets

» Signed Distance Transform Using Graphics Hardware

Post Info
More Details (n/a)

Added	13 Feb 2011
Updated	13 Feb 2011
Type	Journal
Year	2010
Where	ISAAC
Authors	Arash Farzan, Travis Gagie, Gonzalo Navarro

Comments (0)