Set operations on linear quadtrees

DOI10.1016/0734-189X(85)90120-3zbMATH Open0622.68054OpenAlexW2033180176MaRDI QIDQ3759946FDOQ3759946

Michael A. Bauer

Publication date: 1985

Published in: Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0734-189x(85)90120-3

zbMATH Keywords

data structureefficient algorithms for image processingfunctional operations on linear quadtrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited In (7)

• Breadth-first search and its application to image processing problems
• Variant code transformations for linear quadtrees
• On the size of quadtrees generalized to d-dimensional binary pictures
• Simple and Efficient Traversal Methods for Quadtrees and Octrees
• Title not available (Why is that?)
• Finding neighbors of equal size in linear quadtrees and octrees in constant time
• Comments on Detection of connectivity for regions represented by linear quadtrees

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Quadtrees as an abstract domain 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Quad-\(K\)-d trees 👍 👎
• Combinatorial variations on multidimensional quadtrees 👍 👎
• Linear time distance transforms for quadtrees 👍 👎

This page was built for publication: Set operations on linear quadtrees

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