projects

Implementation of a data structure for the dynamic lowest common ancestor (LCA) problem, based on Gabow's solution. The code is available on Github. There is also a writeup on the implementation and performance analysis, and a presentation with slides. This was a final project for 6.851 Advanced Data Structures (at MIT).

Visualization of an algorithm to compute the intersection of disks that intersect at the origin, via a series of duality transforms that reduce the problem to finding a convex hull. The code is available on Github. This was a final project for Comp163 Computational Geometry (at Tufts).