<s>
In	O
computer	B-General_Concept
science	I-General_Concept
,	O
an	O
output-sensitive	B-Language
algorithm	I-Language
is	O
an	O
algorithm	O
whose	O
running	O
time	O
depends	O
on	O
the	O
size	O
of	O
the	O
output	O
,	O
instead	O
of	O
,	O
or	O
in	O
addition	O
to	O
,	O
the	O
size	O
of	O
the	O
input	O
.	O
</s>
<s>
A	O
simple	O
example	O
of	O
an	O
output-sensitive	B-Language
algorithm	I-Language
is	O
given	O
by	O
the	O
division	B-Algorithm
algorithm	I-Algorithm
division	O
by	O
subtraction	O
which	O
computes	O
the	O
quotient	O
and	O
remainder	O
of	O
dividing	O
two	O
positive	O
integers	O
using	O
only	O
addition	O
,	O
subtraction	O
,	O
and	O
comparisons	O
:	O
</s>
<s>
In	O
cases	O
where	O
Q	O
is	O
large	O
however	O
,	O
it	O
is	O
outperformed	O
by	O
more	O
complex	O
algorithms	O
such	O
as	O
long	B-Algorithm
division	I-Algorithm
.	O
</s>
<s>
Convex	B-Algorithm
hull	I-Algorithm
algorithms	I-Algorithm
for	O
finding	O
the	O
convex	O
hull	O
of	O
a	O
finite	O
set	O
of	O
points	O
in	O
the	O
plane	O
require	O
Ω(n log n )	O
time	O
for	O
n	O
points	O
;	O
even	O
relatively	O
simple	O
algorithms	O
like	O
the	O
Graham	B-Algorithm
scan	I-Algorithm
achieve	O
this	O
lower	O
bound	O
.	O
</s>
<s>
If	O
the	O
convex	O
hull	O
uses	O
all	O
n	O
points	O
,	O
this	O
is	O
the	O
best	O
we	O
can	O
do	O
;	O
however	O
,	O
for	O
many	O
practical	O
sets	O
of	O
points	O
,	O
and	O
in	O
particular	O
for	O
random	O
sets	O
of	O
points	O
,	O
the	O
number	O
of	O
points	O
h	O
in	O
the	O
convex	O
hull	O
is	O
typically	O
much	O
smaller	O
than	O
n	O
.	O
Consequently	O
,	O
output-sensitive	B-Language
algorithms	I-Language
such	O
as	O
the	O
ultimate	B-Algorithm
convex	I-Algorithm
hull	I-Algorithm
algorithm	I-Algorithm
and	O
Chan	B-Algorithm
's	I-Algorithm
algorithm	I-Algorithm
which	O
require	O
only	O
O(n log h )	O
time	O
are	O
considerably	O
faster	O
for	O
such	O
point	O
sets	O
.	O
</s>
<s>
Output-sensitive	B-Language
algorithms	I-Language
arise	O
frequently	O
in	O
computational	O
geometry	O
applications	O
and	O
have	O
been	O
described	O
for	O
problems	O
such	O
as	O
hidden	B-Algorithm
surface	I-Algorithm
removal	I-Algorithm
and	O
resolving	O
range	O
filter	O
conflicts	O
in	O
router	O
tables	O
.	O
</s>
<s>
Frank	O
Nielsen	O
describes	O
a	O
general	O
paradigm	O
of	O
output-sensitive	B-Language
algorithms	I-Language
known	O
as	O
grouping	O
and	O
querying	O
and	O
gives	O
such	O
an	O
algorithm	O
for	O
computing	O
cells	O
of	O
a	O
Voronoi	B-Architecture
diagram	I-Architecture
.	O
</s>
<s>
A	O
more	O
general	O
kind	O
of	O
output-sensitive	B-Language
algorithms	I-Language
are	O
enumeration	B-Algorithm
algorithms	I-Algorithm
,	O
which	O
enumerate	O
the	O
set	O
of	O
solutions	O
to	O
a	O
problem	O
.	O
</s>
