A generic solution to polygon clipping
Communications of the ACM
Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
An analysis and algorithm for polygon clipping
Communications of the ACM
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Communications of the ACM
An algorithm for polygon clipping, and for determining polygon intersections and unions
Computers & Geosciences
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
A new algorithm for computing Boolean operations on polygons
Computers & Geosciences
Technical section: A new algorithm for Boolean operations on general polygons
Computers and Graphics
An efficient algorithm for clipping operation based on trapezoidal meshes and sweep-line technique
Advances in Engineering Software
| Hi-index | 0.00 |
In this paper a simple and efficient algorithm for computing Boolean operations on polygons is presented. The algorithm works with almost any kind of input polygons: concave polygons, polygons with holes, several contours and self-intersecting edges. Important topological information, as the holes of the result polygon, is computed.