Multidimensional binary partitions: distributed data structures for spatial partitioning
From MaRDI portal
Publication:3982001
DOI10.1080/00207179108934215zbMATH Open0741.68035OpenAlexW1974254028MaRDI QIDQ3982001FDOQ3982001
Authors: George Cybenko, Thomas G. Allen 
Publication date: 26 June 1992
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179108934215
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
classificationcomputational geometryhypercubefluid mechanicstrackingvortex flowsparallel architecturemultidimensional binary partition algorithm
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multidimensional binary search trees used for associative searching
- Time bounds for selection
- Title not available (Why is that?)
- A Comparison of Domain Decomposition Techniques for Elliptic Partial Differential Equations and their Parallel Implementation
- Fixed hypercube embedding
- A vectorized near neighbors algorithm of order N using a monotonic logical grid
Cited In (6)
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)
