Skip to Main content Skip to Navigation
Conference papers

Tile & Merge: Distributed Delaunay Triangulations for Cloud Computing

Abstract : Motivated by the needs of a scalable out-of-core surface reconstruction algorithm available on the cloud, this paper addresses the computation of distributed Delaunay triangulations of massive point sets. The proposed algorithm takes as input a point cloud and first partitions it across multiple processing elements into tiles of relatively homogeneous point sizes. The distributed computation and communication between processing elements is orchestrated so that each one discovers the Delaunay neighbors of its input points within the theoretical overall Delau-nay triangulation of all points and computes locally a partial view of this triangulation. This approach prevents memory limitations by never materializing the global triangulation. This efficiency is due to our proposed uncentralized model to represent, manage and locally construct the triangulation corresponding to each tile. The point set is first partitioned into non-overlapping tiles, then we construct within each tile the Delaunay triangulation of the local points and a minimal set of replicated foreign points in order to capture the simplices spanning multiple tiles. Inspired by the star splaying approach for Delaunay triangulation computation/repair, communication is limited to exchanging points of potential Delaunay neighbors across tiles. Therefore, our method is guaranteed to reconstruct, within each tile, a triangulation that contains the star of its local points, as though it were computed within the Delaunay triangulation of all points. The proposed algorithm is implemented with Spark for the scheduling and C ++ for the geometric computations. This allows both an optimal scheduling on multiple machines and efficient low-level computation. The results show the efficiency of our algorithm in terms of speedup and strong scaling on a classical Spark configuration with both synthetic and real use case datasets.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02535021
Contributor : Mathieu Brédif Connect in order to contact the contributor
Submitted on : Tuesday, April 7, 2020 - 1:42:03 PM
Last modification on : Tuesday, May 4, 2021 - 6:23:40 PM

File

Out_of_Core_DT_Short_paper_Cam...
Files produced by the author(s)

Identifiers

Collections

Citation

Laurent Caraffa, Pooran Memari, Murat Yirci, Mathieu Brédif. Tile & Merge: Distributed Delaunay Triangulations for Cloud Computing. IEEE Big Data 2019, Dec 2019, Los Angeles, United States. ⟨10.1109/BigData47090.2019.9006534⟩. ⟨hal-02535021⟩

Share

Metrics

Record views

290

Files downloads

494