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
451 1996 Straight skeletons for general polygonal figures in the plane O Aichholzer, F Aurenhammer
International computing and combinatorics conference, 117-126, 1996
256 1996 Enumerating order types for small point sets with applications O Aichholzer, F Aurenhammer, H Krasser
Order 19 (3), 265-281, 2002
161 2002 Matching shapes with a reference point O Aichholzer, H Alt, G Rote
International Journal of Computational Geometry & Applications 7 (04), 349-363, 1997
116 1997 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 The point set order type data base: A collection of applications and results. O Aichholzer, H Krasser
CCCG 1, 17-20, 2001
95 2001 Abstract order type extension and new results on the rectilinear crossing number O Aichholzer, H Krasser
Computational Geometry 36 (1), 2-15, 2007
85 2007 Quickest paths, straight skeletons, and the city Voronoi diagram O Aichholzer, F Aurenhammer, B Palop
Discrete & Computational Geometry 31 (1), 17-35, 2004
84 2004 On the crossing number of complete graphs O Aichholzer, F Aurenhammer, H Krasser
Computing 76 (1), 165-176, 2006
73 2006 Triangulations intersect nicely O Aichholzer, F Aurenhammer, SW Cheng, N Katoh, G Rote, M Taschwer, ...
Discrete & Computational Geometry 16 (4), 339-359, 1996
70 1996 On the number of plane geometric graphs O Aichholzer, T Hackl, C Huemer, F Hurtado, H Krasser, B Vogtenhuber
Graphs and Combinatorics 23 (1), 67-84, 2007
67 2007 A lower bound on the number of triangulations of planar point sets O Aichholzer, F Hurtado, M Noy
Computational Geometry 29 (2), 135-145, 2004
64 2004 Compatible geometric matchings O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
61 2009 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
59 2003 The path of a triangulation O Aichholzer
Proceedings of the fifteenth annual symposium on Computational geometry, 14-23, 1999
59 1999 New lower bounds for the number of (≤ k)-edges and the rectilinear crossing number of Kn O Aichholzer, J Garcia, D Orden, P Ramos
Discrete & Computational Geometry 38 (1), 1-14, 2007
53 2007 Flip distance between triangulations of a simple polygon is NP-complete O Aichholzer, W Mulzer, A Pilz
Discrete & computational geometry 54 (2), 368-389, 2015
51 2015 Sequences of spanning trees and a fixed tree theorem O Aichholzer, F Aurenhammer, F Hurtado
Computational Geometry 21 (1-2), 3-20, 2002
46 2002 The 2-Page Crossing Number of BM Ábrego, O Aichholzer, S Fernández-Merchant, P Ramos, G Salazar
Discrete & Computational Geometry 49 (4), 747-777, 2013
44 2013 Edge-removal and non-crossing configurations in geometric graphs DR Wood, F Hurtado, C Huemer, T Hackl, D Flores-Peñaloza, ...
Discrete Mathematics & Theoretical Computer Science 12, 2010
42 2010 