Zobrazit v EDS

On scalable DCEL overlay operations.

Uloženo v:
Podrobná bibliografie
Název: On scalable DCEL overlay operations.
Autoři: Calderon-Romero, Andres1,2 (AUTHOR) andrescalderonr@javeriana.edu.co, Abdelhafeez, Laila2 (AUTHOR) labde005@ucr.edu, Trajcevski, Goce3 (AUTHOR) gocet25@iastate.edu, Magdy, Amr2 (AUTHOR) amr@cs.ucr.edu, Tsotras, Vassilis J.2 (AUTHOR) tsotras@cs.ucr.edu
Zdroj: GeoInformatica. Jul2025, Vol. 29 Issue 3, p751-788. 38p.
Témata: *POLYGONS, *SPATIAL data structures, *GEOMETRIC approach
Abstrakt: The Doubly Connected Edge List (DCEL) is an edge-list structure widely used in spatial applications, primarily for planar topological and geometric computations. However, it is also applicable to various types of data, including 3D models and geographic data. An essential operation is the overlay operation, which combines the DCELs of two input polygon layers and can easily support spatial queries on polygons like the intersection, union, and difference between these layers. However, existing techniques for spatial overlay operations suffer from two main limitations. First, they fail to handle many large datasets practically used in real applications. Second, they cannot handle arbitrary spatial lines that practically form polygons, e.g., city blocks, but they are given as a set of scattered lines. This work proposes a distributed and scalable way to compute the overlay operation and its related supported queries. Our operations also support arbitrary spatial lines through a scalable polygonization process. We address the issues of efficiently distributing the lines and overlay operators and offer various optimizations that improve performance. Our experiments demonstrate that the proposed scalable solution can efficiently compute the overlay of large real datasets. [ABSTRACT FROM AUTHOR]
Databáze: Academic Search Index
Popis
Abstrakt:The Doubly Connected Edge List (DCEL) is an edge-list structure widely used in spatial applications, primarily for planar topological and geometric computations. However, it is also applicable to various types of data, including 3D models and geographic data. An essential operation is the overlay operation, which combines the DCELs of two input polygon layers and can easily support spatial queries on polygons like the intersection, union, and difference between these layers. However, existing techniques for spatial overlay operations suffer from two main limitations. First, they fail to handle many large datasets practically used in real applications. Second, they cannot handle arbitrary spatial lines that practically form polygons, e.g., city blocks, but they are given as a set of scattered lines. This work proposes a distributed and scalable way to compute the overlay operation and its related supported queries. Our operations also support arbitrary spatial lines through a scalable polygonization process. We address the issues of efficiently distributing the lines and overlay operators and offer various optimizations that improve performance. Our experiments demonstrate that the proposed scalable solution can efficiently compute the overlay of large real datasets. [ABSTRACT FROM AUTHOR]
ISSN:13846175
DOI:10.1007/s10707-025-00539-x