Foundations of multidimensional and metric data structures.
From MaRDI portal
Publication:2488572
zbMath1139.68022MaRDI QIDQ2488572
Publication date: 26 May 2006
Published in: The Morgan Kaufmann Series in Data Management Systems (Search for Journal in Brave)
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68U10: Computing methodologies for image processing
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68P05: Data structures
Related Items
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time, Modeling and Manipulating Cell Complexes in Two, Three and Higher Dimensions, Unnamed Item, Efficient Compression and Indexing of Trajectories, Dimensional Inconsistency Measures and Postulates in Spatio-Temporal Databases, A Sorting Approach to Indexing Spatial Data, Proximity graphs inside large weighted graphs, Robust aggregation of compositional and interval-valued data: the mode on the unit simplex, Space-efficient representations of raster time series, Selecting Sketches for Similarity Search, Median and hybrid median \(K\)-dimensional trees, On backward smoothing algorithms, Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length, The finite cell method: a review in the context of higher-order structural analysis of CAD and image-based geometric models, An isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces, Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results, A limit process for partial match queries in random quadtrees and 2-d trees, A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure, Towards adaptive kinetic-fluid simulations of weakly ionized plasmas, Pivot selection: dimension reduction for distance-based indexing, Real-valued embeddings and sketches for fast distance and similarity estimation, A smoothed particle image reconstruction method, Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids, Voronoi grids conforming to 3D structural features, Index structures for fast similarity search for binary vectors, Index structures for fast similarity search for real vectors. II, Execution time analysis of a top-down R-tree construction algorithm, The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing, Sync/Async parallel search for the efficient design and construction of web search engines, Multiscale cell-based coarsening for discontinuous problems, Solving similarity joins and range queries in metric spaces with the list of twin clusters, New dynamic construction techniques for M-tree, Distance-based index structures for fast similarity search, A parallel computing framework for big data, Small and large deformation analysis with the \(p\)- and B-spline versions of the finite cell method, Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions, Index-based, high-dimensional, cosine threshold querying with optimality guarantees, Faster compressed quadtrees, A robust solver for elliptic PDEs in 3D complex geometries, Fast spectral analysis for approximate nearest neighbor search, Using compressed suffix-arrays for a compact representation of temporal-graphs, Modeling complex quantum dynamics: evolution of numerical algorithms in the HPC context, Concurrent linearizable nearest neighbour search in LockFree-kD-tree, Range search on tuples of points, Conic nearest neighbor queries and approximate Voronoi diagrams, An AGM-style belief revision mechanism for probabilistic spatio-temporal logics, Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions, A limit field for orthogonal range searches in two-dimensional random point search trees, A stabilised immersed boundary method on hierarchical b-spline grids for fluid-rigid body interaction with solid-solid contact, Spline parameterization method for 2D and 3D geometries based on T-mesh optimization, Recovery-based error estimation and adaptivity using high-order splines over hierarchical T-meshes, Geometrically accurate, efficient, and flexible quadrature techniques for the tetrahedral finite cell method, The expected bit complexity of the von Neumann rejection algorithm, A fictitious domain/distributed Lagrange multiplier based fluid-structure interaction scheme with hierarchical B-spline grids, Isogeometric collocation: cost comparison with Galerkin methods and extension to adaptive hierarchical NURBS discretizations, Multidimensional range queries on hierarchical Voronoi overlays, An adaptive well-balanced positivity preserving central-upwind scheme on quadtree grids for shallow water equations, Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem, Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently, Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions, Selection by rank inK-dimensional binary search trees, Indexing for summary queries, Solvers for $\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit, SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS, From Tessellations to Table Interpretation
