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: | K. R. Wijeweera, S. R. Kodituwakku, M. A. P. Chamikara |
---|---|
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 |
Similar Items
-
An approach for line clipping against a convex polyhedron
by: K. R. Wijeweera, et al.
Published: (2016-11-01) -
An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
by: K. R. Wijeweera, et al.
Published: (2021-09-01) -
Convex partitioning of a polygon into smaller number of pieces with lowest memory consumption
by: K. R. Wijeweera, et al.
Published: (2017-03-01) -
Line Clipping in 2D: Overview, Techniques and Algorithms
by: Dimitrios Matthes, et al.
Published: (2022-10-01) -
A simple algorithm for calculating the area of an arbitrary polygon
by: K.R. Wijeweera, et al.
Published: (2017-06-01)