Education: Barycentric coordinates computation in homogeneous coordinates
Computers and Graphics
Computation in projective space
MAMECTIS'09 Proceedings of the 11th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems
Duality, barycentric coordinates and intersection computation in projective space with GPU support
WSEAS Transactions on Mathematics
Duality and intersection computation in projective space with GPU support
ASM'10 Proceedings of the 4th international conference on Applied mathematics, simulation, modelling
S-clip E2: a new concept of clipping algorithms
SIGGRAPH Asia 2012 Posters
| Hi-index | 0.00 |
Algorithms for line clipping against convex polygonhave been studied for a long time and many researchpapers have been published so far. In spite of the latestgraphical hardware development and significantincrease of performance the clipping is still abottleneck of the graphical pipeline. This paperpresents a new robust and fast algorithm for lineclipping by a convex polygon. The algorithm usesa small pre-processing in order to obtain significantspeed up. The proposed algorithm is especiallyconvenient for applications where points or lines arerepresented in homogeneous coordinates. Thealgorithm does not use division in floating pointrepresentation as the resulting points are inhomogeneous coordinates. The algorithms will benefitif vector-vector hardware supported operations can beused.