Oswin Aichholzer
Oswin Aichholzer
Prof. Informatik, TU Graz, Graz, Austria
Bestätigte E-Mail-Adresse bei ist.tugraz.at - Startseite
Zitiert von
Zitiert von
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
Straight skeletons for general polygonal figures in the plane
O Aichholzer, F Aurenhammer
International computing and combinatorics conference, 117-126, 1996
Enumerating order types for small point sets with applications
O Aichholzer, F Aurenhammer, H Krasser
Order 19 (3), 265-281, 2002
Matching shapes with a reference point
O Aichholzer, H Alt, G Rote
International Journal of Computational Geometry & Applications 7 (04), 349-363, 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
The point set order type data base: A collection of applications and results.
O Aichholzer, H Krasser
CCCG 1, 17-20, 2001
Abstract order type extension and new results on the rectilinear crossing number
O Aichholzer, H Krasser
Computational geometry 36 (1), 2-15, 2007
Quickest paths, straight skeletons, and the city Voronoi diagram
O Aichholzer, F Aurenhammer, B Palop
Discrete & Computational Geometry 31 (1), 17-35, 2004
Triangulations intersect nicely
O Aichholzer, F Aurenhammer, SW Cheng, N Katoh, G Rote, M Taschwer, ...
Discrete & Computational Geometry 16 (4), 339-359, 1996
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
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
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
The path of a triangulation
O Aichholzer
Proceedings of the fifteenth annual symposium on Computational geometry, 14-23, 1999
Compatible geometric matchings
O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
New lower bounds for the number of (≤ k)-edges and the rectilinear crossing number of K n
O Aichholzer, J Garcia, D Orden, P Ramos
Discrete & computational geometry 38 (1), 1-14, 2007
On the crossing number of complete graphs
O Aichholzer, F Aurenhammer, H Krasser
Proceedings of the eighteenth annual symposium on Computational geometry, 19-24, 2002
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
Sequences of spanning trees and a fixed tree theorem
O Aichholzer, F Aurenhammer, F Hurtado
Computational Geometry 21 (1-2), 3-20, 2002
Edge-removal and non-crossing configurations in geometric graphs
O Aichholzer, S Cabello, R Fabila Monroy, D Flores Peñaloza, T Hackl, ...
Discrete mathematics and theoretical computer science 12 (1), 75-86, 2010
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
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20