学术报告《efficient algorithms and data structures for geometric computing》-j9登录网址

南京大学计算机科学与技术系

软件新技术与产业化协同创新中心

摘 要：

geometric data is ubiquitous nowadays, and is becoming more and more complex. effectively analyzing and processing such data is an important and challenging task. this leads to the need of developing efficient algorithms and data structures for solving computational problems on geometric datasets, which is the main subject of the field computational geometry. my research mainly focuses on designing geometric algorithms and data structures that can be theoretically proved to have good performances. these algorithms and data structures are usually more reliable, more robust, and hence more preferable than the ones without theoretical guarantees. in this talk, i will give an overview of some important problems in computational geometry as well as several state-of-the-art algorithms and data structures for these problems developed by me and other coauthors.

报告人简介:

jie xue is currently a postdoctoral scholar at the university of california, santa barbara. he received his ph.d. degree in computer science with a minor in math from the university of minnesota, twin cities, in 2019. his main research area is computational geometry, with a particular focus on designing (theoretical) algorithms and data structures for solving geometric problems. his work has been published in various top venues in computational geometry and algorithms, such as socg, soda, dcg, jocg, etc.

时间:12月13日（星期日）10:00-11:00

zoom link          密码：2020

https://us02web.zoom.us/j/5221214665