On scalable DCEL overlay operations

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 op...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:GeoInformatica Ročník 29; číslo 3; s. 751 - 788
Hlavní autoři: Calderon-Romero, Andres, Abdelhafeez, Laila, Trajcevski, Goce, Magdy, Amr, Tsotras, Vassilis J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.07.2025
Springer Nature B.V
Témata:
Art galleries & museums
Computer Science
Data Structures and Information Theory
Datasets
Geographical Information Systems/Cartography
Information Storage and Retrieval
Multimedia Information Systems
Polygonization
Polygons
Queries
Spatial data
Three dimensional models
United States > US
Spatial data structures
DCEL
Overlay operator
ISSN:1384-6175, 1573-7624
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1384-6175
1573-7624
DOI:10.1007/s10707-025-00539-x