Computer & Information Science Department   Polytechnic University
Hervé Brönnimann

Title Assistant Professor
Office LC242
Phone 718-260-3538
Fax 718-260-3609
Email hbr at poly.edu
Home Page http://photon.poly.edu/~hbr/
 
Major Research Interests
  • Design and Analysis of Algorithms
  • Computational and combinatorial geometry
  • Geometric computing
  • Implementation of geometric algorithms
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 University 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.
Selected Publications
  • H. Brönnimann, L. Kettner, S. Schirra and R. Veltkamp, "Application of the Generic Programming Paradigm in the Design of CGAL,'' submitted.
  • H. Brönnimann, "Degenerate Convex Hulls in Any Fixed Dimension,'' Disc. Comput. Geom. () 1999, --.
  • H. Brönnimann, B. Chazelle, "Optimal Slope Selection Via Cuttings,'' Theory and Applications (10), 1998, 23--39.
  • H. Brönnimann, M.T. Goodrich "Almost Optimal Set Covers in Finite VC-Dimension,'' Discr. Comput. Geom. (14), 1995, 463--479.
  • H. Brönnimann, B. Chazelle, J. Pach "How Hard Is Halfspace Range Searching?,'' Disc. Comput. Geom. (10), 1993, 143--155.
  • For a complete publication list, please go to http://www-sop.inria.fr/prisme/personnel/bronnimann/publis.html.
Courses