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 44 items.
- Collision detection for deforming necklaces (Q598233) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- On the dilation spectrum of paths, cycles, and trees (Q833719) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Constructing minimum-interference networks (Q929744) (← links)
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Plastic card fraud detection using peer group analysis (Q949449) (← links)
- Geometric spanners with small chromatic number (Q955227) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Fitting a \(C^m\)-smooth function to data. II (Q1017345) (← links)
- The \(C^m\) norm of a function with prescribed jets. II (Q1017346) (← links)
- An \(O(n)\) time hierarchical tree algorithm for computing force field in \(n\)-body simulations (Q1128668) (← links)
- Facility location and the geometric minimum-diameter spanning tree. (Q1421033) (← links)
- Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
- Approximate range searching (Q1595401) (← links)
- Binary space partitions for axis-parallel line segments: Size-height tradeoffs. (Q1853137) (← links)
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree (Q1879253) (← links)
- Computing the greedy spanner in near-quadratic time (Q1957650) (← links)
- Sigma-local graphs (Q2266933) (← links)
- Fitting a \(C^m\)-smooth function to data. III. (Q2389220) (← 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)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- Streaming Embeddings with Slack (Q3183478) (← 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)
- 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)
- AN EFFECTIVE SETTING OF HIERARCHICAL CELL STRUCTURE FOR THE FAST MULTIPOLE BOUNDARY ELEMENT METHOD (Q5463093) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- A cost optimal parallel algorithm for computing force field in \(N-\)body simulations on a CREW PRAM (Q5941086) (← links)
