Towards optimal locality in mesh-indexings
From MaRDI portal
Publication:1348392
DOI10.1016/S0166-218X(00)00326-7zbMath1004.68181OpenAlexW2080956162WikidataQ126844199 ScholiaQ126844199MaRDI QIDQ1348392
Peter Sanders, Klaus Reinhardt, Rolf Niedermeier
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00326-7
Related Items (15)
Towards optimal locality in mesh-indexings ⋮ An evaluation of point-insertion sequences for incremental Delaunay tessellations ⋮ Search of fractal space-filling curves with minimal dilation ⋮ Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves ⋮ On the Sierpiński–Knopp curve ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Distributed balanced partitioning via linear embedding ⋮ Reordering columns for smaller indexes ⋮ \(L_\infty\)-locality of three-dimensional Peano curves ⋮ One-side Peano curves of fractal genus 9 ⋮ A competitive strategy for distance-aware online shape allocation ⋮ Lower bounds for the square-to-linear ratio for plane Peano curves ⋮ Norm-Based Locality Measures of Two-Dimensional Hilbert Curves ⋮ Locality and bounding-box quality of two-dimensional space-filling curves ⋮ Parallel adaptive subspace correction schemes with applications to elasticity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of the Hilbert curve for representing two-dimensional space
- Space-filling curves
- Towards optimal locality in mesh-indexings
- Space-filling curves and their use in the design of geometric data structures
- On multidimensional curves with Hilbert property
- Optimal deterministic sorting and routing on grids and tori with diagonals
- Branch-and-bound and backtrack search on mesh-connected arrays of processors
- Optimal Numberings of an $N \times N$ Array
- Mesh computer algorithms for computational geometry
This page was built for publication: Towards optimal locality in mesh-indexings
