Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
An efficient new algorithm for 2-D line clipping: Its development and analysis
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
An analysis and algorithm for polygon clipping
Communications of the ACM
Communications of the ACM
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
An efficient implementation of parametric line and polygon clipping algorithm
Proceedings of the 2002 ACM symposium on Applied computing
Computing and Managing Cardinal Direction Relations
IEEE Transactions on Knowledge and Data Engineering
An algorithm for polygon clipping, and for determining polygon intersections and unions
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 |
This paper presents a new 2D polygon clipping method, based on an extension to the Sutherland-Cohen 2D line clipping method. After discussing three basic polygon clipping algorithms, a different approach is proposed, explaining the principles of a new algorithm and presenting it step by step.An example implementation of the algorithm is given along with some results. A comparison between the proposed method, the Liang and Barsky algorithm, and the Sutherland-Hodgman algorithm is also given, showing performances up to eight times the speed of the Sutherland-Hodgman algorithm, and up to three times the Liang and Barsky algorithm. The algorithm proposed here can use floating point or integer operations; this can be useful for fast or simple implementations.