Quad trees: A data structure for retrieval by composite keys
From MaRDI portal
Publication:1394116
DOI10.1007/BF00288933zbMath0278.68030OpenAlexW2008196645WikidataQ56340270 ScholiaQ56340270MaRDI QIDQ1394116
Raphael Ari Finkel, Jon Louis Bentley
Publication date: 1974
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288933
Related Items (only showing first 100 items - show all)
Space filling curves and their use in the design of geometric data structures ⋮ Robust event-driven particle tracking in complex geometries ⋮ A custom arc‐length Finite Element solver for large deformation adhesive contacts using a k‐d tree accelerated volumetric interaction scheme ⋮ The asymptotic distribution of cluster sizes for supercritical percolation on random split trees ⋮ Robust aggregation of compositional and interval-valued data: the mode on the unit simplex ⋮ An extension to \textsc{Voro++} for multithreaded computation of Voronoi cells ⋮ Transition scale-spaces: A computational theory for the discretized entorhinal cortex ⋮ Genetic local search for multi-objective combinatorial optimization ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ Partial match queries in random quadtrees ⋮ Dynamic smooth compressed quadtrees ⋮ Limit laws for partial match queries in quadtrees ⋮ Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length ⋮ Amortized analysis of smooth quadtrees in all dimensions ⋮ The F-transform preprocessing for JPEG strong compression of high-resolution images ⋮ Direct numerical simulation of incompressible flows on parallel octree grids ⋮ Combinatorial variations on multidimensional quadtrees ⋮ A novel method for estimation of intensity and location of multiple point heat sources based on strain measurement ⋮ On the cost of fixed partial match queries in \(K\)-d trees ⋮ On the distribution of the arity of the root of a \(d\)-dimensional quadtree ⋮ Halfplanar range search in linear space and \(O(n^{0.695})\) query time ⋮ Lagrangian particle method for compressible fluid dynamics ⋮ Strong Convergence of Partial Match Queries in Random Quadtrees ⋮ A survey of content-based image retrieval with high-level semantics ⋮ Approximability of the minimum-weight \(k\)-size cycle cover problem ⋮ Fonction sommatoire de la fonction de Möbius 1. Majorations expérimentales ⋮ Fast topological-shape optimization with boundary elements in two dimensions ⋮ Range searching in multidimensional databases using navigation metadata ⋮ Study of the universal constants for the multidimensional search quadtrees ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Uncertain probabilistic range queries on multidimensional data ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ Hypergeometrics and the cost structure of quadtrees ⋮ An intelligent nonlinear meta element for elastoplastic continua: deep learning using a new time-distributed residual U-net architecture ⋮ Space-filling curves and their use in the design of geometric data structures ⋮ Making the computation of approximations of invariant measures and its attractors for IFS and GIFS, through the deterministic algorithm, tractable ⋮ A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization ⋮ Dynamic orthogonal range queries in OLAP. ⋮ A cellular automaton -- finite volume method for the simulation of dendritic and eutectic growth in binary alloys using an adaptive mesh refinement ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ HD tree: A novel data structure to support multi-dimensional range query for P2P networks ⋮ An adaptive multiresolution method on dyadic grids: Application to transport equations ⋮ Data structures in multi-objective evolutionary algorithms ⋮ Siting of HIV/AIDS diagnostic equipment in South Africa: a case study in locational analysis ⋮ A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) ⋮ Nonlocal damage modelling by the scaled boundary finite element method ⋮ Towards an adaptive POD/SVD surrogate model for aeronautic design ⋮ A parallel Voronoi-based approach for mesoscale simulations of cell aggregate electropermeabilization ⋮ APLicative Programming with Naperian Functors ⋮ Unnamed Item ⋮ Sequential local mesh refinement solver with separate temporal and spatial adaptivity for non-linear two-phase flow problems ⋮ Partial match queries in two-dimensional quadtrees: a probabilistic approach ⋮ Divided \(k-d\) trees ⋮ A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph ⋮ Approximability of the problem about a minimum-weight cycle cover of a graph ⋮ Unified 3D face and ear recognition using wavelets on geometry images ⋮ Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures ⋮ On searching and indexing sequences of temporal intervals ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ Adaptive mesh refinement with an enhanced velocity mixed finite element method on semi-structured grids using a fully coupled solver ⋮ A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths ⋮ A Voronoi interface approach to cell aggregate electropermeabilization ⋮ Tegula -- exploring a galaxy of two-dimensional periodic tilings ⋮ A cell-centred finite volume method for the Poisson problem on non-graded quadtrees with second order accurate gradients ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ The total path length of split trees ⋮ A new clustering algorithm for coordinate-free data ⋮ A theory of decomposition into prime factors of layered interconnection networks ⋮ Operating with potentials of discrete variables ⋮ On the difficulty of range searching. ⋮ The fluctuations of the giant cluster for percolation on random split trees ⋮ Approximate closest-point queries in high dimensions ⋮ Analysis of range searches in quad trees ⋮ Pyramids: A data type for matrix representation in Pascal ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Data analysis using a geometrical representation of predicate calculus ⋮ A unifying approach to picture grammars ⋮ Global path planning of mobile robots using a memetic algorithm ⋮ Non-uniform partial-match file designs ⋮ A nearly optimal multigrid method for general unstructured grids ⋮ Efficient analysis of dense fiber reinforcement using a reduced embedded formulation ⋮ A new fast hybrid adaptive grid generation technique for arbitrary two-dimensional domains ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ A comparison of two methods of encoding arrays ⋮ The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching ⋮ Associative retrieval trie hash-coding ⋮ On the internal path length ofd-dimensional quad trees ⋮ Embedding small digraphs and permutations in binary trees and split trees ⋮ Simulation of direct chill casting under the influence of a low-frequency electromagnetic field ⋮ A grid based particle method for moving interface problems ⋮ Quadtrees as an Abstract Domain ⋮ Dual‐tree fast exact max‐kernel search ⋮ InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem ⋮ A sparse graph almost as good as the complete graph on points in \(k\) dimensions ⋮ Efficient implementation of characteristic-based schemes on unstructured triangular grids ⋮ A Linear Time and Space Algorithm for Detecting Path Intersection ⋮ On the number of face-connected components of Morton-type space-filling curves ⋮ The properties of random trees ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ A Bayesian nonparametric approach to super-resolution single-molecule localization
Cites Work
This page was built for publication: Quad trees: A data structure for retrieval by composite keys
