Hervé Brönnimann, Ph.D.
Assistant Professor

Area of Studies

My research interests tend to revolve around algorithms and especially geometric algorithms. I am interested in theoretical issues (such as derandomization of geometric algorithms, the topic of my Ph.D. thesis), in the theoretical and practical study of issues arising from implementation (such as robustness) and in the implementation of the algorithms. I have participated in the development of the Computational Geometry Algorithms Library (CGAL).

Since joining the Polytechnic Institute of NYU, I have been collaborating with Profs. Aronov and Chiang about optimizing ray shooting in computer graphics; this was supported by an NSF ITR grant. My interests in geometric algorithms and their practical implementation are supported by an NSF Career grant.

Recently, I have also taken interest in data mining and data reduction (with Prof. Scheuerman of Northwestern University), network security (via the project Fornet, with Profs. Memon and Wein, supported by an NSF Cybertrust grant). My core interest in these collaborations lies in the development and engineering of efficient and practical algorithms and data structures.

Profile

Hervé Brönnimann graduated from École Normale Supérieure of Paris before completing his Ph.D. at Princeton University in 1995. He held a permanent research position at INRIA, the French National Institute for Computer Science, and visited NEC Research Institute and Princeton University before joining Polytechnic Institute of NYU in 2000. His research interests include analysis and design of algorithms, with a focus on geometric algorithms. Recently, he has been interested in the implementation of these algorithms and in what can be called geometric computing, which involves the manipulation of geometric objects. He is equally interested in the study of non-theoretically optimal yet highly practical algorithms, and in applications of a geometric nature. He is a key collaborator in the European Community project CGAL (Computational Geometry Algorithms Library), a software library written in C++. He currently is maintaining some large portion of the geometry kernel. He has published several papers on all aspects of geometric computing in international journals. He enjoys teaching special topics in algorithms and computational geometry.

Education

Baccalaureate in Technology, Lycée Chaptal (Paris, France), Full Scholarship, Ecole Normale Supérieure (Paris, France), PhD in Computer Science, Princeton University (New Jersey, USA). > Your Educational History (from my web site where links can also be found) While still a student at the École Normale Supérieure de Paris, in France, I came to Princeton University in 1992 and completed my Ph.D. in 1995 from the Princeton University Dept of Computer Science. I then joined the Prisme PROJECT, at INRIA, the French National Institute for Research in Informatics and Automatics, where I collaborated on the CGAL Esprit Project. INRIA consists of several centers and Prisme is located in the south of France near Nice at Sophia-Antipolis. In 1999, I held visiting positions at the NEC Research Institute, and at Princeton University where I taught COS451 (Computational Geometry). In 2000, I was appointed assistant professor at Polytechnic Institute of NYU, in the Department of Computer and Information Sciences.