Geometric Spanners in the MapReduce Model

A geometric spanner on a point set is a sparse graph that approximates the Euclidean distances between all pairs of points in the point set. Here, we intend to construct a geometric spanner for a massive point set, using a distributed algorithm on parallel machines. In particular, we use the MapReduce model of computation to construct spanners in several rounds with inter-communications in between. An algorithm in this model is called efficient if it uses a sublinear number of machines and runs in a polylogarithmic number of rounds. In this paper, we propose an efficient MapReduce algorithm for constructing a geometric spanner in a constant number of rounds, using linear amount of communication. The stretch factors of our spanner is \(1+\epsilon \), for any \(\epsilon >0\).

[1]  Kyle Fox,et al.  Massively parallel algorithms for computing TIN DEMs and contour trees for large terrains , 2016, SIGSPATIAL/GIS.

[2]  Davood Bakhshesh,et al.  Geometric Spanners Merging and its Applications , 2016, CCCG.

[3]  Gonzalo Navarro,et al.  t-Spanners as a Data Structure for Metric Space Searching , 2002, SPIRE.

[4]  Giri Narasimhan,et al.  Geometric spanner networks , 2007 .

[5]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[6]  Kyle Fox,et al.  Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures , 2016, PODS.

[7]  Ahmed Eldawy,et al.  SpatialHadoop: A MapReduce framework for spatial data , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[8]  Sergei Vassilvitskii,et al.  A model of computation for MapReduce , 2010, SODA '10.

[9]  M. Ghodsi,et al.  A Coarse Grained Solution to Parallel Terrain Simpli cation , 2022 .

[10]  Qin Zhang,et al.  Sorting, Searching, and Simulation in the MapReduce Framework , 2011, ISAAC.

[11]  Ge Xia,et al.  The Stretch Factor of the Delaunay Triangulation Is Less than 1.998 , 2011, SIAM J. Comput..

[12]  Mohammad Ghodsi,et al.  A coarse grained parallel solution to terrain simplification , 1998, CCCG.

[13]  Grigory Yaroslavtsev,et al.  Massively Parallel Algorithms and Hardness for Single-Linkage Clustering Under $\ell_p$-Distances , 2017, ICML.

[14]  Kasturi R. Varadarajan,et al.  Geometric Approximation via Coresets , 2007 .

[15]  Paul B. Callahan,et al.  Dealing with higher dimensions: the well-separated pair decomposition and its applications , 1995 .

[16]  Alexandr Andoni,et al.  Parallel algorithms for geometric graph problems , 2013, STOC.

[17]  Ahmed Eldawy,et al.  CG_Hadoop: computational geometry in MapReduce , 2013, SIGSPATIAL/GIS.

[18]  Benjamin Moseley,et al.  Efficient massively parallel methods for dynamic programming , 2017, STOC.

[19]  Marc J. van Kreveld.  Algorithms for Triangulated Terrains , 1997, SOFSEM.

[20]  Arthur M. Farley,et al.  Spanners and message distribution in networks , 2004, Discret. Appl. Math..

[21]  Vitaly Osipov,et al.  Efficient Parallel and External Matching , 2013, Euro-Par.

[22]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[23]  Michael T. Goodrich,et al.  Simulating Parallel Algorithms in the MapReduce Framework with Applications to Parallel Computational Geometry , 2010, ArXiv.