Pages that link to "Item:Q2488572"
From MaRDI portal
The following pages link to Foundations of multidimensional and metric data structures. (Q2488572):
Displaying 50 items.
- Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042) (← links)
- The finite cell method: a review in the context of higher-order structural analysis of CAD and image-based geometric models (Q333303) (← links)
- An isogeometric design-through-analysis methodology based on adaptive hierarchical refinement of NURBS, immersed boundary methods, and T-spline CAD surfaces (Q337892) (← links)
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results (Q346495) (← links)
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- A comparison of verified distance computation between implicit objects using different arithmetics for range enclosure (Q411447) (← links)
- Towards adaptive kinetic-fluid simulations of weakly ionized plasmas (Q423799) (← links)
- Pivot selection: dimension reduction for distance-based indexing (Q450522) (← links)
- Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) (← links)
- A smoothed particle image reconstruction method (Q535349) (← links)
- Parallel re-initialization of level set functions on distributed unstructured tetrahedral grids (Q550889) (← links)
- Voronoi grids conforming to 3D structural features (Q680271) (← links)
- Index structures for fast similarity search for binary vectors (Q681740) (← links)
- Index structures for fast similarity search for real vectors. II (Q722065) (← links)
- Execution time analysis of a top-down R-tree construction algorithm (Q845880) (← links)
- The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing (Q945942) (← links)
- Sync/Async parallel search for the efficient design and construction of web search engines (Q991093) (← links)
- Multiscale cell-based coarsening for discontinuous problems (Q1005684) (← links)
- Solving similarity joins and range queries in metric spaces with the list of twin clusters (Q1013069) (← links)
- New dynamic construction techniques for M-tree (Q1013073) (← links)
- Distance-based index structures for fast similarity search (Q1709472) (← links)
- A parallel computing framework for big data (Q1712556) (← links)
- Small and large deformation analysis with the \(p\)- and B-spline versions of the finite cell method (Q1933507) (← links)
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
- Index-based, high-dimensional, cosine threshold querying with optimality guarantees (Q2035468) (← links)
- Faster compressed quadtrees (Q2084740) (← links)
- A robust solver for elliptic PDEs in 3D complex geometries (Q2131015) (← links)
- Fast spectral analysis for approximate nearest neighbor search (Q2163259) (← links)
- Using compressed suffix-arrays for a compact representation of temporal-graphs (Q2200556) (← links)
- Modeling complex quantum dynamics: evolution of numerical algorithms in the HPC context (Q2206963) (← links)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree (Q2232591) (← links)
- Range search on tuples of points (Q2253898) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
- An AGM-style belief revision mechanism for probabilistic spatio-temporal logics (Q2269133) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- A limit field for orthogonal range searches in two-dimensional random point search trees (Q2274287) (← links)
- A stabilised immersed boundary method on hierarchical b-spline grids for fluid-rigid body interaction with solid-solid contact (Q2309089) (← links)
- Spline parameterization method for 2D and 3D geometries based on T-mesh optimization (Q2309929) (← links)
- Recovery-based error estimation and adaptivity using high-order splines over hierarchical T-meshes (Q2310155) (← links)
- Geometrically accurate, efficient, and flexible quadrature techniques for the tetrahedral finite cell method (Q2310333) (← links)
- The expected bit complexity of the von Neumann rejection algorithm (Q2361447) (← links)
- A fictitious domain/distributed Lagrange multiplier based fluid-structure interaction scheme with hierarchical B-spline grids (Q2417468) (← links)
- Isogeometric collocation: cost comparison with Galerkin methods and extension to adaptive hierarchical NURBS discretizations (Q2450560) (← links)
- Multidimensional range queries on hierarchical Voronoi overlays (Q2628794) (← links)
- An adaptive well-balanced positivity preserving central-upwind scheme on quadtree grids for shallow water equations (Q2664057) (← links)
- Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem (Q2796401) (← links)
- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently (Q2819527) (← links)
- Parallel algorithms for nearest neighbor search problems in high dimensions (Q2830635) (← links)
- Selection by rank in K-dimensional binary search trees (Q2877767) (← links)
- Indexing for summary queries (Q2943560) (← links)
