<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Diamond Square Algorithm</title><link>http://www.bing.com:80/search?q=Diamond+Square+Algorithm</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Diamond Square Algorithm</title><link>http://www.bing.com:80/search?q=Diamond+Square+Algorithm</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>Diamond-square algorithm - Wikipedia</title><link>https://en.wikipedia.org/wiki/Diamond-square_algorithm</link><description>The diamond-square algorithm is a method for generating heightmaps for computer graphics. It is a slightly better algorithm than the three-dimensional implementation of the midpoint displacement algorithm, which produces two-dimensional landscapes.</description><pubDate>Mon, 22 Jun 2026 07:16:00 GMT</pubDate></item><item><title>The Diamond Square Algorithm - 64bitdragon</title><link>https://learn.64bitdragon.com/articles/computer-science/procedural-generation/the-diamond-square-algorithm</link><description>The Diamond Square Algorithm Introduction The diamond square algorithm allows us to generate 2D heightmaps that can be used for terrain generation. It is an improvement on the 2D midpoint displacement algorithm, which can produce noticeable creases.</description><pubDate>Sat, 20 Jun 2026 05:31:00 GMT</pubDate></item><item><title>The Diamond–Square Algorithm | Every Algorithm</title><link>https://every-algorithm.github.io/2024/10/18/diamond-square_algorithm.html</link><description>The diamond–square algorithm is a procedural technique for generating heightmaps that appear to be rough and natural. It operates on a two‑dimensional grid of points and recursively refines the grid by alternately performing diamond and square steps. The basic idea is to start with a coarse grid defined by four corner values, then add a controlled amount of randomness while filling in the ...</description><pubDate>Mon, 22 Jun 2026 04:38:00 GMT</pubDate></item><item><title>The Diamond-Square Algorithm for Terrain Generation</title><link>https://janert.me/blog/2022/the-diamond-square-algorithm-for-terrain-generation/</link><description>The Diamond-Square Algorithm is the natural first stop for generating artificial landscapes. The algorithm itself is beautifully simple (more details below, and on its Wikipedia page). But a casual implementation ended up not working at all, prompting me to look for an existing implementation to learn from.</description><pubDate>Mon, 25 May 2026 22:15:00 GMT</pubDate></item><item><title>How to Create Terrain and Heightmaps using the Diamond-Square Algorithm ...</title><link>https://yonatankra.com/how-to-create-terrain-and-heightmaps-using-the-diamond-square-algorithm-in-javascript/</link><description>The diamond-square algorithm is a procedural terrain generation algorithm. It makes it easy to generate Heightmaps and Terrain for games. In this article we will implement the diamond-square algorithm in JavaScript, plot our terrain on a canvas and see how a player can interact with its various terrain types.</description><pubDate>Thu, 18 Jun 2026 22:51:00 GMT</pubDate></item><item><title>The Diamond-Square Algorithm</title><link>https://diamond-square.netlify.app/</link><description>The Diamond-Square Algorithm The Diamond-Square Algorithm Noise Scaling: 2</description><pubDate>Thu, 04 Jun 2026 19:11:00 GMT</pubDate></item><item><title>Diamond-Square Algorithm Explanation and C++ Implementation</title><link>https://medium.com/@nickobrien/diamond-square-algorithm-explanation-and-c-implementation-5efa891e486f</link><description>The Diamond-Square algorithm is a way to use 4 generated corner values of a 2 dimensional array to fill in the inner values with midpoint displacement. It’s popularity, and how I came to ...</description><pubDate>Thu, 09 Aug 2018 23:59:00 GMT</pubDate></item><item><title>Diamond Square Fractal Landscapes | sgp62, rbm244, hlg66</title><link>https://people.ece.cornell.edu/land/courses/ece5760/FinalProjects/s2022/sgp62_rbm244_hlg66/sgp62_rbm244_hlg66/index.html</link><description>The diamond square algorithm starts off with a 2D square grid of dimensions 2n+1 by 2n+1, where n is a positive integer. The four corners are initialized to some set of values (we decided to make them user inputs in our implementation).</description><pubDate>Sun, 21 Jun 2026 11:20:00 GMT</pubDate></item><item><title>Fundamentals of Terrain Generation</title><link>https://www.cs.cmu.edu/~112-n23/notes/student-tp-guides/Terrain.pdf</link><description>Diamond Square Algorithm: The Diamond Square algorithm generates terrain (i.e. hills) with a fractal approach. It starts with some random values that are spaced appart, then calculates the noise values in between by taking averages and adding some noise. The process is repeated many times until every cell has a noise value.</description><pubDate>Sun, 21 Jun 2026 04:04:00 GMT</pubDate></item><item><title>GitHub - crowgers/diamond_square: Diamond Square Algorithm for terrain ...</title><link>https://github.com/Crowgers/Diamond_Square</link><description>Diamond Square Algorithm for terrain generation. Contribute to crowgers/diamond_square development by creating an account on GitHub.</description><pubDate>Mon, 22 Jun 2026 20:09:00 GMT</pubDate></item></channel></rss>