| On the design of CGAL a computational geometry algorithms library A Fabri, GJ Giezeman, L Kettner, S Schirra, S Schönherr Software: Practice and Experience 30 (11), 1167-1202, 2000 | 377 | 2000 |
| Edge-coloring bipartite multigraphs in O (E logD) time R Cole, K Ost, S Schirra Combinatorica 21 (1), 5-12, 2001 | 253 | 2001 |
| Classroom examples of robustness problems in geometric computations L Kettner, K Mehlhorn, S Pion, S Schirra, C Yap Computational Geometry 40 (1), 61-78, 2008 | 170 | 2008 |
| On degeneracy in geometric computations C Burnikel, K Mehlhorn, S Schirra Proceedings of the fifth annual ACM-SIAM Symposium on Discrete algorithms, 16-23, 1994 | 130 | 1994 |
| Robustness and precision issues in geometric computation S Schirra Max-Planck-Institut für Informatik, 1998 | 122 | 1998 |
| Topologically correct subdivision simplification using the bandwidth criterion M de Berg, M van Kreveld, S Schirra Cartography and Geographic Information Systems 25 (4), 243-257, 1998 | 117 | 1998 |
| The CGAL kernel: A basis for geometric computation A Fabri, GJ Giezeman, L Kettner, S Schirra, S Schönherr Applied Computational Geometry Towards Geometric Engineering: FCRC'96 …, 1996 | 112 | 1996 |
| Checking geometric programs or verification of geometric structures K Mehlhorn, S Näher, T Schilz, S Schirra, M Seel, R Seidel, C Uhrig Proceedings of the twelfth annual symposium on Computational geometry, 159-165, 1996 | 105 | 1996 |
| Approximate decision algorithms for point set congruence PJ Heffernan, S Schirra Proceedings of the eighth annual Symposium on Computational geometry, 93-101, 1992 | 105 | 1992 |
| How to compute the Voronoi diagram of line segments: Theoretical and experimental results C Burnikel, K Mehlhorn, S Schirra Algorithms—ESA'94: Second Annual European Symposium Utrecht, The …, 1994 | 102 | 1994 |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures H Alt, R Fleischer, M Kaufmann, K Mehlhorn, S Näher, S Schirra, C Uhrig Proceedings of the sixth annual symposium on Computational geometry, 281-289, 1990 | 101 | 1990 |
| Exact geometric computation in LEDA C Burnikel, J Könemann, K Mehlhorn, S Näher, S Schirra, C Uhrig Proceedings of the eleventh annual symposium on Computational geometry, 418-419, 1995 | 100 | 1995 |
| Efficient exact geometric computation made easy C Burnikel, R Fleischer, K Mehlhorn, S Schirra Proceedings of the fifteenth annual symposium on Computational geometry, 341-350, 1999 | 87 | 1999 |
| A new approach to subdivision simplification M de Berg, M van Kreveld, S Schirra Utrecht University, Department of Computer Science, 1995 | 86 | 1995 |
| Classroom examples of robustness problems in geometric computations L Kettner, K Mehlhorn, S Pion, S Schirra, C Yap Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004 | 85 | 2004 |
| A separation bound for real algebraic expressions C Burnikel, S Funke, K Mehlhorn, S Schirra, S Schmitt Algorithms—ESA 2001: 9th Annual European Symposium Århus, Denmark, August …, 2001 | 84 | 2001 |
| A strong and easily computable separation bound for arithmetic expressions involving radicals C Burnikel, R Fleischer, K Mehlhorn, S Schirra Algorithmica 27 (1), 87-99, 2000 | 68 | 2000 |
| Algorithm Engineering M Müller-Hannemann, S Schirra Springer, 2001 | 65 | 2001 |
| The LEDA class real number C Burnikel, K Mehlhorn, S Schirra Max-Planck-Institut für Informatik, 1996 | 51 | 1996 |
| Precision and robustness in geometric computations S Schirra Advanced School on the Algorithmic Foundations of Geographic Information …, 1996 | 42 | 1996 |
