journal article·2025-01-23Open access

GPU-Accelerated Algorithm for Polygon Reconstruction

Ruian Ji, Zhirui Niu, Lan Chen

Applied Sciences· Volume 15· Issue 3

Abstract

Polygon reconstruction is widely used across various fields. Although the current polygon reconstruction algorithms have achieved near-linear time complexity, they still fail to meet the speed demands imposed by the exponential growth in polygon numbers. The development of GPU technology provides a promising solution to this issue. This paper proposes a GPU-based algorithm that leverages hash tables and memory pools to transform the polygon reconstruction problem into an efficiently parallelizable task. Experimental results on Nvidia RTX 2080Ti demonstrate that the new algorithm achieves 17× and 46× speedups on Manhattan and non-Manhattan polygon test sets, respectively. Compared to traditional CPU algorithms, the new algorithm significantly improves processing speeds, especially when handling layouts with complex polygons. It demonstrates strong scalability and performance advantages, providing crucial support for enhancing the overall efficiency of CAD tools.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Computational Geometry and Mesh Generation · Image Processing and 3D Reconstruction · Robotics and Sensor-Based Localization

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Institute of Microelectronics of the Chinese Academy of Sciences, Beijing 100029, China

School of Integrated Circuits, University of Chinese Academy of Sciences, Beijing 100049, China

Funding

National Key R&D Program of China

References (12)

Show source-provided references
1. Industrial strength polygon clipping: A novel algorithm with applications in VLSI CAD10.1016/j.cad.2010.06.008 ↗
2. Time efficient VLSI artwork analysis algorithms in GOALIE210.1109/43.31520 ↗
3. Efficient clipping of arbitrary polygons10.1145/274363.274364 ↗
4. Kriegel, H.P., Brinkhoff, T., and Schneider, R. (1991). An Efficient Map Overlay Algorithm Based on Spatial Access Methods and Computational Geometry, Springer.10.1007/978-3-642-77605-2_11 ↗
5. A Generic Solution to Polygon Clipping10.1145/129902.129906 ↗
6. A parallel method to accelerate spatial operations involving polygon intersections10.1080/13658816.2018.1508689 ↗
7. A GPU-Based Rasterization Algorithm for Boolean Operations on Polygons10.1587/transinf.2017EDL8119 ↗
8. Rasterization Computing-Based Parallel Vector Polygon Overlay Analysis Algorithms Using OpenMP and MPI10.1109/ACCESS.2018.2825452 ↗
9. Puri, S., and Prasad, S.K. (2014, January 9–12). Output-Sensitive Parallel Algorithm for Polygon Clipping. Proceedings of the 2014 43rd International Conference on Parallel Processing, Minneapolis, MN, USA.10.1109/ICPP.2014.33 ↗
10. Mallika Kankanamalage, B.A., Puri, S., and Prasad, S.K. (2024, January 12–15). Extending Segment Tree for Polygon Clipping and Parallelizing using OpenMP and OpenACC Directives. Proceedings of the 53rd International Conference on Parallel Processing, ICPP ’24, Gotland, Sweden.10.1145/3673038.3673141 ↗
11. Ashan, M.K.B., Puri, S., and Prasad, S.K. (2023, January 1–4). Efficient PRAM and Practical GPU Algorithms for Large Polygon Clipping with Degenerate Cases. Proceedings of the 2023 IEEE/ACM 23rd International Symposium on Cluster, Cloud and Internet Computing (CCGrid), Bangalore, India.10.1109/CCGrid57682.2023.00060 ↗
12. Zheng, S., Yu, B., and Wong, M. (2023, January 24–27). OpenILT: An Open Source Inverse Lithography Technique Framework (Invited Paper). Proceedings of the 2023 IEEE 15th International Conference on ASIC (ASICON), Nanjing, China.10.1109/ASICON58565.2023.10396314 ↗