# A faster way to build an occupancy grid
the2nake 9 min read
An optimisation I devised to speed up occupancy grid generation by several orders of magnitude. Part of my work for ARV during 2025-26.
An optimisation I devised to speed up occupancy grid generation by several orders of magnitude. Part of my work for ARV during 2025-26.
Most of my work for U-M ARV until February 2026. We used, among other techniques, RANSAC and point clouds to segment obstacles from the ground.
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.
FLuid Implicit Particle technique in C with SDL. This is underlying work for a clone of the fluid simulation pendant by mitxela.