A simple and efficient preprocessing step for convex hull problem
Data Structures and Algorithms
2024-03-19 v1
Abstract
The present paper is concerned with a recursive algorithm as a preprocessing step to find the convex hull of random points uniformly distributed in the plane. For such a set of points, it is shown that eliminating all but of points can derive the same convex hull as the input set. Finally it will be shown that the running time of the algorithm is $O(n)
Cite
@article{arxiv.2304.04196,
title = {A simple and efficient preprocessing step for convex hull problem},
author = {Mohammad Heydari and Ashkan Khalifeh},
journal= {arXiv preprint arXiv:2304.04196},
year = {2024}
}