Goel, V and Venkatesh, YV (1991) On an optimal and faster construction of linear quadtrees from raster-scanned images. In: Computer Journal, 34 (6). A073-83.Full text not available from this repository.
The paper deals with the conversion of a raster-scanned binary image to a linear quadtree (LQT). By trading in-core memory for execution time, and thereby minimising tree traversals, in contrast with the approaches found in the recent literature, a new algorithm (ALGORITHM G-V) which runs faster than all the known algorithms, and is believed to be the fastest, is presented. Moreover, the execution time is independent of the distribution of the BLACK and WHITE nodes in the image. Summary only published. Full paper available from journal editor.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Oxford University Press.|
|Keywords:||computational complexity;computational geometry;computer graphics;computerised picture processing;trees (mathematics)|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering|
|Date Deposited:||21 Aug 2007|
|Last Modified:||09 Jan 2012 07:43|
Actions (login required)