Talk:Brownian tree: Difference between revisions
Content added Content deleted
No edit summary |
(Compare outputs?) |
||
| Line 2: | Line 2: | ||
: It's interesting, but I don't think it matters; there are enough differences between languages that a retrace step in the algorithm doesn't seem important. --[[User:Short Circuit|Michael Mol]] 16:38, 14 July 2010 (UTC) |
: It's interesting, but I don't think it matters; there are enough differences between languages that a retrace step in the algorithm doesn't seem important. --[[User:Short Circuit|Michael Mol]] 16:38, 14 July 2010 (UTC) |
||
: It does make a difference in the resulting tree: the adjacency strategy makes particles have a larger "cross section" for collisions, and it will probably cause a difference in the appearance of the tree. But an even stronger influence is where the particles are added to the field. —[[User:Kevin Reid|Kevin Reid]] 22:25, 19 July 2010 (UTC) |
: It does make a difference in the resulting tree: the adjacency strategy makes particles have a larger "cross section" for collisions, and it will probably cause a difference in the appearance of the tree. But an even stronger influence is where the particles are added to the field. —[[User:Kevin Reid|Kevin Reid]] 22:25, 19 July 2010 (UTC) |
||
:: Given a specific sequence of numbers to have fed out of the PRNG call (or using the same seed each time), it would be interesting to compare outputs from the two approaches. --[[User:Short Circuit|Michael Mol]] 15:53, 20 July 2010 (UTC) |
|||
Revision as of 15:53, 20 July 2010
Note that "collide" is not defined. In one implementation "collide" means that the particle lands on a fixed particle (and then its previous position is used). In another implementation (mine), "collide" means that the particle reaches a position adjacent to a fixed particle. I do not know if this ambiguity matters, but I thought I would mention it. --Rdm 11:54, 14 July 2010 (UTC)
- It's interesting, but I don't think it matters; there are enough differences between languages that a retrace step in the algorithm doesn't seem important. --Michael Mol 16:38, 14 July 2010 (UTC)
- It does make a difference in the resulting tree: the adjacency strategy makes particles have a larger "cross section" for collisions, and it will probably cause a difference in the appearance of the tree. But an even stronger influence is where the particles are added to the field. —Kevin Reid 22:25, 19 July 2010 (UTC)
- Given a specific sequence of numbers to have fed out of the PRNG call (or using the same seed each time), it would be interesting to compare outputs from the two approaches. --Michael Mol 15:53, 20 July 2010 (UTC)