Quicklists
Javascript must be enabled

Shahar Kovalsky : Bending cubes with optimization and computational geometry (Mar 6, 2017 11:55 AM)

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.

Add to Favorites

Please select playlist name from following

Create new playlist

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video