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

Full description

Bibliographic Details

Published in:	Applied mathematics and computation Vol. 481; p. 128931
Main Authors:	Hoang, Nam-Dũng, Linh, Nguyen Kieu, Phu, Hoang Xuan
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.11.2024
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!