 In the planar case, the algorithm combines an formula_5 algorithm (Graham scan, for example) with Jarvis march (formula_6), in order to obtain an optimal formula_3 time.Chan's algorithm is notable because it is much simpler than the Kirkpatrick–Seidel algorithm, and it naturally extends to 3-dimensional space.This paradigm has been independently developed by Frank Nielsen in his Ph.D. thesis.