Affiliation:
1. Univ. of Illinois, Urbana
Abstract
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
).
Publisher
Association for Computing Machinery (ACM)
Cited by
89 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献