After 8 years of this video being published, I am watching it and it still feels great. Those few words at first got the potential of the whole video. The pattern of the green areas gave me an idea of how to generate settlements and connect them via roads.

Yes it's the same due to seeds based on coordinates.

Thanks! Old video, but sometime this year I'll be releasing this framework as open source and make more in-depth materials about it.

I'm not quite sure I understand the question. It works like this: As part of upgrading cell A from layer 0 to layer 1, it will look at its own initial points as well as the initial points of the 8 neighbor cells. It then calculates adjusted points for itself. These do not replace the initial points; the initial points are still kept around. If later some neighbor cell to A (let's call it B) need to be upgraded to level 1 as well, it will look at the initial points of itself and its neighbors. Note that even though A had adjusted points calculated, B will still only look at the initial points of A, not the adjusted ones. This avoids non-deterministic calculations that would be different depending on the order different cells are upgraded in. It also means all cells must keep all data calculated at each level.

runevision Thanks that's helpful.

en.wikipedia.org/wiki/Delaunay_triangulation

+Arcane Ingenuity Yeah it's Unity and within the editor. I'm using the GL class for drawing the lines.

delaunay triangulation method could help

+FernestHall For every point in the current chunk I calculate an adjustment vector. Then the new point is the old point plus the that vector. The vector is calculated by comparing the point will all the other points in this chunk and neighboring chunks. For each pair I calculate the distance between them. I have a max distance beyond which there is no effect. If smaller than the max dist, the point is pushed away from the other point by a distance that is 0.4 times the max distance if the points are practically overlapping, and 0 if they are max distance away from each other. The push distance is a linear interpolation between those. The point is not pushed right away but the push vector added to the adjustment vector. There is no order dependency this way, neither for the order of points considered or the order of chunks calculated.

+daddy484 The initial points are generated as random number produced by a hash function. See my article here for more details on random numbers and hash functions: www.gamasutra.com/blogs/RuneSkovboJohansen/20150105/233505/A_Primer_on_Repeatable_Random_Numbers.php

I'll take a look, thank you very much.

nearly 10 years later. Hi

Yeah the principles are independent from the number of dimensions.

Dominik Seifert Actually, while I did try out Delaunay Triangulation for this, but ended up with a simpler custom solution.

You said it in the video. Can you comment on it some more? Maybe even post some code or pseudocode?

Dominik Seifert Ah, well I changed it later anyway. Now it's just: 1) A minimum spanning tree for the points inside the current cell. 2) For each of the neighbor cells: - The shortest connection possible between a point in the current cell and in the neighbor cell.

Do you just bruteforce it? (Seeing how you have max 3 pts/cell, that seems rather feasible)

Dominik Seifert Yep, no reason to try something more clever for this small amount of points.

Using a hash function. For more info, see this article: www.gamasutra.com/blogs/RuneSkovboJohansen/20150105/233505/A_Primer_on_Repeatable_Random_Numbers.php

@@martian17 No, that's exactly the issue that the layer-based approach solves. For each cell you have the points before relaxation and after relaxation. Calculation of relaxed points for a cell requires the unrelaxed points for that cell plus its neighbors. But the relaxed points never feed into other calculations of relaxation. The cell keeps the unrelaxed points also after calculating the relaxed points. The relaxed points is new data, not modification of existing data. It's a one-way dependency, and works deterministically the same way for a given cell every time.

No, eve online has a fixed map. Perhaps first generated and then altered to make it more interesting with dead ends and choke points. But sure you can create something similar with this in an infinite form, but the more detail you need the more of these chunks you need to have loaded.

***** Where can I find the minecraft source code?

+BiiXteR Gaming Erm, you can't! Notch has written a blog about the terrain generation in Minecraft though - no source code obviously, but he explains very well. Search for "The Word of Notch" and his blog. You'll find it at the bottom of all his other blogs! :)

Lewis B Yes I found that after I wrote this comment, however he never made more parts of it :(

I'd much rather know the arcane secrets Toady One had to unravel to power the procedural generation in Dwarf Fortress.

I'm not sure what you're referring to?

Nvm, i remember seeing tour game on a vr newsday.