ScholarLens Back to search
2008•Computer-aided engineeringRequires access

Algorithm on intersection of polygons with holes

Liu Xuena

Open publisher page 0 citations

Abstract

To simplify the algorithms on intersection of polygons with holes and improve the efficiency,a new algorithm is proposed.In the algorithm,the intersected points are firstly classified and sorted,and the intersection sets,union sets and subtraction sets of the polygons are obtained by using different tra-verse methods.Based on the algorithm,the algorithm on intersection of polygons with holes is designed.All the algorithms are implemented.The result indicates that the intersection algorithm has lower complexity and better robustness.

About this research paper

What this paper is about

To simplify the algorithms on intersection of polygons with holes and improve the efficiency,a new algorithm is proposed.In the algorithm,the intersected points are firstly classified and sorted,and the intersection sets,union sets and subtraction sets of the polygons are obtained by using different tra-verse methods.Based on the algorithm,the algorithm on intersection of polygons with holes is designed.All the algorithms are implemented.The result indicates that the intersection algorithm has lower complexity and better robustness.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

To simplify the algorithms on intersection of polygons with holes and improve the efficiency,a new algorithm is proposed.In the algorithm,the intersected points are firstly classified and sorted,and the intersection sets,union sets and subtraction sets of the polygons are obtained by using different tra-verse methods.Based on the algorithm,the algorithm on intersection of polygons with holes is designed.All the algorithms are implemented.The result indicates that the intersection algorithm has lower complexity and better robustness.

Key concepts: Intersection (aeronautics), Robustness (evolution), Subtraction, Algorithm, Computer science, Mathematics, Geography, Arithmetic

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Algorithm on intersection of polygons with holes — Research Paper | ScholarLens