The Use of Linear Quadtrees in a Numerical Problem

DOI10.1137/0720086MaRDI QIDQ3314837zbMATH OpenOpenAlexFDO

Authors Irene Gargantini

Publication date 1983

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0720086

zbMATH Keywords

pattern recognitionlinear quadtreespolynomial solverspolynomial zero-finderquadrants' subdivisions and groupingstwo-dimensional binary images

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms for approximation of functions (65D15) Numerical computation of solutions to single equations (65H05)

Recommendations

• Coding of geometric configurations using quadtrees
• An optimal boundary to quadtree conversion algorithm
• On the size of quadtrees generalized to d-dimensional binary pictures
• The space efficiency of quadtrees
• Linear-time border-tracing algorithms for quadtrees

Cited in

(7)

• scientific article; zbMATH DE number 3907790 (Why is no real title available?)
• Finding neighbors of equal size in linear quadtrees and octrees in constant time
• Quadtrees as an abstract domain
• Determination of the 3D border by repeated elimination of internal surfaces
• Linear quadtrees: A blocking technique for contour filling
• Comments on Detection of connectivity for regions represented by linear quadtrees
• Planar decomposition for quadtree data structure

This page was built for publication: The Use of Linear Quadtrees in a Numerical Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3314837)