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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematics and computation Jg. 481; S. 128931
Hauptverfasser:	Hoang, Nam-Dũng, Linh, Nguyen Kieu, Phu, Hoang Xuan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 15.11.2024
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!