# Theta*: smoother pathfinding
the2nake 6 min read
An extension on the A* pathfinding algorithm that creates less complex paths by skipping certain nodes using a line-of-sight check with line rasterisation.
An extension on the A* pathfinding algorithm that creates less complex paths by skipping certain nodes using a line-of-sight check with line rasterisation.
Hash grid data structure description and implementation concerns. It greatly improves collision detection efficiency using a divide-and-conquer approach.