Skip to main navigation Skip to search Skip to main content

Scalable Overlay Operations over DCEL Polygon Layers

  • University of California at Riverside

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The Doubly Connected Edge List (DCEL) is an edge-list structure that has been widely utilized in spatial applications for planar topological computations. An important operation is the overlay which combines the DCELs of two input layers and can easily support spatial queries like the intersection, union and difference between these layers. However, existing sequential implementations for computing the overlay do not scale and fail to complete for large datasets (for example the US census tracks). In this paper we propose a distributed and scalable way to compute the overlay operation and its related supported queries. We address the issues involved in efficiently distributing the overlay operator and offer various optimizations that improve performance. Our scalable solution can compute the overlay of very large real datasets (32M edges) in few minutes.

Original languageEnglish
Title of host publicationProceedings of 18th International Symposium on Spatial and Temporal Data, SSTD 2023
PublisherAssociation for Computing Machinery
Pages85-95
Number of pages11
ISBN (Electronic)9798400708992
DOIs
StatePublished - 23 Aug 2023
Externally publishedYes
Event18th International Symposium on Spatial and Temporal Data, SSTD 2023 - Calgary, United States
Duration: 23 Aug 202325 Aug 2023

Publication series

NameACM International Conference Proceeding Series

Conference

Conference18th International Symposium on Spatial and Temporal Data, SSTD 2023
Country/TerritoryUnited States
CityCalgary
Period23/08/2325/08/23

Keywords

  • DCEL
  • Spatial data structures
  • overlay operator

Fingerprint

Dive into the research topics of 'Scalable Overlay Operations over DCEL Polygon Layers'. Together they form a unique fingerprint.

Cite this