Reading: A novel and efficient approach for line segment clipping against a convex polygon

Download

A- A+
Alt. Display

Short Papers

A novel and efficient approach for line segment clipping against a convex polygon

Authors:

Kasun Ranga Wijeweera ,

University of Ruhuna, LK
About Kasun

1Department of Computer Science, Faculty of Science, University of Ruhuna
2 Postgraduate Institute of Science, University of Peradeniya

X close

Saluka Ranasinghe Kodituwakku,

University of Peradeniya, LK
About Saluka

Department of Statistics and Computer Science, Faculty of Science

Postgraduate Institute of Science, University of Peradeniya

 

 

X close

Mahawaga Arachchige Pathum Chamikara

University of Peradeniya, LK
About Mahawaga Arachchige

1 Department of Statistics and Computer Science, Faculty of Science,

2 School of Computer Science and Information Technology, RMIT University, Melbourne

X close

Abstract

This paper proposes a new line clipping algorithm against a convex polygon with O (N) 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 partially inside line segments only. It could be observed that the endpoints of completely outside line segments coincide after the pruning process. The algorithm was developed based on this observation. The proposed algorithm was compared against the four existing algorithms both theoretically and experimentally. The proposed algorithm is faster than Cyrus Beck algorithm and it is slower than ECB, Rappaport, and Skala algorithms.

How to Cite: Wijeweera, K.R., Kodituwakku, S.R. and Pathum Chamikara, M.A., 2019. A novel and efficient approach for line segment clipping against a convex polygon. Ruhuna Journal of Science, 10(2), pp.161–173. DOI: http://doi.org/10.4038/rjs.v10i2.81
Published on 31 Dec 2019.
Peer Reviewed

Downloads

  • PDF (EN)

  • Appendix (EN)

    comments powered by Disqus