Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A clipping operation is a fundamental operation within all computer graphics systems and it has been ll explored as many algorithms have been developed. Hover there are still other ways how a graphical primitive can be clipped against a window. The type of the window has a strong influence on the final algorithm complexity. The window can be orthogonal and axis aligned, 4-sided orthogonal non-axis aligned convex or non-convex. Clipped primitives are mostly lines, line segments and polygons of the above mentioned types. It leads to algorithms with  O(lg N)  [Skala 1994] up to  O(NM)  complexities in general. In some cases, when a clipping window is constant and many primitives are to be clipped, a clipping algorithm with  O(1)  complexity [Skala 1996] can be used. Algorithms are mostly based on Cohen-Sutherland, Cyrus-Beck, Liang-Barsky and Sutherland-Hodgman algorithms [Theoharis, et al. 2008]. Some of them are intended for hardware implementation but all operate in the Euclidean space.
['Vaclav Skala']
I am writing a research paper on a idea S-clip E 2 : a new concept of clipping algorithms
[{"from": "human", "value": "I am writing a research paper on a idea S-clip E 2 : a new concept of clipping algorithms"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A clipping operation is a fundamental operation within all computer graphics systems and it has been ll explored as many algorithms have been developed. Hover there are still other ways how a graphical primitive can be clipped against a window. The type of the window has a strong influence on the final algorithm complexity. The window can be orthogonal and axis aligned, 4-sided orthogonal non-axis aligned convex or non-convex. Clipped primitives are mostly lines, line segments and polygons of the above mentioned types. It leads to algorithms with  O(lg N)  [Skala 1994] up to  O(NM)  complexities in general. In some cases, when a clipping window is constant and many primitives are to be clipped, a clipping algorithm with  O(1)  complexity [Skala 1996] can be used. Algorithms are mostly based on Cohen-Sutherland, Cyrus-Beck, Liang-Barsky and Sutherland-Hodgman algorithms [Theoharis, et al. 2008]. Some of them are intended for hardware implementation but all operate in the Euclidean space."}]