<s>
In	O
computational	O
geometry	O
,	O
the	O
method	O
of	O
rotating	B-Algorithm
calipers	I-Algorithm
is	O
an	O
algorithm	O
design	O
technique	O
that	O
can	O
be	O
used	O
to	O
solve	O
optimization	O
problems	O
including	O
finding	O
the	O
width	O
or	O
diameter	O
of	O
a	O
set	O
of	O
points	O
.	O
</s>
<s>
The	O
method	O
of	O
rotating	B-Algorithm
calipers	I-Algorithm
can	O
be	O
interpreted	O
as	O
the	O
projective	O
dual	O
of	O
a	O
sweep	B-Algorithm
line	I-Algorithm
algorithm	I-Algorithm
in	O
which	O
the	O
sweep	O
is	O
across	O
slopes	O
of	O
lines	O
rather	O
than	O
across	O
-	O
or	O
-coordinates	O
of	O
points	O
.	O
</s>
<s>
The	O
rotating	B-Algorithm
calipers	I-Algorithm
method	O
was	O
first	O
used	O
in	O
the	O
dissertation	O
of	O
Michael	O
Shamos	O
in	O
1978	O
.	O
</s>
<s>
Godfried	O
Toussaint	O
coined	O
the	O
phrase	O
"	O
rotating	B-Algorithm
calipers	I-Algorithm
"	O
and	O
also	O
demonstrated	O
that	O
the	O
method	O
was	O
applicable	O
in	O
solving	O
many	O
other	O
computational	O
geometry	O
problems	O
.	O
</s>
<s>
Shamos	O
gave	O
following	O
algorithm	O
in	O
his	O
dissertation	O
(	O
pp	O
77	O
–	O
82	O
)	O
for	O
the	O
rotating	B-Algorithm
calipers	I-Algorithm
method	O
that	O
generated	O
all	O
antipodal	O
pairs	O
of	O
vertices	O
on	O
convex	O
polygon	O
:	O
</s>
<s>
Pirzadeh	O
describes	O
various	O
applications	O
of	O
rotating	B-Algorithm
calipers	I-Algorithm
method	O
.	O
</s>
