There are some differences in the actual implementation (e.g., I usually encode one row per int/short/byte, so vertical adjacency is by index in an array and horizontal adjacency by bit-shift), but the general idea is the same. My code is not open source and I don't directly know good references on basic mathematical morphology by heart (most of my knowledge is from nearly 20 year old university course material). However if you just look up literature on mathematical morphology for image processing I think there should be plenty. Perhaps others can pitch in; I'm fairly sure I wasn't the first to use a fast bitboard representation for Go.
Erik On Sat, May 24, 2014 at 3:03 PM, Cameron Browne <[email protected]> wrote: >> From: Erik van der Werf <[email protected]> >> >> This is not new; I've been using algorithms like this in my Go >> programs for well over a decade. Anyone with some practical experience >> in binary image processing should know basic operations for dilation, >> erosion, growing objects under a mask, etc. > > Hi Erik, > > Thanks for the info. Were they algorithms like this or this actual algorithm? > Do you have any links to literature or code I can follow up? > > Thanks, > Cameron > > _______________________________________________ > Computer-go mailing list > [email protected] > http://dvandva.org/cgi-bin/mailman/listinfo/computer-go _______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
