Adjacent cells might self-select, but you can adjust the probability of self-selection to lower this risk as much as you like. Once selected, the cell owns the adjacent cells, by inhibiting their self-selection. (Maybe the inhibitor spreads further over time?). As self-selection continues, any gaps are filled in.
It reminds me of git's hashes. There's no absolute guarantee that different objects will have different hashes (since there are more possible objects than hashes), but it's pretty good in practice (and I guess/hope git has a secondary check for collisions). I really don't like these kinds of algorithms - they are just wrong - but I have to admit they work pretty well, by taking a likely guess instead of working it out exactly. eg ethernet also uses randomnness.
[+] [-] 6ren|15 years ago|reply
It reminds me of git's hashes. There's no absolute guarantee that different objects will have different hashes (since there are more possible objects than hashes), but it's pretty good in practice (and I guess/hope git has a secondary check for collisions). I really don't like these kinds of algorithms - they are just wrong - but I have to admit they work pretty well, by taking a likely guess instead of working it out exactly. eg ethernet also uses randomnness.
[+] [-] paulbaumgart|15 years ago|reply
[+] [-] sophacles|15 years ago|reply
[+] [-] onteria|15 years ago|reply
http://www.cmu.edu/news/archive/2011/January/jan13_fruitflyn...
[+] [-] joshrule|15 years ago|reply
Here's the supplemental materials: http://www.sciencemag.org/content/331/6014/183/suppl/DC1
Does anyone have a link to the actual paper?
[+] [-] tieTYT|15 years ago|reply
[+] [-] JoeAltmaier|15 years ago|reply
[+] [-] TheSOB88|15 years ago|reply