Parallel CUDA-Based Optimization of the Intersection Calculation Process in the Greiner–Hormann Algorithm

Parallel CUDA-Based Optimization of the Intersection Calculation Process in the Greiner–Hormann Algorithm

The Greiner–Hormann algorithm is a commonly used polygon overlay analysis algorithm. It uses a double-linked list structure to store vertex data, and its intersection calculation step has a significant effect on the overall operating efficiency of the algorithm. To address the time-consuming interse...

Full description

Saved in:
Bibliographic Details
Main Authors: Jiwei Zuo, Junfu Fan, Kuan Li, Qingyun Liu, Yuke Zhou, Yi Zhang
Format: Article
Language:English
Published: MDPI AG 2025-03-01
Series:Algorithms
Subjects:
overlay analysis
polygon clipping
shape complexity
CUDA
parallel computing
algorithm optimization
Online Access:https://www.mdpi.com/1999-4893/18/3/147
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/1999-4893/18/3/147

Similar Items