Foundations of multidimensional and metric data structures.
From MaRDI portal
Publication:2488572
Recommendations
Cited in
(74)- 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
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
- 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 in K-dimensional binary search trees
- Indexing for summary queries, theory and practice
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- 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
- Solvers for \(\mathcal{O}(N)\) electronic structure in the strong scaling limit
- Enabling high-dimensional range queries using kNN indexing techniques: approaches and empirical results
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- From Tessellations to Table Interpretation
- 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
- scientific article; zbMATH DE number 1755588 (Why is no real title available?)
- Updating dynamic random hyperbolic graphs in sublinear time
- Modeling and manipulating cell complexes in two, three and higher dimensions
- scientific article; zbMATH DE number 2173815 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Some mathematical properties of the performance measures applied for point cloud databases
- Real-valued embeddings and sketches for fast distance and similarity estimation
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees
- 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
- A smoothed particle image reconstruction method
- Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids
- 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
- Faster dynamic compressed \(d\)-ary relations
- An interface-preserving moving mesh in multiple space dimensions
- A topological data analysis based classifier
- Voronoi grids conforming to 3D structural features
- Index structures for fast similarity search for binary vectors
- Metric binary trees, and nested cluster hierarchy building
- 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
This page was built for publication: Foundations of multidimensional and metric data structures.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488572)
