|
Title:
|
VISUALIZATION OF COMPRESSED 2D-VECTOR IMAGES |
|
Author(s):
|
Raquel Viaña |
|
ISBN:
|
978-972-8924-39-3 |
|
Editors:
|
António Palma dos Reis, Katherine Blashki and Yingcai Xiao (series editors:Piet Kommers, Pedro Isaías and Nian-Shing Chen) |
|
Year:
|
2007 |
|
Edition:
|
Single |
|
Keywords:
|
Vector; map; plane graph; visualization; compression. |
|
Type:
|
Short Paper |
|
First Page:
|
103 |
|
Last Page:
|
107 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
In this paper, a technique to visualize a query portion of a compressed 2D vector image is proposed. Existing techniques
allow the compression/decompression of:
(i) combinatorics, i.e., connectivity relations;
(ii) vertices coordinates.
However, when an image has to be visualized, the geometry of the edges must be known. We will assume such geometry
is given by a set of points which will be the input of some interpolation method. Provided the whole image is to be
decompressed, the procedure is simple. But if just a part of the image has to be decoded, geometry storage is not trivial.
Let us assume the vector image is modelled by plane graph G. A class of compression techniques is based in the
definition of particular vertex spanning trees of G. The vertices of G are stored in an array according to a deterministic
traversal of the corresponding tree, and the connectivity relations are encoded as a string of symbols. We propose a
simple method that can be applied to all techniques in this class which allow the retrieval of the ordered sequence of
neighbouring vertices around any vertex of G. |
|
|
|
|
|
|
