tag:blogger.com,1999:blog-4037954350464998026.post5213418482163572025..comments2018-03-08T01:34:01.906-08:00Comments on Julian Johnson's Blog: Dart Throw UpdateJulian Johnsonhttp://www.blogger.com/profile/04541438042345099926noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-4037954350464998026.post-17155581505371944212009-10-01T02:46:33.410-07:002009-10-01T02:46:33.410-07:00Hi Ahmidou,
That's a really interesting paper...Hi Ahmidou,<br /><br />That's a really interesting paper! I hadn't seen it. I'll certainly look at how feasible an implementation is.<br /><br />At the moment, I'm using a very naive hybrid technique where random polygons are selected with a probability depending on polygon area. Darts are thrown into that polygon and then the polygon and its neighbours are checked for radius collisions. It's quicker than 'pure' dart throwing but doesn't use any particularly advanced techniques. I was going to try and implement Dunbar and Humphreys Scalloped Sectors next but the paper you've suggested looks excellent.<br /><br />This particular version is kind of 'quick enough' for now - it just needs some kind of abort threshold when the number of failed throws reaches a certain level and iterating any more becomes pointless.Julian Johnsonhttps://www.blogger.com/profile/04541438042345099926noreply@blogger.comtag:blogger.com,1999:blog-4037954350464998026.post-59306778124016216422009-10-01T02:13:11.862-07:002009-10-01T02:13:11.862-07:00Hi Julian
Thanks for sharing your work, it's v...Hi Julian<br />Thanks for sharing your work, it's very generous!<br />specialy this one, I wanted to implement a poisson disks generation, but didn't found the time. some month ago I found this paper that seems to be the more efficient way:<br />2009.EGF.Cline.PoissonOnSurfaces.pdf<br />Is it the one you are using?Ahmidouhttps://www.blogger.com/profile/10438526621029161045noreply@blogger.com