23.3k views
0 votes
1. In the on-line convex-hull problem, we are given the set Q of n points one point at a time. After receiving each point, we compute the convex hull of the points seen so far. Obviously, we could run Graham’s scan once for each point, with a total running time of O(n2lg n). Show how to solve the on-line convex-hull problem in a total of O(n2) time.

2. Show how to implement the incremental method for computing the convex hull of n points so that it runs in O(n lg n) time.

User Glautrou
by
7.6k points

1 Answer

2 votes
if its 1 or 2 then 2 hope i helped
User Czchen
by
8.0k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories