An Efficient Construction of Yao-Graph in Data-Distributed Settings
Computational Geometry
2023-08-30 v1 Distributed, Parallel, and Cluster Computing
Abstract
A sparse graph that preserves an approximation of the shortest paths between all pairs of points in a plane is called a geometric spanner. Using range trees of sublinear size, we design an algorithm in massively parallel computation (MPC) model for constructing a geometric spanner known as Yao-graph. This improves the total time and the total memory of existing algorithms for geometric spanners from subquadratic to near-linear.
Cite
@article{arxiv.2308.15065,
title = {An Efficient Construction of Yao-Graph in Data-Distributed Settings},
author = {Sepideh Aghamolaei and Mohammad Ghodsi},
journal= {arXiv preprint arXiv:2308.15065},
year = {2023}
}