DMS Graduate Student Seminar

Abstract: What is the shortest path between two sets? Geometric analysis gives a way to describe such paths in terms of a partial differential equation. Approaching the shortest path by a gradient descent is difficult when faced with the subtle boundary condition that the endpoints of the curves must remain in the given sets, so I will describe a semi-discrete approach. Computer simulations and animations lead to some interesting conjectures.