A novel and efficient approach for line segment clipping against a convex polygon
This paper proposes a new line clipping algorithm against a convex polygon with 𝑂(𝑁) time complexity. The line segment is pruned against each extended edge of the polygon as the first step of the proposed algorithm. Then, the pruning process gives accurate outcomes for completely inside and partiall...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Ruhuna
2019-12-01
|
Series: | Ruhuna Journal of Science |
Subjects: | |
Online Access: | https://rjs.ruh.ac.lk/index.php/rjs/article/view/152/262 |