Follow
Franz Aurenhammer
Franz Aurenhammer
Professor for Theoretical Computer Science, TU Graz, Austria
Verified email at igi.tugraz.at
Title
Cited by
Cited by
Year
Voronoi diagrams—a survey of a fundamental geometric data structure
F Aurenhammer
ACM Computing Surveys (CSUR) 23 (3), 345-405, 1991
56081991
Power diagrams: properties, algorithms and applications
F Aurenhammer
SIAM Journal on Computing 16 (1), 78-96, 1987
10311987
Voronoi Diagrams.
F Aurenhammer, R Klein
Handbook of computational geometry 5 (10), 201-290, 2000
9702000
Voronoi diagrams and Delaunay triangulations
F Aurenhammer, R Klein, DT Lee
World Scientific Publishing Company, 2013
4542013
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
4511996
An optimal algorithm for constructing the weighted Voronoi diagram in the plane
F Aurenhammer, H Edelsbrunner
Pattern recognition 17 (2), 251-257, 1984
3701984
Straight skeletons for general polygonal figures in the plane
O Aichholzer, F Aurenhammer
International computing and combinatorics conference, 117-126, 1996
2561996
Minkowski-type theorems and least-squares clustering
F Aurenhammer, F Hoffmann, B Aronov
Algorithmica 20 (1), 61-76, 1998
2381998
Enumerating order types for small point sets with applications
O Aichholzer, F Aurenhammer, H Krasser
Order 19 (3), 265-281, 2002
1612002
Handbook of computational geometry
F Aurenhammer, R Klein
Chapt 5, 201-290, 2000
1302000
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
1172009
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
1061987
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
1001992
Cartesian graph factorization at logarithmic cost per edge
F Aurenhammer, J Hagauer, W Imrich
Computational complexity 2 (4), 331-349, 1992
851992
Quickest paths, straight skeletons, and the city Voronoi diagram
O Aichholzer, F Aurenhammer, B Palop
Discrete & Computational Geometry 31 (1), 17-35, 2004
842004
On the crossing number of complete graphs
O Aichholzer, F Aurenhammer, H Krasser
Computing 76 (1), 165-176, 2006
732006
Improved algorithms for discs and balls using power diagrams
F Aurenhammer
Journal of Algorithms 9 (2), 151-161, 1988
731988
Triangulations intersect nicely
O Aichholzer, F Aurenhammer, SW Cheng, N Katoh, G Rote, M Taschwer, ...
Discrete & Computational Geometry 16 (4), 339-359, 1996
701996
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
592003
Recognising polytopical cell complexes and constructing projection polyhedra
F Aurenhammer
Journal of Symbolic Computation 3 (3), 249-255, 1987
581987
The system can't perform the operation now. Try again later.
Articles 1–20