Guozhao Wang
Abstract
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.The new algorithm can avoid the problem of superposition of extreme points.The algorithm not only reaches the theoretical lower bound of O(nlnn),but also is very simple and easy to be realized.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper improves the fast convex hull algorithm of planar point set based on sorted simple polygon.The new algorithm can avoid the problem of superposition of extreme points.The algorithm not only reaches the theoretical lower bound of O(nlnn),but also is very simple and easy to be realized.
Key concepts: Planar, Algorithm, Convex hull, Simple (philosophy), Extreme point, Point (geometry), Polygon (computer graphics), Set (abstract data type)