Hunter, Andrew and Willis, P. J. (1989) Breadth-first quad encoding for networked picture browsing. Computers and Graphics, 13 (4). pp. 419-432. ISSN 0097-8493

Full text not available from this repository. (Request a copy)

Abstract

Breadth-first quad encoding is shown to be a good method of picture representation for networked browsing of colour raster pictures. The twin requirements of partial transmission and compression are discussed. Efficient algorithms for the display of sub-areas of a picture, at varying resolution, are developed; suggestions are made for further generalisation. Particular attention is paid to tesseral addressing, and the way that it can be exploited to produce efficient traversal and display algorithms. A sample non-recursive algorithm is included. The problem of quad-encoding arbitrarily dimensioned pictures is addressed.

Item Type:	Article
Additional Information:	Breadth-first quad encoding is shown to be a good method of picture representation for networked browsing of colour raster pictures. The twin requirements of partial transmission and compression are discussed. Efficient algorithms for the display of sub-areas of a picture, at varying resolution, are developed; suggestions are made for further generalisation. Particular attention is paid to tesseral addressing, and the way that it can be exploited to produce efficient traversal and display algorithms. A sample non-recursive algorithm is included. The problem of quad-encoding arbitrarily dimensioned pictures is addressed.
Keywords:	quad encoding, colour raster pictures, efficient algorithms, breadth-first quad encoding
Subjects:	G Mathematical and Computer Sciences > G400 Computer Science
Divisions:	College of Sciences > Faculty of Science > Lincoln School of Computer Science
Depositing User:	Rosaline Smith
Date Deposited:	14 Jul 2010 13:03
Last Modified:	18 Jul 2011 16:27
URI:	http://eprints.lincoln.ac.uk/id/eprint/2787

Actions (login required)

View Item