Pages that link to "Item:Q4369857"
From MaRDI portal
The following pages link to A decomposition of multidimensional point sets with applications to <i>k</i> -nearest-neighbors and <i>n</i> -body potential fields (Q4369857):
Displayed 50 items.
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Influence-based Voronoi diagrams of clusters (Q1984607) (← links)
- Algorithms for nonnegative \(\mathrm{C}^2(\mathbb R^2)\) interpolation (Q2032927) (← links)
- Efficient algorithms for approximate smooth selection (Q2050514) (← links)
- Local geometric spanners (Q2067671) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- A spanner for the day after (Q2223618) (← links)
- Quickest path queries on transportation network (Q2249042) (← links)
- Sigma-local graphs (Q2266933) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Shortest paths in intersection graphs of unit disks (Q2344058) (← links)
- On minimum- and maximum-weight minimum spanning trees with neighborhoods (Q2344217) (← links)
- Fitting a \(C^m\)-smooth function to data. III. (Q2389220) (← links)
- A graph-based N-body approximation with application to stochastic neighbor embedding (Q2418099) (← links)
- The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition (Q2441579) (← links)
- Construction of the nearest neighbor embracing graph of a point set (Q2479573) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions (Q2507694) (← links)
- Fast evaluation of potential and force field in particle systems using a fair-split tree spatial structure (Q2725060) (← links)
- Sobolev extension by linear operators (Q2862635) (← links)
- On Some Proximity Problems of Colored Sets (Q2867120) (← links)
- Kinetic Reverse k-Nearest Neighbor Problem (Q2946067) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- Streaming Embeddings with Slack (Q3183478) (← links)
- Fast Algorithms for Diameter-Optimally Augmenting Paths (Q3448826) (← links)
- Spanners of Additively Weighted Point Sets (Q3512473) (← links)
- Computing the Greedy Spanner in Near-Quadratic Time (Q3512475) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- An Optimal Dynamic Spanner for Doubling Metric Spaces (Q3541109) (← links)
- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension (Q3644728) (← links)
- Provably Good Partitioning and Load Balancing Algorithms for Parallel Adaptive N-Body Simulation (Q4389263) (← links)
- Computing the Expected Value and Variance of Geometric Measures (Q4555539) (← links)
- Spanners for Directed Transmission Graphs (Q4581909) (← links)
- On Clustering Induced Voronoi Diagrams (Q4593247) (← links)
- A distributed kernel summation framework for general‐dimension machine learning (Q4969920) (← links)
- Metric Spaces with Expensive Distances (Q5012870) (← links)
- Approximate $k$-Nearest Neighbor Graph on Moving Points (Q5045992) (← links)
- (Q5088946) (← links)
- Approximating Distance Measures for the Skyline (Q5091120) (← links)
- (Q5111761) (← links)
- (Q5115792) (← links)
- Dynamic smooth compressed quadtrees (Q5115813) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
- Spanners of Complete k-Partite Geometric Graphs (Q5458526) (← links)