Peter Hachenberger
Papers
2
Total Citations
87
H-Index
2
About
Peter Hachenberger is a leading figure in computational geometry, renowned for his pioneering work on exact geometric computing and polyhedral algorithms. His primary research focuses on robust, exact implementations of fundamental geometric operations, most notably the Minkowski sum of polyhedra. Hachenberger’s major contribution is the development of the first exact and robust algorithm for computing the 3D Minkowski sum of two non-convex polyhedra, a notoriously difficult problem due to numerical precision issues. His approach elegantly decomposes non-convex polyhedra into convex pieces, computes pairwise Minkowski sums, and then constructs their union—all while maintaining exactness and handling degenerate cases. This work, published in 2008, has garnered 74 citations and remains a cornerstone in the field. His earlier 2007 paper on the same topic, with 13 citations, laid critical groundwork. Hachenberger’s achievements are integral to the Computational Geometry Algorithms Library (CGAL), where his implementations enable reliable geometric computations for applications in robotics, computer-aided design, and scientific visualization. His research exemplifies the power of exact computation in solving real-world geometric challenges.
Research Focus
Key Achievements
Top Papers
- 1
- 2