Abstract: Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are ...

The goal of the first lesson is to render the wire mesh. To do this, we should learn how to draw line segments. We can simply read what Bresenham’s line algorithm is, but let’s write code ourselves.

GoRogue offers a few different line generation algorithms designed to help create "closest-fit" lines between two points on a grid. These include the (popular) Bresenham's line algorithm, a DDA ...