学科前沿知识讲座

2017年01月05日 15:37  点击:[]

报告人:顾险峰教授纽约州立大学石溪分校
题目:Geometric Methods for VR/AR Applications

时间:1月6日下午15:30-16:15
地点:软件学院教学楼B202

参加人员:数媒系大二、大三、中日大二大三的本科生,其它师生自愿参加。参加学生带好讲座卡。

内容简介:Virtual Reality and Augmented Reality are developing rapidly, which have raised many fundamental technical problems. In order to tackle these challenges, profound geometric theories need to be applied. 
In this talk, several challenges and their solutions will be discussed, such as geometric compression based on optimal mass transportation and normal cycle theory; human expression capture based on Riemann surface and Teichmuller theory; mesh generation based on surface foliation theory  and so on.

讲座背景:随着时代的发展,科技的进步,虚拟现实和增强现实技术迅猛发展,为许多工程、医疗、教育领域带来革命性的改变。但是VRAR技术发展中依然存在许多瓶颈,例如几何数据的压缩、3维内容的生成、物理模拟所需要的网格生成和动态实时计算等等。这些挑战需要利用比较深入的现代几何理论和知识,同时需要复杂先进的计算机工程技巧。本期由纽约州立大学石溪分校的顾险峰教授来介绍一下应用计算共形几何的理论和算法来解决这些VRAR中基本问题的最新进展,下一步的挑战。欢迎有志青年一同参与到VRAR发展的时代洪流之中。

报告人简介:顾险峰,清华大学计算机系学士,哈佛大学博士,师承国际著名数学大师丘成桐先生。现为美国纽约州立大学石溪分校计算机系终身教授,曾获美国NSFCAREER奖,中国海外杰青,“华人菲尔兹奖”-晨兴应用数学金奖等。顾险峰教授团队将微分几何、代数拓扑、黎曼面理论,偏微分方程与计算机科学相结合,创立跨领域学科“计算共形几何”,并广泛应用于计算机图形学,计算机视觉,三维几何建模与可视化,无线传感网络,医学图像等领域。

 

 

报告人:斯航研究员(柏林维尔斯特拉斯研究所)

题目:On 3d Irreducible and Indecomposable Polyhedra and the Number of Interior Steiner Points

时间:1月6日下午16:10-17:00
地点:软件学院教学楼B202

参加人员:数媒系大二、大三、中日大二大三的本科生,其它师生自愿参加。参加学生带好讲座卡。

简介:The topic of this talk is mainly motivated by the boundary recovery problem in tetrahedral mesh generation, in which a given set of constraints, edges and faces, is required to be represented by the generated tetrahedral mesh.

A theoretical difficulty in this problem is the existence of 3d (non-convex) indecomposable polyhedra, whose interior cannot be decomposed into a set of tetrahedra with its own vertices, such as the well-known Sch\“onhardt polyhedron. 

Although it is known that any indecomposable polyhedra can be tetrahedralised by inserting a certain number of additional points, so-called Steiner points, it remains a challenging problem, when the Steiner points can only be placed in the interior.

We call a 3d (non-convex) polyhedron irreducible if it cannot be cut into smaller regions without introducing additional vertices. 

In this talk, we focus on a class of 3d polyhedron which are both irreducible and indecomposable.  We present new class of such polyhedra obtained by studying some well-known examples, namely the Sch\“onhardt and Bagemihl polyhedra, and the Chazelle polyhedron. Optimal number of Steiner points and efficient algorithm are presented to tetrahedralize these polyhedra.

报告人简介:Dr. Hang Si is a senior researcher in Weierstrass Institute (WIAS) in Berlin. His main research interest is mesh generation and the discrete and computational geometry problems behind it. The goal is to develop efficient algorithms for automatically generating meshes suitable for numerical methods such as finite element and finite volume methods. He is the developer of the software, TetGen -- a Delaunay-based tetrahedral mesh generator. It is freely available for academic use at http://www.tetgen.org.

Hang Si received his B.S. in Electrical Engineering from Hangzhou University (now merged in Zhejiang University) in 1994, and his M.S. in Computer Science from Zhejiang University in 2002. He joined the research group Numerical Mathematics and Scientific Computing of WIAS in 2002. He received his Ph.D from the Institute of Mathematics of Technische Universitaet Berlin in 2008.

For more recent work of Dr. Hang Si, please visit his website at: http://www.wias-berlin.de/people/si

 

 

 

上一条:有关2017届毕业设计第一次中期检查的通知 下一条:学科前沿知识讲座

关闭