







I usually work with 2D map generation, in part because it’s easier, but also in part because I enjoy games with flat worlds + heightmaps more than I like games with sphere (curved) worlds. I’ve wanted to learn how to work with spheres so that I could make maps of entire planets, like I saw in this spherical voronoi map generation project[1] on and this spherical hexagon+pentagon map generation project[2] (both of those pages have fantastic screenshots). I decided ProcJam 2018[3] would be a good time to learn this.
Making Worlds: Introduction
In this multi-part series I try to make a procedural planet generator that runs on the GPU.

d3-delaunay/src/delaunay.js at main · d3/d3-delaunay
Compute the Voronoi diagram of a set of two-dimensional points. - d3/d3-delaunay
Delaunay triangulation
In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles whose circumcircles do not contain any of the points; that is, each circumcircle has its generating points on its circumference, but all other points in the set are outside of it. This maximizes the size of the smallest angle in any of the triangles, and tends to avoid sliver triangles.
Binary, Hanoi and Sierpinski, part 1
Quaternius • Free Game Assets
A library of hundreds of free Low Poly 3D Models, using the CC0 License.

PixelGuys/Cubyz
Voxel sandbox game with a large render distance, procedurally generated content and some cool graphical effects.

Binary, Hanoi, and Sierpinski, part 2

3D Terrain Maps
With spring about to arrive, it is time to end this series, get away from the computer, and go outside. I hope that you find the information useful!
Solar System Scope
Online 3D simulation of the Solar System and night sky in real time - the Sun, planets, dwarf planets, comets, stars and constellations

Tomb of Glowing Lava - How to Model Ultra Realistic Lava
Herbert Wolverson - Procedural Map Generation Techniques