Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2023
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2304.04196 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866929280144900096 |
|---|---|
| author | Heydari, Mohammad Khalifeh, Ashkan |
| author_facet | Heydari, Mohammad Khalifeh, Ashkan |
| contents | The present paper is concerned with a recursive algorithm as a preprocessing step to find the convex hull of $n$ random points uniformly distributed in the plane. For such a set of points, it is shown that eliminating all but $O(\log n)$ 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) |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_04196 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | A simple and efficient preprocessing step for convex hull problem Heydari, Mohammad Khalifeh, Ashkan Data Structures and Algorithms The present paper is concerned with a recursive algorithm as a preprocessing step to find the convex hull of $n$ random points uniformly distributed in the plane. For such a set of points, it is shown that eliminating all but $O(\log n)$ 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) |
| title | A simple and efficient preprocessing step for convex hull problem |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2304.04196 |