Abstract

Computation of the intersection area of polygons is an important mathematical problem. For a long time, the processing of arbitrary polygons has been an important and difficult research topic. In this paper, we proposed a GPU-based rasterized polygon intersection area algorithm, GPURAS, and its accelerated versions, GPURASMC, which use Monte Carlo method and prove the correctness of these algorithms. Experiments and comparisons were performed using simple, arbitrary complex, and large-scale polygons. The results show that, compared to CPU-based algorithms, the efficiency of our algorithms is hundreds of times superior.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.