Efficient Yao Graph Construction
| Autor: | Funke, Daniel, Sanders, Peter |
|---|---|
| Rok vydání: | 2023 |
| Předmět: |
Computational Geometry (cs.CG)
FOS: Computer and information sciences sweepline algorithms Yao graphs Theory of computation → Sparsification and spanners Computer Science - Data Structures and Algorithms computational geometry Computer Science - Computational Geometry geometric spanners Data Structures and Algorithms (cs.DS) optimal algorithms |
| DOI: | 10.48550/arxiv.2303.07858 |
| Popis: | Yao graphs are geometric spanners that connect each point of a given point set to its nearest neighbor in each of k cones drawn around it. Yao graphs were introduced to construct minimum spanning trees in d dimensional spaces. Moreover, they are used for instance in topology control in wireless networks. An optimal 𝒪(n log n)-time algorithm to construct Yao graphs for a given point set has been proposed in the literature but - to the best of our knowledge - never been implemented. Instead, algorithms with a quadratic complexity are used in popular packages to construct these graphs. In this paper we present the first implementation of the optimal Yao graph algorithm. We engineer the data structures required to achieve the 𝒪(n log n) time bound and detail algorithmic adaptations necessary to take the original algorithm from theory to practice. We propose a priority queue data structure that separates static and dynamic events and might be of independent interest for other sweepline algorithms. Additionally, we propose a new Yao graph algorithm based on a uniform grid data structure that performs well for medium-sized inputs. We evaluate our implementations on a wide variety of synthetic and real-world datasets and show that our implementation outperforms current publicly available implementations by at least an order of magnitude. LIPIcs, Vol. 265, 21st International Symposium on Experimental Algorithms (SEA 2023), pages 20:1-20:20 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|