<s>
Snap	B-Algorithm
rounding	I-Algorithm
is	O
a	O
method	O
of	O
approximating	O
line	O
segment	O
locations	O
by	O
creating	O
a	O
grid	O
and	O
placing	O
each	O
point	O
in	O
the	O
centre	O
of	O
a	O
cell	O
(	O
pixel	O
)	O
of	O
the	O
grid	O
.	O
</s>
<s>
There	O
are	O
more	O
refined	O
algorithms	O
to	O
cope	O
with	O
some	O
of	O
these	O
issues	O
,	O
for	O
example	O
iterated	O
snap	B-Algorithm
rounding	I-Algorithm
guarantees	O
a	O
"	O
large	O
"	O
separation	O
between	O
points	O
and	O
non-incident	O
edges	O
.	O
</s>
