F. P. Preparata
Abstract
Open-access reader
An algorithm is described for the construction in real-time of the convex hull of a set of n points in the plane. Using an appropriate data structure, the algorithm constructs the convex hull by successive updates, each taking time O (log n ), thereby achieving a total processing time O ( n log n ).
OpenAlex reports 126 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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.
An algorithm is described for the construction in real-time of the convex hull of a set of n points in the plane. Using an appropriate data structure, the algorithm constructs the convex hull by successive updates, each taking time O (log n ), thereby achieving a total processing time O ( n log n ).
Key concepts: Convex hull, Output-sensitive algorithm, Hull, Orthogonal convex hull, Algorithm, Planar, Regular polygon, Convex combination