Neighbor finding techniques for images represented by quadtrees

DOI10.1016/0146-664X(82)90098-3zbMath0531.68041MaRDI QIDQ3313294

Hanan Samet

Publication date: 1982

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

zbMATH Keywords

algorithmsimage processingregion representationadjacencies between neighboring nodesImage representationquadtree representation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Data structures (68P05)

Related Items (15)

Robust plotting of generalized lemniscates ⋮ Halfplanar range search in linear space and \(O(n^{0.695})\) query time ⋮ A quadtree-based path-planning algorithm for a mobile robot ⋮ Quadtree grid generation: Information handling, boundary fitting and CFD applications ⋮ An adaptive well-balanced positivity preserving central-upwind scheme on quadtree grids for shallow water equations ⋮ Reduced difference polynomials and self-intersection computations ⋮ The shallow flow equations solved on adaptive quadtree grids ⋮ An adaptive strategy based on conforming quadtree meshes for kinematic limit analysis ⋮ Gauss map computation for free-form surfaces ⋮ A mixed Lagrangian-Eulerian method for nonlinear free surface flows using multigrid on hierarchical Cartesian grids ⋮ A marching method for parametric surface/surface intersection ⋮ Quadtree-polygonal smoothed finite element method for adaptive brittle fracture problems ⋮ Novel quadtree algorithm for adaptive analysis based on cell-based smoothed finite element method ⋮ Dynamic smooth compressed quadtrees ⋮ Analysis of the worst case space complexity of a PR quadtree

This page was built for publication: Neighbor finding techniques for images represented by quadtrees