@article {
author = {Borna, Keivan},
title = {Sweep Line Algorithm for Convex Hull Revisited},
journal = {Journal of Algorithms and Computation},
volume = {51},
number = {1},
pages = {1-14},
year = {2019},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2019.71276},
abstract = {Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and important problems of computational geometry. In this paper a new algorithm is presented for computing the convex hull of a set of random points in the plane by using a sweep-line strategy. The sweep-line is a horizontal line that is moved from top to bottom on a map of points. Our algorithm is optimal and has time complexity $O(nlogn)$ where $n$ is the size of input.},
keywords = {convex hull,sweep-line method,computational geometry,graham scan,time complexity,Performance},
url = {https://jac.ut.ac.ir/article_71276.html},
eprint = {https://jac.ut.ac.ir/article_71276_3582cee25a2b43cca2ab21531a548870.pdf}
}