The Use of Linear Quadtrees in a Numerical Problem
Author:
- Irene GargantiniIGIrene Gargantini
- 1 December 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 20 (6) , 1161-1169
Abstract
Linear quadtrees have proved to be a useful structure for representing quadrants’ subdivisions and groupings in association with the encoding of two-dimensional binary images. In this paper it is shown that linear quadtrees can also be successfully applied to the memory management of the class of polynomial solvers proposed by P. Henrici [Applied and Computational Complex Analysis, Vol. 1, John Wiley, 1974], [in Constructive Aspects of the Fundamental Theorem of Algebra, Wiley-Interscience, 1969]. The problem of evaluating “the bounding box” of a connected region, given as a linear quadtree, is also considered, and an algorithmic solution presented.Keywords
This publication has 12 references indexed in Scilit:
- Linear octtrees for fast processing of three-dimensional objectsComputer Graphics and Image Processing, 1982
- An effective way to represent quadtreesCommunications of the ACM, 1982
- Distance Transform for Images Represented by QuadtreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
- Detection of connectivity for regions represented by linear quadtreesComputers & Mathematics with Applications, 1982
- Connected Component Labeling Using QuadtreesJournal of the ACM, 1981
- An Algorithm for Converting Rasters to QuadtreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1981
- Region representationCommunications of the ACM, 1980
- Region representationCommunications of the ACM, 1980
- Linear transformation of pictures represented by quad treesComputer Graphics and Image Processing, 1979
- Operations on Images Using Quad TreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979