<s>
In	O
metric	O
geometry	O
,	O
the	O
Karlsruhe	B-Algorithm
metric	I-Algorithm
is	O
a	O
measure	O
of	O
distance	O
that	O
assumes	O
travel	O
is	O
only	O
possible	O
along	O
rays	O
through	O
the	O
origin	O
and	O
circular	O
arcs	O
centered	O
at	O
the	O
origin	O
.	O
</s>
<s>
The	O
name	O
alludes	O
to	O
the	O
layout	O
of	O
the	O
city	O
of	O
Karlsruhe	B-Algorithm
,	O
which	O
has	O
radial	O
streets	O
and	O
circular	O
avenues	O
around	O
a	O
central	O
point	O
.	O
</s>
<s>
Therefore	O
,	O
the	O
Karlsruhe	B-Algorithm
distance	O
between	O
two	O
points	O
is	O
the	O
minimum	O
of	O
the	O
two	O
lengths	O
that	O
would	O
be	O
obtained	O
for	O
these	O
two	O
types	O
of	O
path	O
.	O
</s>
