An efficient planar incremental convex hull algorithm to find the edges of the boundary polygon of the convex hull of a set of points
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 complexity for construction of the convex hull is...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Science, University of Peradeniya, Sri Lanka
2021-09-01
|
| Series: | Ceylon Journal of Science |
| Subjects: | |
| Online Access: | https://cjs.sljol.info/articles/7907 |