Selective decompression of vector maps

Authors:
Raquel Viaña
Affiliations:
University of Alcala
Venue:
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Year:
2007

Citing 9
Cited 0

Succinct representation of general unlabeled graphs

Discrete Applied Mathematics
Short encodings of planar graphs and maps

Discrete Applied Mathematics
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

SIAM Journal on Computing
Progressive Transmission of Vector Map Data over the World Wide Web

Geoinformatica
Edgebreaker: Connectivity Compression for Triangle Meshes

IEEE Transactions on Visualization and Computer Graphics
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Succinct representation of balanced parentheses, static trees and planar graphs

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Early-split coding of triangle mesh connectivity

GI '06 Proceedings of Graphics Interface 2006
Optimal coding and sampling of triangulations

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Large 2D vector maps require huge storage space when they are represented by topological data structures of type DCEL. The drawback of more compact representations is the lack of efficiency for navigating through the map. In this paper, an algorithm is given for traveling around any vertex v on a compressed vector map in time linear in the degree of v.