Jump to content

Talk:Diamond-square algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Paxinum (talk | contribs) at 09:45, 19 February 2009 (Completely Wrong). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputing Start‑class
WikiProject iconThis article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.
WikiProject iconSystems: Chaos theory Start‑class Mid‑importance
WikiProject iconThis article is within the scope of WikiProject Systems, which collaborates on articles related to systems and systems science.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-importance on the project's importance scale.
Taskforce icon
This article is within the field of Chaos theory.

Random midpoint displacement method

This method seems to be also documented here:

http://www.cescg.org/CESCG97/marak/node3.html

and in the paper by

Fournier,A., Fussel,D., and Carpenter,L. 1982. Computer Rendering of Stochastic Models. Communications of the ACM, 25:371-384

NicholasKinar (talk) 04:38, 20 June 2008 (UTC)[reply]


Journal Article Reference

I believe that there is a journal article on the method described on this page. The algorithm described here appears to be one of the algorithms discussed by Gavin S.P. Miller. Here is a reference to the original paper (also given in the web-links):

Miller, G.S.P. 1986. The Definition and Rendering of Terrain Maps. SIGGRAPH '86: Proceedings of the 13th annual conference on Computer graphics and interactive techniques, Dallas, August 18-22. Volume 20(4): 39-48.

Could someone either create a new page based on the square-square algorithm?

Then, perhaps someone could add in the details of the diamond-square algorithm. References are given in the paper above.

NicholasKinar (talk) 01:47, 20 June 2008 (UTC)[reply]


Completely Wrong

This leaves out the diamond in the diamond-square algorithm.  :| —Preceding unsigned comment added by 24.176.245.100 (talk) 01:29, 15 June 2008 (UTC)[reply]

Yeah - the algorithm described is not the diamond-square algorithm at all. The first external link is the only useful thing on the page. 70.232.164.111 (talk) 06:54, 19 June 2008 (UTC)[reply]


I agree, I find that the algorithm is not the same as described. Paxinum (talk) 09:45, 19 February 2009 (UTC)[reply]

Redirect

Hi! Can someon please take a look at this page, and maybe redirect things like "Plasma fractal" to here? I'm still new to the wiki system, but Im learning. If there is a need for more images, I have software that can generate such. Paxinum 13:34, 3 April 2007 (UTC)[reply]

Diamond-square and plasma

The article don't point out a little difference between the diamond-square algorithm and the plasma algorithm. The latter is the algorithm described in this article, while the former compute the midpoints of the sides as average on the "diamond", as described in Diamond squares algorithm (that should be merged or split) and in this reference from the article. --Banus 18:12, 24 September 2007 (UTC)[reply]