Scalable Overlay Operations over DCEL Polygon Layers

CONTENIDO DE LIBRE ACCESO

Este contenido es de libre acceso. Solo haz clic en el siguiente botón.

Autor
Año de publicación 2023
Idioma Inglés
Publicado por SSTD '23: Proceedings of the 18th International Symposium on Spatial and Temporal Data

Descripción: 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.
Citación recomendada (normas APA)
: Andrés Oswaldo; Tsotras Calderón Romero, "Scalable Overlay Operations over DCEL Polygon Layers", Colombia:SSTD '23: Proceedings of the 18th International Symposium on Spatial and Temporal Data, 2023. Consultado en línea en la Biblioteca Digital de Bogotá (https://www.bibliotecadigitaldebogota.gov.co/resources/3711857/), el día 2025-05-17.

Información adicional