Javascript must be enabled

# Shahar Kovalsky : Bending cubes with optimization and computational geometry

Problems in computational geometry, such as parameterizing a surface or computing shape deformation under geometric constraints, pose various challenges. I will give brief overview of related problems, highlighting the link between discrete differential geometry, optimization and computer graphics. Then, we will see how convex optimization can be used to approximate a specific class of geometric problems, that include shape mapping, bending a cube (https://youtu.be/iOwPGG5-54Q) and perhaps matching lemur teeth.

**Category**: Graduate/Faculty Seminar**Duration**: 01:14:45**Date**: March 6, 2017 at 11:55 AM**Views**: 124-
**Tags:**seminar, Graduate/faculty Seminar

## 0 Comments