Towards optimal locality in mesh-indexings

DOI10.1007/BFB0036198OpenAlexW1919542631MaRDI QIDQ5055949FDOQ5055949

Peter Sanders, Rolf Niedermeier, Klaus Reinhardt

Publication date: 9 December 2022

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0036198

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Space-filling curves
• Towards optimal locality in mesh-indexings
• Optimal Numberings of an $N \times N$ Array
• Branch-and-bound and backtrack search on mesh-connected arrays of processors
• Mesh computer algorithms for computational geometry
• Space filling curves and their use in the design of geometric data structures

Cited In (2)

• Random permutations on distributed, external and hierarchical memory
• Towards optimal locality in mesh-indexings

This page was built for publication: Towards optimal locality in mesh-indexings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055949)