I’m a Computer Science PhD student at Carnegie Mellon University, advised by Keenan Crane. My research is in applied geometry, designing new algorithms to process geometric data like 3D meshes or point clouds. I apply these techniques to solve geometric problems in computer graphics/vision, scientific computing, and computational fabrication. My work is currently supported by an NSF Graduate Research Fellowship.

Previously, I was an undergraduate at Virginia Tech, where I worked with T.M. Murali on computational systems biology, and was active in competitive programming. Outside of work, I’m a big fan of long-distance running, hockey, and cooking.

Research

The Vector Heat Method

Nicholas Sharp, Yousuf Soliman, Keenan Crane

ACM Trans. on Graph. (conditionally accepted)

We show that parallel transport is effectively computed via short-time heat flow. In turn, this leads to efficient algorithms for velocity extension, computing the log map, and much more.

Good surface cuts are short, yet allow a shape to be flattened with little distortion. Here, we show shape optimization can be applied to the Yamabe equation to directly compute smooth cuts with arbitrarily low distortion.

A C++ viewer and user interface for the rapid prototyping and debugging of geometric algorithms in 3D geometry processing. The lofty objective of Polyscope is to offer a useful visual interface to your data via a single line of code.

A modern C++ codebase providing the low-level tools to implement algorithms in geometry processing, scientific computing, and computer graphics/vision, with a particular focus on the geometry of surfaces.