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

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 redu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 481; s. 128931
Hlavní autoři: Hoang, Nam-Dũng, Linh, Nguyen Kieu, Phu, Hoang Xuan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 15.11.2024
Témata:
Convex hull
Linear time algorithm
Orienting curves
Quickhull algorithm
Linear time algorithm
68Q25
Convex hull
Orienting curves
52B55
65Y20
65D18
Quickhull algorithm
ISSN:0096-3003, 1873-5649
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2024.128931