Space filling curves and their use in the design of geometric data structures

DOI10.1007/3-540-59175-3_79zbMath1495.68236OpenAlexW2119611889MaRDI QIDQ5096322

Desh Ranjan, Thomas Roos, Tetsuo Asano, Peter Widmayer, Ermo Welzl

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_79

zbMATH Keywords

Gray coderange queryHilbert curvequery regionquery window

Mathematics Subject Classification ID

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

Related Items (2)

Towards optimal locality in mesh-indexings ⋮ A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries

Cites Work

• Unnamed Item
• Space-filling curves
• Quad trees: A data structure for retrieval by composite keys
• Gray codes for partial match and range queries

This page was built for publication: Space filling curves and their use in the design of geometric data structures