Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently

DOI10.1007/978-3-319-44543-4_35zbMath1478.68427arXiv1509.01990OpenAlexW3099643767MaRDI QIDQ2819527

Henning Meyerhenke, Moritz von Looz

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.01990

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.

Uses Software

• Hyperbolic graph generator
• NetworKit

Cites Work

• Hyperbolic graph generator
• Foundations of multidimensional and metric data structures.
• The Mathematics of Infectious Diseases
• Generating Random Hyperbolic Graphs in Subquadratic Time
• Nearest-Neighbor Searching Under Uncertainty II

This page was built for publication: Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently