Circular Obstacle Pathfinding
Summary
The article explains A* pathfinding around circular obstacles by building a tangent visibility graph composed of surfing and hugging edges, with internal/external bitangents. It covers line-of-sight checks, Minkowski expansion for variable radius, and on-demand graph generation to improve performance.