Multidimensional binary partitions: distributed data structures for spatial partitioning
From MaRDI portal
Publication:3982001
Recommendations
- Dynamic data partitioning for distributed-memory multicomputers.
- Adaptive spatial partitioning for multidimensional data streams
- Algorithms and Computation
- scientific article; zbMATH DE number 1875378
- Partitioning strategies for structured multiblock grids
- scientific article; zbMATH DE number 2079327
- A note on data structures for maintaining bipartitions
- Distributed spatial data fragmentation and cross-border topological join optimization
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 46317 (Why is no real title available?)
- A Comparison of Domain Decomposition Techniques for Elliptic Partial Differential Equations and their Parallel Implementation
- A vectorized near neighbors algorithm of order N using a monotonic logical grid
- Fixed hypercube embedding
- Multidimensional binary search trees used for associative searching
- Time bounds for selection
Cited in
(7)- The empty bin: A data structure for spatial search of time‐varying data
- scientific article; zbMATH DE number 3958753 (Why is no real title available?)
- scientific article; zbMATH DE number 432984 (Why is no real title available?)
- The LIR space partitioning system applied to Cartesian grids
- The effectiveness of cyclic blockwise distribution
- scientific article; zbMATH DE number 1953853 (Why is no real title available?)
- Algorithms for multidimensional partitioning of static files
This page was built for publication: Multidimensional binary partitions: distributed data structures for spatial partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982001)