Space-filling curves and their use in the design of geometric data structures
From MaRDI portal
Publication:1391294
DOI10.1016/S0304-3975(96)00259-9zbMath0901.68036OpenAlexW2721204918WikidataQ54309276 ScholiaQ54309276MaRDI QIDQ1391294
Tetsuo Asano, Peter Widmayer, Desh Ranjan, Thomas Roos, Ermo Welzl
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00259-9
Related Items (10)
Towards optimal locality in mesh-indexings ⋮ Efficient algorithms for coding Hilbert curve of arbitrary-sized image and application to window query ⋮ Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks ⋮ Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves ⋮ Space filling curves and geodesic laminations ⋮ Optimality of Clustering Properties of Space-Filling Curves ⋮ Heterogeneous recurrence analysis of spatial data ⋮ Space-filling curves in adaptive curvilinear coordinates for computer numerically controlled five-axis machining ⋮ Locality and bounding-box quality of two-dimensional space-filling curves ⋮ An arithmetic-analytical expression of the Hilbert-type space-filling curves and its applications
Cites Work
This page was built for publication: Space-filling curves and their use in the design of geometric data structures
