Challenges

Featured Challenge:
#51 — A* Pathfinding Algorithm

In this multi-part coding challenge, I attempt an implementation of the A* Pathfinding Algorithm to find the optimal path between two points in a 2D grid.

jan 16, 2017

A* Pathfinding Algorithm

Filter by Language

Pick a language to filter

Filter by Topic

spherical coordinates

It's the Mandelbulb! What happens when you take the original fractal (The Mandelbrot Set) and extend it into 3D space. And how do you visualize it in Processing (Java) as a point cloud?

The Mandelbulb

In this coding challenge, I use the "superformula" to make a 3D "supershape" in Processing. This is part 4 of a multi-part series on superformulas, superellipses and supershapes

3D Supershapes