[computer-go] Incrementally recognizing regions of empty space

[Arthur Cater]

On Monday, September 25, 2006, at 05:00 AM, House, Jason J. wrote:
<snip>
> Any methods for clumping empty regions into what a human would notice? 
> (Long strings of touching empty points, large oval/rectangular clumps 
> of empty points, areas that are essentially cut such as a bamboo > joint)
> Erosion? (computer vision sense... like the bouzy algorithm)
>  
> _______________________________________________
> computer-go mailing list
> computer-go at computer-go.org
> http://www.computer-go.org/mailman/listinfo/computer-go/
>
I wrote this conference poster paper a couple of years ago which is 
concerned with loosely-bounded regions,
I tried to distinguish what I called  "corridor voids" and "bulb 
voids". Briefly, empty regions may be bounded by
rings of black, or white, or dont-care colour stones, and the edge of 
course. The rings may be discontinuous,
with different "degrees" of void having
a) one-point jump and/or keima and/or 2nd-line-to-edge,
b) the above plus two-point jump and/or ogeima and/or 3rd line
c) the above plus 4th-line

http://csiweb.ucd.ie/Staff/acater/papers/MindTheGap.pdf

I'm not happy with the implementation I have for it (not discussed in 
the paper), and my program
still has not progressed to the point where these voids are very 
useful, so take a pinch of salt ...

Arthur

-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: text/enriched
Size: 1518 bytes
Desc: not available
Url : http://computer-go.org/pipermail/computer-go/attachments/20060925/026a0caa/attachment.bin