On the public citation graph

Dynamic multi-dimensional data structures based on quad- and k—d trees

0 signed · 83 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00288933openalex-snapshot
Quad trees a data structure for retrieval on composite keys
inferredcites →https://doi.org/10.1007/bf02241781openalex-snapshot
Two general methods for dynamizing decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(75)90034-4openalex-snapshot
Analysis of range searches in quad trees
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1109/sfcs.1978.1openalex-snapshot
A data structure for orthogonal range queries
inferredcites →https://doi.org/10.1109/tse.1979.234200openalex-snapshot
Multidimensional Binary Search Trees in Database Applications
inferredcites →https://doi.org/10.1145/359038.359043openalex-snapshot
Deletion in two-dimensional quad trees
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/0470091355.ecm014openalex-snapshot
Computational Visualization
inferred← citeshttps://doi.org/10.1006/inco.1999.2811openalex-snapshot
Efficient Splitting and Merging Algorithms for Order Decomposable Problems
inferred← citeshttps://doi.org/10.1006/jagm.1998.0967openalex-snapshot
General Balanced Trees
inferred← citeshttps://doi.org/10.1006/jagm.2000.1135openalex-snapshot
Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_48openalex-snapshot
Sampling algorithms for differential batch retrieval problems (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_17openalex-snapshot
K-D Trees Are Better when Cut on the Longest Side
inferred← citeshttps://doi.org/10.1007/3-540-49257-7_17openalex-snapshot
Optimal Dynamic Range Searching inNon-replicating Index Structures
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_22openalex-snapshot
Randomized K-Dimensional Binary Search Trees
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_33openalex-snapshot
Improving partial rebuilding by using simple balance criteria
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_42openalex-snapshot
Updating almost complete trees or one level makes all the difference
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_61openalex-snapshot
Self-adjusting augmented search trees
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_215openalex-snapshot
Efficient splitting and merging algorithms for order decomposable problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-1881-1_20openalex-snapshot
Space Partitioning and Its Application to Generalized Retrieval Problems
inferred← citeshttps://doi.org/10.1007/978-1-84882-985-5_27openalex-snapshot
Motion Planning for Highly Constrained Spaces
inferred← citeshttps://doi.org/10.1007/978-3-319-08404-6_4openalex-snapshot
Amortized Analysis of Smooth Quadtrees in All Dimensions
inferred← citeshttps://doi.org/10.1007/978-3-319-11662-4_2openalex-snapshot
Cellular Tree Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-319-71237-6_13openalex-snapshot
Verified Root-Balanced Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-70664-9_5openalex-snapshot
Metadata Management in a Multiversion Data Warehouse
inferred← citeshttps://doi.org/10.1007/978-3-642-17641-8_32openalex-snapshot
Hierarchical Data Structures for Accessing Spatial Data
inferred← citeshttps://doi.org/10.1007/978-3-642-28942-2_62openalex-snapshot
SpaGRID: A Spatial Grid Framework for High Dimensional Medical Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-46473-7_12openalex-snapshot
Quad Trees, a Datastructure for Discrete Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_64openalex-snapshot
Quad-K-d Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-61340-1_4openalex-snapshot
Computational Geometry and its Application to Computer Graphics
inferred← citeshttps://doi.org/10.1007/978-3-642-71071-1_11openalex-snapshot
Bibliography on quadtrees and related hierarchical data structures
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_1openalex-snapshot
Geometric data structures for computer graphics: an overview
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_3openalex-snapshot
Geometrische Datenstrukturen
inferred← citeshttps://doi.org/10.1007/bf01759075openalex-snapshot
Dividedk-d trees
inferred← citeshttps://doi.org/10.1007/bfb0029010openalex-snapshot
Concatenable segment trees
inferred← citeshttps://doi.org/10.1007/s11280-018-0560-7openalex-snapshot
Direction-based vacancy queries in camera sensor networks
inferred← citeshttps://doi.org/10.1016/0020-0255(87)90010-7openalex-snapshot
Data analysis using a geometrical representation of predicate calculus
inferred← citeshttps://doi.org/10.1016/0167-9260(89)90021-7openalex-snapshot
Bisection trees and half-quad trees: Memory and time efficient data structures for VLSI layout editors
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90036-2openalex-snapshot
The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.02.001openalex-snapshot
Amortized analysis of smooth quadtrees in all dimensions
inferred← citeshttps://doi.org/10.1016/j.simpat.2018.09.002openalex-snapshot
Distributed MASON: A scalable distributed multi-agent simulation environment
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.030openalex-snapshot
Quad-kd trees: A general framework for kd trees and quad trees
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00128-8openalex-snapshot
Efficient dynamic range searching using data replication
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60257-0openalex-snapshot
Multidimensional Data Structures: Review and Outlook
inferred← citeshttps://doi.org/10.1016/s0736-5853(89)80023-1openalex-snapshot
An intelligent user interface for browsing satellite data catalogs
inferred← citeshttps://doi.org/10.1016/s0895-6111(96)00014-6openalex-snapshot
Medical image collection indexing: Shape-based retrieval using KD-trees
inferred← citeshttps://doi.org/10.1051/ita/1994280504311openalex-snapshot
Updating approximately complete trees
inferred← citeshttps://doi.org/10.1080/00207169108803956openalex-snapshot
Maintaining α-balanced trees by partial rebuilding
inferred← citeshttps://doi.org/10.1080/136588197242446openalex-snapshot
The SB+ -tree: an efficient index structure for joining spatial relations
inferred← citeshttps://doi.org/10.1109/5.286197openalex-snapshot
Improved techniques for single-pass adaptive vector quantization
inferred← citeshttps://doi.org/10.1109/cmpsac.1996.544176openalex-snapshot
A dynamic indexing structure for searching time-series patterns
inferred← citeshttps://doi.org/10.1109/icde.2004.1319982openalex-snapshot
Bulk operations for space-partitioning trees
inferred← citeshttps://doi.org/10.1109/icdew.2008.4498348openalex-snapshot
Similarity searching: Towards bulk-loading peer-to-peer networks
inferred← citeshttps://doi.org/10.1109/ideas.1997.625693openalex-snapshot
Efficient processing of spatial selection and join operations using SB/sup +/-tree
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.87openalex-snapshot
Work Partitioning on Parallel and Distributed Agent-Based Simulation
inferred← citeshttps://doi.org/10.1109/robot.2002.1013429openalex-snapshot
Efficient nearest neighbor searching for motion planning
inferred← citeshttps://doi.org/10.1109/sisap.2008.9openalex-snapshot
Similarity Searching: Towards Bulk-Loading Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/tro.2006.886840openalex-snapshot
Improving Motion-Planning Algorithms by Efficient Nearest-Neighbor Searching
inferred← citeshttps://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferred← citeshttps://doi.org/10.1137/060678609openalex-snapshot
Random Hyperplane Search Trees
inferred← citeshttps://doi.org/10.1137/s0097539703436722openalex-snapshot
Fully Dynamic Orthogonal Range Reporting on RAM
inferred← citeshttps://doi.org/10.1145/101306.101308openalex-snapshot
A compendium of key search references
inferred← citeshttps://doi.org/10.1145/282957.282966openalex-snapshot
Storing a collection of polygons using quadtrees
inferred← citeshttps://doi.org/10.1145/318898.318925openalex-snapshot
Multikey retrieval from K-d trees and QUAD-trees
inferred← citeshttps://doi.org/10.1145/356924.356930openalex-snapshot
The Quadtree and Related Hierarchical Data Structures
inferred← citeshttps://doi.org/10.1145/6012.6015openalex-snapshot
Balanced multidimensional extendible hash tree
inferred← citeshttps://doi.org/10.1145/602259.602281openalex-snapshot
Efficient processing of relational calculus expressions using range query theory
inferred← citeshttps://doi.org/10.1145/971697.602281openalex-snapshot
Efficient processing of relational calculus expressions using range query theory
inferred← citeshttps://doi.org/10.1145/971699.318925openalex-snapshot
Multikey retrieval from K-d trees and QUAD-trees
inferred← citeshttps://doi.org/10.1201/9781420050349.pt2openalex-snapshot
Data Structures for Unstructured Mesh Generation
inferred← citeshttps://doi.org/10.1214/13-ejs829openalex-snapshot
Cellular tree classifiers
inferred← citeshttps://doi.org/10.1287/ijoc.2017.0783openalex-snapshot
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
inferred← citeshttps://doi.org/10.2312/sm.20041411openalex-snapshot
Compression, Segmentation, and Modeling of Filamentary Volumetric Data
inferred← citeshttps://doi.org/10.2478/s11532-006-0049-6openalex-snapshot
Studies of dehydration kinetics of Li2SO4·H2O by the master plots method
inferred← citeshttps://doi.org/10.4018/978-1-4666-8465-2.ch010openalex-snapshot
SPAM
inferred← citeshttps://doi.org/10.4018/978-1-5225-5191-1.ch058openalex-snapshot
SPAM
inferred← citeshttps://doi.org/10.47749/t/unicamp.1994.78800openalex-snapshot
Busca em subespaços em varias dimensões
inferred← citeshttps://doi.org/10.48550/arxiv.1709.00247openalex-snapshot
A Simple Balanced Search Tree with No Balance Criterion
inferred← citeshttps://doi.org/10.5555/2694443.2694449openalex-snapshot
Spatio-temporal indexing: current scenario, challenges and approaches
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93958openalex-snapshot
Design and Analysis of Multidimensional Data Structures
inferred← citeshttps://doi.org/10.70675/77065cf1z5dfez4893za8d0z60a7ca9e6362openalex-snapshot
Inpainting de modèles 3D pour la réalité diminuée : "couper/coller" réaliste pour l'aménagement d'intérieur
inferred← citeshttps://doi.org/10.82308/1812openalex-snapshot
Guarding problems and geometric split trees
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.