Skip Navigation

The Computer Journal 1989 32(6):563-566; doi:10.1093/comjnl/32.6.563
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Quin, A.
Right arrow Articles by Yanagisawa, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Computer Graphics: On Data Compaction of Scanning Curves

A. Quin1 and Y. Yanagisawa2 *

1 Department of Computing Science, Paisley College of Technology, High Street. Paisley, Renfrewshire PA1 2BE
2 Department of Mathematics, Statistics and Operational Research, Trent Polytechnic, Burton Street. Nottingham NGI 4BU. England

Received 1 July 1987; revised 1 October 1987

Data compaction, or making better use of existing data storage and transmission, is one of the most important matters in computer and TV graphics. It has been suggested that different scanning techniques would improve data compaction for 2-D television images.

We prove that there is no difference in the number of run lengths found for any scanning curves for completely random pictures. Simulation is used to compare the data compaction between a discrete Peano curve and a bidirectional scanning curve for 1000 randomly placed ellipses to determine whether spatial coherence favours one scanning curve. The results are analysed statistically. Both the theory and the results of the simulation show that there is no difference between the scanning curves chosen. It is important to note that the bidirectional scanning curve is a special case of a mixed radix method.

* To whom correspondence should be addressed.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.