Voronoi diagrams—a survey of a fundamental geometric data structure F Aurenhammer ACM Computing Surveys (CSUR) 23 (3), 345-405, 1991 | 6141 | 1991 |

Power diagrams: properties, algorithms and applications F Aurenhammer SIAM Journal on Computing 16 (1), 78-96, 1987 | 1135 | 1987 |

Voronoi Diagrams. F Aurenhammer, R Klein Handbook of computational geometry 5 (10), 201-290, 2000 | 1113 | 2000 |

Voronoi diagrams and Delaunay triangulations F Aurenhammer, R Klein, DT Lee World Scientific Publishing Company, 2013 | 585 | 2013 |

A novel type of skeleton for polygons O Aichholzer, F Aurenhammer, D Alberts, B Gärtner J. UCS The Journal of Universal Computer Science: Annual Print and CD-ROM …, 1996 | 481 | 1996 |

An optimal algorithm for constructing the weighted Voronoi diagram in the plane F Aurenhammer, H Edelsbrunner Pattern recognition 17 (2), 251-257, 1984 | 405 | 1984 |

Minkowski-type theorems and least-squares clustering F Aurenhammer, F Hoffmann, B Aronov Algorithmica 20, 61-76, 1998 | 275 | 1998 |

Straight skeletons for general polygonal figures in the plane O Aichholzer, F Aurenhammer Computing and Combinatorics: Second Annual International Conference, COCOON …, 1996 | 268 | 1996 |

Enumerating order types for small sets with applications O Aichholzer, F Aurenhammer, H Krasser Proceedings of the seventeenth annual symposium on Computational geometry, 11-18, 2001 | 182 | 2001 |

Handbook of computational geometry F Aurenhammer, R Klein Chapt 5, 201-290, 2000 | 143 | 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 | 124 | 2009 |

A criterion for the affine equivalence of cell complexes in*R*^{d} and convex polyhedra in*R*^{d+1}F Aurenhammer Discrete & Computational Geometry 2 (1), 49-64, 1987 | 119 | 1987 |

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams F Aurenhammer, O Schwarzkopf Proceedings of the seventh annual symposium on Computational geometry, 142-151, 1991 | 106 | 1991 |

Cartesian graph factorization at logarithmic cost per edge F Aurenhammer, J Hagauer, W Imrich Computational complexity 2, 331-349, 1992 | 85 | 1992 |

Quickest paths, straight skeletons, and the city Voronoi diagram O Aichholzer, F Aurenhammer, B Palop Proceedings of the eighteenth annual symposium on Computational geometry …, 2002 | 84 | 2002 |

Improved algorithms for discs and balls using power diagrams F Aurenhammer Journal of Algorithms 9 (2), 151-161, 1988 | 79 | 1988 |

Triangulations intersect nicely O Aichholzer, G Rote Proceedings of the eleventh annual symposium on Computational geometry, 220-229, 1995 | 73 | 1995 |

Farthest line segment Voronoi diagrams F Aurenhammer, RLS Drysdale, H Krasser Information Processing Letters 100 (6), 220-225, 2006 | 62 | 2006 |

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 | 60 | 2003 |

Recognising polytopical cell complexes and constructing projection polyhedra F Aurenhammer Journal of Symbolic Computation 3 (3), 249-255, 1987 | 59 | 1987 |