Clear questions and runnable code get the best and fastest answer 

PerlMonks 
comment on 
( #3333=superdoc: print w/replies, xml )  Need Help?? 
Some explaining:
A finite number of Voronoi points (vpoints) are distributed on a plane. Each vpoint has an associated neighborhood (vhood). The vhood is the set of points nearer to the vpoint than any other vpoint. To shade the vhoods, I find the distances to the nearest two vpoints and divide the smallest distance by the next smallest distance ($best / $good). This number will always be between 0 and 1. Points in the middle of a vhood will be close to 0, points near the edge will be close to 1, being nearly the same distance from both points. Multiplying by 10 and using the integer result gives an index to the @CHARS array. Random vpoints are added in the square with corners at (0,0) and (1,1). To achieve wrapping additional vpoints are added in the eight surrounding squares.
So for vpoint (.2, .3), these points are added:
To see just the borders use: For stripes:
In reply to Re: Perl Spots
by YuckFoo

