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

DOI10.1007/978-3-540-89682-1_4MaRDI QIDQ3612833zbMATH OpenOpenAlexFDO

Authors Tobias Germer, Thomas Strothotte

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

dynamic point setsgeometric spannersparticle systemsproximity queriesrange searching

Mathematics Subject Classification ID

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

Recommendations

• The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
• New Techniques for Exact and Approximate Dynamic Closest-Point Problems
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• Proximate planar point location
• Deformable spanners and applications

Cites work

• Dynamic data structures for realtime management of large geometric scenes (extended abstract)
• scientific article; zbMATH DE number 1263225 (Why is no real title available?)
• scientific article; zbMATH DE number 1182924 (Why is no real title available?)
• scientific article; zbMATH DE number 1480194 (Why is no real title available?)
• scientific article; zbMATH DE number 6472653 (Why is no real title available?)
• 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

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