Scalable Overlay Operations over DCEL Polygon Layers

Andres Calderon-Romero, Vassilis J. Tsotras, Amr Magdy

Producción: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaProceedings of 18th International Symposium on Spatial and Temporal Data, SSTD 2023
EditorialAssociation for Computing Machinery
Páginas85-95
Número de páginas11
ISBN (versión digital)9798400708992
DOI
EstadoPublicada - 23 ago. 2023
Publicado de forma externa
Evento18th International Symposium on Spatial and Temporal Data, SSTD 2023 - Calgary, Estados Unidos
Duración: 23 ago. 202325 ago. 2023

Serie de la publicación

NombreACM International Conference Proceeding Series

Conferencia

Conferencia18th International Symposium on Spatial and Temporal Data, SSTD 2023
País/TerritorioEstados Unidos
CiudadCalgary
Período23/08/2325/08/23

Huella

Profundice en los temas de investigación de 'Scalable Overlay Operations over DCEL Polygon Layers'. En conjunto forman una huella única.

Citar esto