<s>
Quickhull	B-Algorithm
is	O
a	O
method	O
of	O
computing	O
the	O
convex	O
hull	O
of	O
a	O
finite	O
set	O
of	O
points	O
in	O
n-dimensional	O
space	O
.	O
</s>
<s>
It	O
uses	O
a	O
divide	B-Algorithm
and	I-Algorithm
conquer	I-Algorithm
approach	I-Algorithm
similar	O
to	O
that	O
of	O
quicksort	B-Algorithm
,	O
from	O
which	O
its	O
name	O
derives	O
.	O
</s>
<s>
N-dimensional	O
Quickhull	B-Algorithm
was	O
invented	O
in	O
1996	O
by	O
C	O
.	O
Bradford	O
Barber	O
,	O
David	O
P	O
.	O
Dobkin	O
,	O
and	O
Hannu	O
Huhdanpaa	O
.	O
</s>
<s>
It	O
was	O
an	O
extension	O
of	O
Jonathan	O
Scott	O
Greenfield	O
's	O
1990	O
planar	O
Quickhull	B-Algorithm
algorithm	O
,	O
although	O
the	O
1996	O
authors	O
did	O
not	O
know	O
of	O
his	O
methods	O
.	O
</s>
