An optimal boundary to quadtree conversion algorithm
From MaRDI portal
Publication:3136135
DOI10.1016/1049-9660(91)90018-KzbMATH Open0774.68128OpenAlexW2023420853MaRDI QIDQ3136135FDOQ3136135
Authors: Mark R. Lattanzi, Clifford A. Shaffer
Publication date: 26 September 1993
Published in: CVGIP: Image Understanding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/1049-9660(91)90018-k
Recommendations
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computing methodologies for image processing (68U10)
Cited In (12)
- An efficient algorithm for the Fourier transform on a compressed image in restricted quadtree and shading format.
- Variant code transformations for linear quadtrees
- Neighbor finding techniques for images represented by quadtrees
- Efficient Algorithms for Overlapping a Sequence of Images
- Analysis of the worst case space complexity of a PR quadtree
- An adaptive algorithm for conversion from quadtree to chain codes
- The Use of Linear Quadtrees in a Numerical Problem
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear quadtrees: A blocking technique for contour filling
- Comments on Detection of connectivity for regions represented by linear quadtrees
This page was built for publication: An optimal boundary to quadtree conversion algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136135)