<s>
In	O
computational	O
geometry	O
,	O
the	O
largest	B-Algorithm
empty	I-Algorithm
sphere	I-Algorithm
problem	O
is	O
the	O
problem	O
of	O
finding	O
a	O
hypersphere	O
of	O
largest	O
radius	O
in	O
d-dimensional	O
space	O
whose	O
interior	O
does	O
not	O
overlap	O
with	O
any	O
given	O
obstacles	O
.	O
</s>
<s>
The	O
largest	B-Algorithm
empty	I-Algorithm
circle	I-Algorithm
problem	O
is	O
the	O
problem	O
of	O
finding	O
a	O
circle	O
of	O
largest	O
radius	O
in	O
the	O
plane	O
whose	O
interior	O
does	O
not	O
overlap	O
with	O
any	O
given	O
obstacles	O
.	O
</s>
<s>
The	O
problem	O
may	O
be	O
solved	O
using	O
Voronoi	B-Architecture
diagrams	I-Architecture
in	O
optimal	O
time	O
.	O
</s>
