A spatial data model and a topological sweep algorithm for map overlay

Finke, Ulrich; Hinrichs, Klaus

doi:10.1007/3-540-56869-7_10

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A common algorithm is the plane sweep paradigm [11,26,31,39] but, as stated by Audet et al [3]: "the plane sweep strategy does not parallelize efficiently, rendering it incapable of benefiting from recent trends of multicore CPUs and general-purpose GPUs". Other map overlay algorithms use a special data structure, such as an R-Tree [5,38], QuadTree [6,34], or Uniform Grid [16].…”

Section: Introductionmentioning

confidence: 99%

Fast exact parallel map overlay using a two-level uniform grid

Magalhães

Andrade

Franklin

et al. 2015

Proceedings of the 4th International ACM SIGSPATIAL Workshop on Analytics for Big Geospatial Data

View full text Add to dashboard Cite

We present EPUG-Overlay (Exact Parallel Uniform Grid Overlay), an algorithm to overlay two maps that is fast and parallel, has no roundoff errors, and is freely available. EPUG-Overlay combines several novel aspects. It represents coordinates with rational numbers, thereby ensuring exact computations with no roundoff errors and the ensuing sliver problems and topological impossibilities. For efficiency, EPUG-Overlay performs the map overlay in parallel, thereby utilizing the ubiquitous multicore architecture. Our application goes beyond merely using existing packages, which are inefficient when used in parallel on large problems. Indeed, overlaying two maps with 53,000,000 edges and 730,000 faces took only 322 elapsed seconds (plus 116 seconds for I/O) on a dual 8-core 3

show abstract