Explores inverse design optimization in geometric computing, covering topics such as deployable structures, material-aware design, and programmed materials.
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
