Algorithm for intersection of polygons with holes
Liu Jiamin
Abstract
Liu Jiamin
Abstract
In order to compute the intersection of polygons rapidly and correctly,t his paper pus forward an al-gorithmfor intersection of polygon s with holes.The polygons with holes was decomposed into several solid polygons and each time two solid polygons were dealt with,which not only decreases the computa tion complication,but also simplifies the data structure of polygon and improves the computation sp eed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to compute the intersection of polygons rapidly and correctly,t his paper pus forward an al-gorithmfor intersection of polygon s with holes.The polygons with holes was decomposed into several solid polygons and each time two solid polygons were dealt with,which not only decreases the computa tion complication,but also simplifies the data structure of polygon and improves the computation sp eed.
Key concepts: Polygon (computer graphics), Point in polygon, Intersection (aeronautics), Rectilinear polygon, Star-shaped polygon, Polygon mesh, Computation, Combinatorics