Zobrazeno 1 - 10
of 13
pro vyhledávání: '"K. R. Wijeweera"'
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ceylon Journal of Science, Vol 50, Iss 3, Pp 261-268 (2021)
The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n). It has been proved that the lower bound of time
Externí odkaz:
https://doaj.org/article/f8fff47d164241e999c9085ab6fb1003
Publikováno v:
Ruhuna Journal of Science, Vol 10, Iss 2, Pp 161-173 (2019)
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 gi
Externí odkaz:
https://doaj.org/article/6f621b77ec7b4a9195266806cea892c4
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ceylon Journal of Science, Vol 47, Iss 2, Pp 165-174 (2018)
The convex hull of a planer set of points can be defined as the set of vertices of the smallest convex polygon containing all the points. If S is a planer set of points then convex layers of S can be derived by iteratively computing the convex hull o
Externí odkaz:
https://doaj.org/article/cc00a073e3944238afeff54896c75026
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ceylon Journal of Science, Vol 46, Iss 1, Pp 55-66 (2017)
Designing an algorithm to deal with a convex shape is easier than that for a concave shape. Efficient algorithms are required to process concave shapes, because every application does not deal with convex shapes. An alternative approach is to first t
Externí odkaz:
https://doaj.org/article/6405f3ec65d343878cf0d31a72eddf1e
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ruhuna Journal of Science, Vol 7, Iss 1, Pp 12-20 (2016)
Line clipping operation is a bottleneck in most of computer graphics applications. There are situations when millions of line segments need to be clipped against convex polyhedrons with millions of facets. An algorithm to clip line segments against a
Externí odkaz:
https://doaj.org/article/ccac2f1bf24e481286037aea2bcc8753
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ceylon Journal of Science, Vol 45, Iss 3, Pp 65-76 (2016)
Polygons can conveniently represent real world objects. In automatic character recognition, shapes of individual letters are represented by polygons. In robotics, obstacles are represented using polygons. In computer graphics programming, solid objec
Externí odkaz:
https://doaj.org/article/84c69012fb9c4033811c2893a76a1990
Autor:
S. R. Kodituwakku, K. R. Wijeweera
Publikováno v:
Ceylon Journal of Science, Vol 50, Iss 3, Pp 261-268 (2021)
The definition of the convex hull of a set of points is the smallest convex set containing all the points. Many algorithms have been proposed with the worst case time complexity is equal to O (n log n). It has been proved that the lower bound of time
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20d2f92fe08c760cf9cb149a2a8b90e9
https://doi.org/10.4038/cjs.v50i3.7907
https://doi.org/10.4038/cjs.v50i3.7907
Autor:
K. R. Wijeweera, S. R. Kodituwakku
Publikováno v:
Ruhuna Journal of Science, Vol 8, Iss 1, Pp 67-75 (2017)
Computing the area of an arbitrary polygon is a popular problem in pure mathematics. The two methods used are Shoelace Method (SM) and Orthogonal Trapezoids Method (OTM). In OTM, the polygon is partitioned into trapezoids by drawing either horizontal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb9c751fda9f340a4909b4ad1c9b78d1
http://rjs.ruh.ac.lk/index.php/rjs/article/view/123/171
http://rjs.ruh.ac.lk/index.php/rjs/article/view/123/171
Autor:
S. R. Kodituwakku, K. R. Wijeweera
Publikováno v:
Ceylon Journal of Science, Vol 46, Iss 1, Pp 55-66 (2017)
Designing an algorithm to deal with a convex shape is easier than that for a concave shape. Efficient algorithms are required to process concave shapes, because every application does not deal with convex shapes. An alternative approach is to first t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66759ff8864d7a18a767111388ff5a7c
https://cjs.sljol.info/articles/7418
https://cjs.sljol.info/articles/7418
Publikováno v:
Ruhuna Journal of Science, Vol 10, Iss 2, Pp 161-173 (2019)
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 a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cb2cc2f2d91f9ee4d03009bfcc525a4
https://doi.org/10.4038/rjs.v10i2.81
https://doi.org/10.4038/rjs.v10i2.81