Suppose, the convex hull is a triangle and all the nonextreme points are interior to the triangle then is it possible that quick hull runs in linear time?
Asked
Active
Viewed 107 times
1 Answers
0
Take a look at the wikipedia page. What you are referring to is an output sensitive convex hull algorithm. Small number of hull points result in near linear time algorithms. Same with Akl–Toussaint heuristic.
Nuclearman
- 5,029
- 1
- 19
- 35