| Voronoi diagrams—a survey of a fundamental geometric data structure F Aurenhammer ACM Computing Surveys (CSUR) 23 (3), 345-405, 1991 | 5124 | 1991 |
| Power diagrams: properties, algorithms and applications F Aurenhammer SIAM Journal on Computing 16 (1), 78-96, 1987 | 937 | 1987 |
| Voronoi Diagrams. F Aurenhammer, R Klein Handbook of computational geometry 5 (10), 201-290, 2000 | 877 | 2000 |
| A novel type of skeleton for polygons O Aichholzer, F Aurenhammer, D Alberts, B Gärtner J. UCS The Journal of Universal Computer Science, 752-761, 1996 | 416 | 1996 |
| Voronoi diagrams and Delaunay triangulations F Aurenhammer, R Klein, DT Lee World Scientific Publishing Company, 2013 | 347 | 2013 |
| An optimal algorithm for constructing the weighted Voronoi diagram in the plane F Aurenhammer, H Edelsbrunner Pattern Recognition 17 (2), 251-257, 1984 | 338 | 1984 |
| Straight skeletons for general polygonal figures in the plane O Aichholzer, F Aurenhammer International computing and combinatorics conference, 117-126, 1996 | 235 | 1996 |
| Minkowski-type theorems and least-squares clustering F Aurenhammer, F Hoffmann, B Aronov Algorithmica 20 (1), 61-76, 1998 | 207 | 1998 |
| Enumerating order types for small point sets with applications O Aichholzer, F Aurenhammer, H Krasser Order 19 (3), 265-281, 2002 | 137 | 2002 |
| Handbook of computational geometry F Aurenhammer, R Klein Chapt 5, 201-290, 2000 | 120 | 2000 |
| Medial axis computation for planar free–form shapes O Aichholzer, W Aigner, F Aurenhammer, T Hackl, B Jüttler, M Rabl Computer-Aided Design 41 (5), 339-349, 2009 | 109 | 2009 |
| A criterion for the affine equivalence of cell complexes inR d and convex polyhedra inR d+1 F Aurenhammer Discrete & Computational Geometry 2 (1), 49-64, 1987 | 100 | 1987 |
| A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams F Aurenhammer, O Schwarzkopf International Journal of Computational Geometry & Applications 2 (04), 363-381, 1992 | 96 | 1992 |
| Quickest paths, straight skeletons, and the city Voronoi diagram O Aichholzer, F Aurenhammer, B Palop Discrete & Computational Geometry 31 (1), 17-35, 2004 | 82 | 2004 |
| Cartesian graph factorization at logarithmic cost per edge F Aurenhammer, J Hagauer, W Imrich Computational Complexity 2 (4), 331-349, 1992 | 76 | 1992 |
| Triangulations intersect nicely O Aichholzer, F Aurenhammer, SW Cheng, N Katoh, G Rote, M Taschwer, ... Discrete & Computational Geometry 16 (4), 339-359, 1996 | 75 | 1996 |
| Improved algorithms for discs and balls using power diagrams F Aurenhammer Journal of Algorithms 9 (2), 151-161, 1988 | 65 | 1988 |
| Pseudotriangulations from surfaces and a novel type of edge flip O Aichholzer, F Aurenhammer, H Krasser, P Brass SIAM Journal on Computing 32 (6), 1621-1653, 2003 | 58 | 2003 |
| Farthest line segment Voronoi diagrams F Aurenhammer, RLS Drysdale, H Krasser Information Processing Letters 100 (6), 220-225, 2006 | 52 | 2006 |
| Voronoi diagrams--A survey of... F Aureghammer | 51 | 1988 |
