The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets

DOI10.1007/978-3-540-89682-1_4zbMath1160.68670OpenAlexW188328570MaRDI QIDQ3612833

Thomas Strothotte, Tobias Germer

Publication date: 11 March 2009

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89682-1_4

zbMATH Keywords

geometric spannersrange searchingparticle systemsproximity queriesdynamic point sets

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computing methodologies for image processing (68U10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic data structures for realtime management of large geometric scenes (extended abstract)
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

This page was built for publication: The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets