Octagonal and hexadecagonal cut algorithms for finding the convex hull of finite sets with linear time complexity

Nam-Dũng Hoang, Nguyen Kieu Linh and Hoang Xuan Phu

Applied Mathematics and Computation, 2024, vol. 481, issue C

Abstract: This paper is devoted to an octagonal cut algorithm and a hexadecagonal cut algorithm for finding the convex hull of n points in R2, where some octagon and hexadecagon are used for discarding most of the given points interior to these polygons. In this way, the scope of the given problem can be reduced significantly. In particular, the convex hull of n points distributed bleast-bmost-boundedly in some rectangle can be determined with the complexity O(n). Computational experiments demonstrate that our algorithms outperform the Quickhull algorithm by a significant factor of up to 47 times when applied to the tested data sets. The speedup compared to the CGAL library is even more pronounced.

Keywords: Convex hull; Linear time algorithm; Quickhull algorithm; Orienting curves (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324003928
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:481:y:2024:i:c:s0096300324003928

DOI: 10.1016/j.amc.2024.128931

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().