计算几何与算法设计lecture.pptxVIP

Computational Geometry2D Convex Hulls (continued) Joseph S. B. Mitchell Stony Brook University O(n log n) : Incremental Construction Add points in the order given: v1 ,v2 ,…,vn Maintain current Qi = CH(v1 ,v2 ,…,vi ) Add vi+1 : If vi+1  Qi , do nothing Else insert vi+1 by finding tangencies, updating the hull Worst-case cost of insertion: O(log n) But, uses complex data structures 2 Point location test: O(log n) Binary search: O(log n) O(n log n) : Randomized Incremental Add points in random order Keep current Qi = CH(v1 ,v2 ,…,vi ) Add vi+1 : If vi+1  Qi , do nothing Else i