主讲人：罗峰 教授（美国罗格斯大学）

时  间：6月12日（周三）16：00-17：00

地  点：威尼斯欢乐娱人城1099北二区教学楼133教室

备  注：Abstract: The classical Minkowski problem tries to find convex polytopes whose unit normals and codimension-1 face areas are given. Minkowski solved the problem for compact case and Alexandrov solved it for non-compact case. We will address the algorithmic and computational aspect of constructing the compact convex polytopes using variational principles. Relationship to discrete optimal transport and discrete Monge-Ampere equation will be discussed. This is a joint work with David Gu, Jian Sun, and S.-T.Yau.