Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Multidimensional binary search trees used for associative searching
Deep Marching Cubes: Learning Explicit Surface Representations
Multiresolution volume visualization with a texture-based octree
Bounding Volume Hierarchy Analysis (Case Study)
Algorithms For Vertex Partitioning Problems On Partial k-Trees
Drawing Contour Trees in the Plane
Voxel-based offsetting at high resolution with tunable speed and precision using hybrid dynamic trees
Hierarchic Voronoi skeletons
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
Cache-oblivious R-trees
Angle-based space partitioning for efficient parallel skyline computation
Treemap: An O(log n) algorithm for indoor simultaneous localization and mapping
Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition
Skip lists: a probabilistic alternative to balanced trees
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
A practical scalable distributed B-tree
Dual Marching Cubes: Primal Contouring of Dual Grids
CD-Tree: A clustering-based dynamic indexing and retrieval approach
Dual Poisson-Disk Tiling: An Efficient Method for Distributing Features on Arbitrary Surfaces
HDIdx: High-Dimensional Indexing for Efficient Approximate Nearest Neighbor Search
Traffic Sign Recognition Using a MultiTask Convolutional Neural Network
Neural Correlates of Semantic Prediction and Resolution in Sentence Processing
Quad trees a data structure for retrieval on composite keys
Application layer protocols in multimedia networks
Spatial autocorrelation and the selection of simultaneous autoregressive models