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 content URL: http://dx.doi.org/10.1016/0097-8493(89)90003-4
Full text not available from this repository.
| Item Type: | Article |
|---|---|
| Item Status: | Live Archive |
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.
| 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 Science > School of Computer Science |
| ID Code: | 2787 |
| Deposited On: | 14 Jul 2010 13:03 |
Repository Staff Only: item control page