Franz Aurenhammer Univ.-Prof. DI Dr. techn.

              Institute of Theoretical Computer Science
                      Graz University of Technology


                 Research          Teaching            Projects             Publications


Publications


2021
Book Chapter
B. Weiss, B. Juettler and F. Aurenhammer Arc fibration kernels of arc spline domainsGeometry Show publication in PURE
Conference/Workshop Article
F. Aurenhammer, E. Papadopoulou and M. Suderland Piecewise-linear farthest-site Voronoi diagrams Proc. 32th Interntional Symposium on Algorithms and Computation (ISAAC'21) Show publication in PURE
F. Aurenhammer and M. Steinkogler An insertion strategy for motorcycle graphs Proc. 38th European Workshop on Computational Geometry (EuroCG'22) Show publication in PURE
2020
Journal Article
B. Weiss, B. Juettler and F. Aurenhammer Mitered offsets and straight skeletons for circular arc polygons. Show publication in PURE
2019
Journal Article
F. Aurenhammer, M. Steinkogler and R. Klein Partially walking a polygon Show publication in PURE
2018
Other Article
F. Aurenhammer, M. Steinkogler and R. Klein Maximal two-guard walks in polygons Show publication in PURE
F. Aurenhammer and M. Steinkogler On merging straight skeletons Show publication in PURE
B. Weiß, B. Jüttler and F. Aurenhammer Mitered offsets and straight skeletons for circular arc polygons Show publication in PURE
F. Aurenhammer, M. Steinkogler and R. Klein Partially walking a polygon Show publication in PURE
2017
Conference/Workshop Article
F. Aurenhammer, B. Jüttler and G. Paulini Voronoi diagrams for parallel halflines and line segments in space Proc. 28th International Symposium on Algorithms and Computation (ISAAC'17) #7 Show publication in PURE
F. Aurenhammer, B. Juettler and Bastian Weiß Computing straight skeletons for arc polygons Proc. 2nd Conference on Subdivision, Geometric and Algebraic Methods, Isogeometric Analysis and Refinability (SMART'2017) Show publication in PURE
Other Article
Franz Aurenhammer, Bert Jüttler and B. Weiß Computing straight skeletons for arc polygons Show publication in PURE
2016
Journal Article
F. Aurenhammer and G. Walzl Straight skeletons and mitered offsets of nonconvex polytopes Show publication in PURE
Conference/Workshop Article
F. Aurenhammer, G. Paulini and B. Jüttler Voronoi diagrams for parallel halflines in 3D Proc. 32nd European Workshop on Computational Geometry (EuroCG 2016) 127-130 Show publication in PURE
2015
Journal Article
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz and B. Vogtenhuber 3-Colorability of pseudo-triangulations Show publication in PURE
O. Aichholzer, W. Aigner, F. Aurenhammer, K. Dobiásová, B. Jüttler and G. Rote Triangulations with circular arcs Show publication in PURE
W. Aigner, F. Aurenhammer and B. Jüttler On triangulation axes of polygons Show publication in PURE
Conference/Workshop Article
F. Aurenhammer and G. Walzl Three-dimensional straight skeletons from bisector graphs Proc. 5th International Conference on Analytic Number Theory and Spatial Tessellations 15-29 Show publication in PURE
2014
Journal Article
O. Aichholzer, F. Aurenhammer, T. Hackl, F. Hurtado, A. Pilz, P. Ramos, J. Urrutia, P. Valtr and B. Vogtenhuber On k-convex point sets Show publication in PURE
F. Aurenhammer, B. Su, Y.-F. Xu and B. Zhu A note on visibility-constrained Voronoi diagrams Show publication in PURE
F. Aurenhammer and G. Paulini On shape Delaunay tessellations Show publication in PURE
Conference/Workshop Article
F. Aurenhammer and G. Walzl Polytope offsets and straight skeletons in 3D Proc. 30th Ann. Symposium on Computational Geometry (SoCG'14) 98-99 Show publication in PURE
2013
Book
Franz Aurenhammer, Rolf Klein and Der-Tsai Lee Voronoi Diagrams and Delaunay Triangulations Show publication in PURE
Conference/Workshop Article
F. Aurenhammer, M. Kapl and B. Jüttler Voronoi diagrams from distance graphs Proceeding 20th European Workshop on Computational Geometry (EuroCG'13) 185-188 Show publication in PURE
M. Kapl, F. Aurenhammer and B. Jüttler Voronoi diagrams from (possibly discontinous) embeddings Proc. International Symposium on Voronoi Diagrams (ISVD 2013), IEEE Computer Society 47-50 Show publication in PURE
M. Kapl, F. Aurenhammer and B. Juettler Using scaled embedded distances to generate metrics for R^2 Proc. 14th IMA Conference on Algorithms and Computation Show publication in PURE
F. Aurenhammer and G. Walzl Structure and computation of straight skeletons in 3-space Proc. 24th International Symposium on Algorithms and Computation (ISAAC'13) 44-54 Show publication in PURE
2012
Journal Article
O. Aichholzer, F. Aurenhammer, E. Demaine, F. Hurtado, P. Ramos and J. Urrutia On k-convex polygons Show publication in PURE
T. Schiffer, F. Aurenhammer and M. Demuth Computing convex quadrangulations Show publication in PURE
F. Aurenhammer and B. Jüttler On computing the convex hull of (piecewise) curved objects Show publication in PURE
Conference/Workshop Article
O. Aichholzer, W. Aigner, F. Aurenhammer, B. Jüttler, K. Dobiásová and G. Rote Triangulations with circular arcs Graph Drawing 296-307 Show publication in PURE
W. Aigner, F. Aurenhammer and B. Jüttler On triangulation axes of polygons Proc. 28th European Workshop on Computational Geometry (EuroCG'12) 125-128 Show publication in PURE
2011
Journal Article
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M. Oberneder and Z. Sir Computational and structural advantages of circular boundary representation Show publication in PURE
Conference/Workshop Article
O. Aichholzer, W. Aigner, F. Aurenhammer, K. Cech Dobiasova, B. Juettler and G. Rote Triangulations with circular arcs Proc. 19th International Symposium on Graph Drawing 296-307 Show publication in PURE
2010
Journal Article
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer and M. Rabl Divide-and conquer for Voronoi diagrams revisited Show publication in PURE
Conference/Workshop Article
O. Aichholzer, W. Aigner, F. Aurenhammer and B. Jüttler Exact medial axis computation for triangulated solids with respect to piecewise linear metrics Curves and Surfaces 1-27 Show publication in PURE
O. Aichholzer, W. Aigner, F. Aurenhammer, K. Dobiásová and B. Jüttler Arc triangulations Proc. 26th European Workshop on Computational Geometry (EuroCG'10) 17-20 Show publication in PURE
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz and B. Vogtenhuber 3-Colorability of pseudo-triangulations Proc. 26th European Workshop on Computational Geometry (EuroCG'10) 21-24 Show publication in PURE
M. Demuth, F. Aurenhammer and A. Pinz Straight skeletons for binary shapes Computer Vision and Pattern Recognition Workshop (CVPRW) 9-16 Show publication in PURE
2009
Journal Article
O. Aichholzer, F. Aurenhammer, T. Hackl and B. Speckmann On minimum weight pseudo-triangulations Show publication in PURE
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler and M. Rabl Medial axis computation for planar free-form shapes Show publication in PURE
B. Aronov, F. Aurenhammer, F. Hurtado , S. Langerman , D. Rappaport , C. Seara and S. Smorodinsky Small weak epsilon nets Show publication in PURE
Conference/Workshop Article
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer and M. Rabl Divide-and-conquer for voronoi diagrams revisited Proc. 25th European Workshop on Computational Geometry (EuroCG'09) 293-296 Show publication in PURE
O. Aichholzer, F. Aurenhammer, B. Kornberger, S. Plantinga, G. Rote, A. Sturm and G. Vegter Recovering structure from r-sampled objects Proc. Symposium on Geometry Processing 2009 1349-1360 Show publication in PURE
O. Aichholzer, F. Aurenhammer, F. Hurtado, P. Ramos and J. Urrutia Two-convex polygons Proc. 25th European Workshop on Computational Geometry (EuroCG'09) 117-120 Show publication in PURE
O. Aichholzer, F. Aurenhammer, O. Devillers, T. Hackl, M. Teillaud and B. Vogtenhuber Lower and upper bounds on the number of empty cylinders and ellipsoids Proc. 25th European Workshop on Computational Geometry (EuroCG'09) 139-142 Show publication in PURE
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, E. Pilgerstorfer and M. Rabl Divide-and-conquer for voronoi diagrams revisited Proc. 25th Ann. Symposium on Computational Geometry (SoCG'09) 189-197 Show publication in PURE
2008
Book Chapter
F. Aurenhammer and Y.-F. Xu Optimal triangulationsEncyclopedia of Optimization (2nd Edition)2757-2764 Show publication in PURE
Journal Article
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray and B. Vogtenhuber Matching edges and faces in polygonal partitions Show publication in PURE
Conference/Workshop Article
F. Aurenhammer, M. Demuth and T. Schiffer Computing convex quadrangulations Proc. International Symposium on Voronoi Diagrams in Science and Engineering 32-43 Show publication in PURE
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, S. Plantinga, G. Rote, A. Sturm and G. Vegter Seed polytopes for incremental approximation Proc. 24th European Workshop on Computational Geometry (EuroCG'08) 13-16 Show publication in PURE
Other Article
O. Aichholzer, F. Aurenhammer, O. Devillers, T. Hackl, M. Teillaud and B. Vogtenhuber Counting quadrics and Delaunay triangulations and a new convex hull theorem Show publication in PURE
2007
Journal Article
O. Aichholzer, F. Aurenhammer and T. Hackl Pre-triangulations and liftable complexes Show publication in PURE
F. Aurenhammer Weighted skeletons and fixed-share decomposition Show publication in PURE
O. Aichholzer, F. Aurenhammer, T. Hackl and C. Huemer Connecting colored point sets Show publication in PURE
O. Aichholzer, F. Aurenhammer, C. Huemer and B. Vogtenhuber Gray code enumeration of plane straight line graphs Show publication in PURE
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, M. Peternell and H. Pottmann Approximating boundary-triangulated objects with balls Proc. 23rd European Workshop on Computational Geometry (EuroCG'07) 130-133 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder and Zbynek Sir Computational and structural advantages of circular boundary representation International Workshop on Algorithms and Data Structures 374-385 Show publication in PURE
O. Aichholzer, F. Aurenhammer, T. Hackl and B. Speckmann On (pointed) minimum weight pseudo-triangulations Proc. 19th Canadian Conference on Computational Geometry (CCCG'07) 209-212 Show publication in PURE
F. Aurenhammer, M. Peternell, H. Pottmann and J. Wallner Voronoi diagrams for oriented spheres Proc. 4th International Conference on Voronoi Diagrams in Science and Engineering (ISVD'07) 33-37 Show publication in PURE
Other Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, B. Kornberger , M. Peternell and Helmut Pottmann Approximating boundary-triangulated objects with balls Show publication in PURE
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Juettler, M. Oberneder and Z. Sir Computational and structural advantages of circular boundary representation Show publication in PURE
Franz Aurenhammer, B. Speckmann, Oswin Aichholzer and Thomas Hackl On (pointed) minimum weight pseudo-triangulations Show publication in PURE
Franz Aurenhammer, M. Peternell, Helmut Pottmann and J. Wallner Voronoi diagrams for oriented spheres Show publication in PURE
2006
Book
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Connecting colored point sets Show publication in PURE
Franz Aurenhammer and [No Value] H. Krasser Pseudo-simplicial complexes from maximal locally convex functions Show publication in PURE
Franz Aurenhammer, [No Value] R. L. S. Drysdale and [No Value] H. Krasser Farthest line segment Voronoi diagrams Show publication in PURE
Franz Aurenhammer, B. Kornberger , M. Peternell , H. Pottmann, Oswin Aichholzer and Thomas Hackl Approximating boundary-triangulated objects with balls Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, B. Juettler, M. Oberneder and Z. Sir Computational and structural advantages of circular boundary representation Show publication in PURE
Franz Aurenhammer, [No Value] M. Peternell, [No Value] H. Pottmann and [No Value] J. Wallner Voronoi diagrams for oriented spheres Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulations Show publication in PURE
Journal Article
F. Aurenhammer, S. Drysdale and H. Krasser Farthest line segment Voronoi diagrams Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser On the crossing number of complete graphs Show publication in PURE
F. Aurenhammer and H. Krasser Pseudo-simplicial complexes from maximal locally convex functions Show publication in PURE
O. Aichholzer, F. Aurenhammer, C. Huemer and H. Krasser Transforming spanning trees and pseudo-triangulations Show publication in PURE
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer, C. Huemer and B. Vogtenhuber Gray code enumeration of plane straight-line graphs Proc. 22nd European Workshop on Computational Geometry (EuroCG'06) 71-74 Show publication in PURE
O. Aichholzer, F. Aurenhammer and T. Hackl Pre-triangulations and liftable complexes Proc, 22nd Ann. Symposium on Computational Geometry (SoCG'06) 282-291 Show publication in PURE
2005
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, S. Ray and B. Vogtenhuber Matching edges and faces in polygonal partitions Proc. 17th Canadian Conference on Computational Geometry (CCCG'05) 123-126 Show publication in PURE
Franz Aurenhammer Pre-triangulations: A generalization of Delaunay triangulations and flips 2nd Int. Symposium on Voronoi Diagrams in Science and Engineering 235-235 Show publication in PURE
O. Aichholzer, F. Aurenhammer, C. Huemer and H. Krasser Transforming spanning trees and pseudo-triangulations Proc. 21th European Workshop on Computational Geometry (EuroCG'05) 81-84 Show publication in PURE
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara and S. Smorodinsky Small weak epsilon nets Proc. 17th Canadian Conference on Computational Geometry (CCCG'05) 51-54 Show publication in PURE
F. Aurenhammer and H. Krasser Pseudo-tetrahedral complexes Proc. 21th European Workshop on Computational Geometry (EuroCG'05) 85-88 Show publication in PURE
2004
Journal Article
O. Aichholzer, F. Aurenhammer, H. Krasser and B. Speckmann Convexity minimizes pseudo-triangulations Show publication in PURE
O. Aichholzer, F. Aurenhammer and B. Palop Quickest paths, straight skeletons, and the city Voronoi diagram Show publication in PURE
2003
Journal Article
O. Aichholzer, F. Aurenhammer, P. Brass and H. Krasser Pseudo-triangulations from surfaces and a novel type of edge flip Show publication in PURE
O. Aichholzer, F. Aurenhammer, F. Hurtado and H. Krasser Towards compatible triangulations Show publication in PURE
Conference/Workshop Article
F. Aurenhammer Pseudo-simplices and their derivation Proc. Voronoi Conference on Analytic Number Theory and Spatial Tesselations 11-11 Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser Adapting (pseudo)-triangulations with a near-linear number of edge flips Proc. 8th International Workshop on Algorithms and Data Structures (WADS'03) 12-24 Show publication in PURE
O. Aichholzer, F. Aurenhammer, P. Brass and H. Krasser Spatial embedding of pseudo-triangulations Proc. 19th Ann. Symposium on Computational Geometry (SoCG'03) 144-153 Show publication in PURE
2002
Book
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Progress on rectilinear crossing numbers Show publication in PURE
Journal Article
O. Aichholzer and F. Aurenhammer Voronoi diagrams - computational geometry's favorite Show publication in PURE
O. Aichholzer, F. Aurenhammer, B. Brandstätter, T. Ebner, H. Krasser, C. Magele, M. Mühlmann and W. Renhart Evolution strategy and hierarchical clustering Show publication in PURE
F. Aurenhammer, N. Katoh, H. Kojima, M. Ohsaki and Y.-F. Xu Approximating uniform triangular meshes in polygons Show publication in PURE
O. Aichholzer, F. Aurenhammer and F. Hurtado Sequences of spanning trees and a fixed tree theorem Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser Enumerating order types for small point sets with applications Show publication in PURE
O. Aichholzer, F. Aurenhammer and T. Werner Algorithmic fun - Abalona Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser Points and combinatorics Show publication in PURE
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer and B. Palop Quickest paths, straight skeletons, and the city Voronoi diagram Proc. 18th Ann. ACM Symposium on Computational Geometry (SoCG'02) 151-159 Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser On the crossing number of complete graphs Proc. 18th Ann. ACM Symposium on Computational Geometry (SoCG'02) 19-24 Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser On the crossing number of complete graphs Proc. 18th European Workshop on Computational Geometry (EuroCG'02) 90-92 Show publication in PURE
O. Aichholzer, F. Aurenhammer, H. Krasser and B. Speckmann Convexity minimizes pseudo-triangulations Proc. 14th Canadian Conference on Computational Geometry (CCCG'02) 158-161 Show publication in PURE
2001
Journal Article
F. Aurenhammer Computational geometry -- some easy questions and their recent solutions Show publication in PURE
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe and G. Rote Generalized self-approaching curves Show publication in PURE
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer, F. Hurtado and H. Krasser Towards compatible triangulations Proc. 7th Ann. Computing and Combinatorics Conference (COCOON'01) 101-110 Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser Enumerating order types for small point sets with applications Proc. 17th Ann. ACM Symposium on Computational Geometry (SoCG'01) 11-18 Show publication in PURE
O. Aichholzer, F. Aurenhammer and H. Krasser On compatible triangulations of point sets Proc. 17th European Workshop on Computational Geometry (EuroCG'01) 23-26 Show publication in PURE
O. Aichholzer, F. Aurenhammer, B. Brandtstätter, H. Krasser, C. Magele, M. Mühlmann and W. Renhart Evolution strategy and hierarchical clustering Proc. 13th COMPUMAG Conference on the Computation of Electromagnetic Fields ?-? Show publication in PURE
2000
Book Chapter
F. Aurenhammer and X.-F. Xu Optimal triangulationsEncyclopedia of Optimization160-166 Show publication in PURE
F. Aurenhammer and R. Klein Voronoi diagramsHandbook of Computatioal Geometry201-290 Show publication in PURE
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer, B. Brandtstätter, T. Ebner, H. Krasser and C. Magele Niching evolution strategy with cluster algorithms Proc. 9th Biennial IEEE Conference on Electromagnetic Field Computations 1-3 Show publication in PURE
O. Aichholzer, F. Aurenhammer and F. Hurtado Edge operations on non-crossing spanning trees Proc. 16th European Workshop on Computational Geometry (EuroCG'00) 121-125 Show publication in PURE
F. Aurenhammer, N. Katoh, H. Kojima, M. Ohsaki and Y.F. Xu Approximating uniform triangular meshes in polygons Proc. 6th Ann. International Computing and Combinatorics Conference (COCOON'00) 23-33 Show publication in PURE
1999
Journal Article
O. Aichholzer, F. Aurenhammer, D. Chen, D.T. Lee and E. Papadopoulou Skew Voronoi diagrams Show publication in PURE
O. Aichholzer, F. Aurenhammer and R. Hainz New results on MWT subgraphs Show publication in PURE
1998
Journal Article
O. Aichholzer, F. Aurenhammer, G. Rote and Y.-F. Xu Constant-level greedy triangulations approximate the MWT well Show publication in PURE
F. Aurenhammer, F. Hoffmann and B. Aronov Minkowski-type theorems and least-squares clusterings Show publication in PURE
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe and G. Rote Generalized self-approaching curves Proc. 14th European Workshop on Computational Geometry (EuroCG'98) 15-18 Show publication in PURE
O. Aichholzer and F. Aurenhammer Straight skeletons for general polygonal figures in the plane Voronoi's Impact on Modern Sciences II 7-21 Show publication in PURE
O. Aichholzer, F. Aurenhammer, C. Icking, R. Klein, E. Langetepe and G. Rote Generalized self-approaching curves Proc. 9th International Symposium on Algorithms and Computation (ISAAC'98) 317-326 Show publication in PURE
1997
Conference/Workshop Article
O. Aichholzer, F. Aurenhammer and R. Hainz New results on minimum-weight triangulations and the LMT skeleton Proc. 13th European Workshop on Computational Geometry (EuroCG'97) 4-6 Show publication in PURE
O. Aichholzer, F. Aurenhammer, D. Chen, D.T. Lee, A. Mukhopadhyay and E. Papadopoulou Voronoi diagrams for direction-sensitive distances Proc. 13th Ann. ACM Symposium on Computational Geometry (SoCG'97) 418-420 Show publication in PURE
1996
Journal Article
O. Aichholzer, F. Aurenhammer, S.-W. Cheng, N. Katoh, G. Rote, M. Taschwer and Y.-F. Xu Triangulations intersect nicely Show publication in PURE
O. Aichholzer and F. Aurenhammer Classifying hyperplanes in hypercubes Show publication in PURE
Conference/Workshop Article
O. Aichholzer and F. Aurenhammer Straight skeletons for general polygonal figures Proc. 2nd Ann. Internatioanl Computing and Combinatorics Conference (COCOON'96) 117-126 Show publication in PURE
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures in the plane Computing and combinatorics 117-126 Show publication in PURE
O. Aichholzer, F. Aurenhammer, G. Rote and Y.-F. Xu New greedy triangulation algorithms Proc. 12th European Workshop on Computational Geometry (EuroCG'96) 11-14 Show publication in PURE
O. Aichholzer, F. Aurenhammer, G. Rote and Y.-F. Xu Constant-level greedy triangulations approximate the MWT well Proc. 2nd International Symposium on Operations Research & Applications (ISORA'96) 309-318 Show publication in PURE
1995
Book
O. Aichholzer, F. Aurenhammer and G. Rote Optimal graph orientation with storage applications Show publication in PURE
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures Show publication in PURE
Journal Article
O. Aichholzer, D. Alberts, F. Aurenhammer and B. Gärtner A novel type of skeleton for polygons Show publication in PURE
F. Aurenhammer and J. Hagauer Recognizing binary Hamming graphs in O(n^2 logn) time Show publication in PURE
Conference/Workshop Article
O. Aichholzer, D. Alberts, F. Aurenhammer and B. Gärtner Straight skeletons of simple polygons Proc. 4th International Symposium LIESMARS 114-124 Show publication in PURE
O. Aichholzer, F. Aurenhammer, G. Rote and M. Taschwer Triangulations intersect nicely Proc. 11th Ann. ACM Symposium on Computational Geometry (SoCG'95) 220-229 Show publication in PURE
1994
Journal Article
F. Aurenhammer, M. Forman, R. Idury, A. Schäffer and F. Wagner Faster isometric embedding in products of complete graphs Show publication in PURE
Conference/Workshop Article
O. Aichholzer and F. Aurenhammer Classifying hyperplanes in hypercubes Proc. 10th European Workshop on Computational Geometry (EuroCG'94) 53-57 Show publication in PURE
Other Article
Oswin Aichholzer and Franz Aurenhammer Classifying hyperplanes in hypercubes Show publication in PURE
1993
Journal Article
F. Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure Show publication in PURE
Conference/Workshop Article
F. Aurenhammer Geometric clustering and Voronoi-type partitions Proc. 16th IFIP Conference on System Modelling and Optimization 93-94 Show publication in PURE
1992
Book
Franz Aurenhammer, [No Value] F. Hoffmann and [No Value] B. Aronov Minkowski-type theorems and least-squares partitioning Show publication in PURE
F. Aurenhammer and O. Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams Show publication in PURE
Journal Article
F. Aurenhammer and J. Hagauer Computing equivalence classes among the edges of a graph with applications Show publication in PURE
Franz Aurenhammer and Otfried Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams Show publication in PURE
F. Aurenhammer, J. Hagauer and W. Imrich Cartesian graph factorization at logarithmic cost per edge Show publication in PURE
F. Aurenhammer and G. Stöckl Searching for segments with largest relative operlap Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer, [No Value] Hoffmann F. and [No Value] Aranov B. Least-squares partitioning European Workshop on Computational Geometry 55-57 Show publication in PURE
F. Aurenhammer and G. Stöckl Searching for sements with largest relative overlap Proc. 15th IFIP Conference on System Modelling and Optimization 77-84 Show publication in PURE
F. Aurenhammer, F. Hoffmann and B. Aronov Minkowski-type theorems and least-squares partitioning Proc. 8th Ann. ACM Symposium on Computational Geometry (SOCG'92) 350-357 Show publication in PURE
Other Article
F. Aurenhammer, F. Hoffmann and B. Aronov Least-squares partitioning Show publication in PURE
Franz Aurenhammer and G. Stöckl Searching for segments with largest relative overlap Show publication in PURE
Franz Aurenhammer, [No Value] F. Hoffmann and [No Value] B. Aronov Minkowski-type theorems and least-squares partitioning Show publication in PURE
1991
Book
Franz Aurenhammer and [No Value] G. Stöckl Searching for segments with largest relative operlap Show publication in PURE
Franz Aurenhammer The post-office problem for fuzzy points sets Show publication in PURE
Journal Article
F. Aurenhammer Using Gale transforms in computational geometry Show publication in PURE
F. Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure Show publication in PURE
F. Aurenhammer and G. Stöckl On the peeper's Voronoi diagram Show publication in PURE
Conference/Workshop Article
F. Aurenhammer, G. Stöckl and E. Welzl The post-office problem for fuzzy point sets Proc. 7th Workshop on Computational Geometry (CG'91) 1-11 Show publication in PURE
F. Aurenhammer and O. Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams Proc. 7th Ann. ACM Symposium on Computational Geometry (SoCG'91) 142-151 Show publication in PURE
F. Aurenhammer and J. Hagauer Recognizing binary Hamming graphs in O(n²log n) time Proc. 16th International Workshop on Graph-Theoretical Concepts in Computer Science 90-98 Show publication in PURE
Other Article
Franz Aurenhammer, G. Stöckl and Emo Welzl The post-office problem for fuzzy points sets Show publication in PURE
Franz Aurenhammer and O. Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams Show publication in PURE
Franz Aurenhammer and [No Value] J. Hagauer Recognizing binary Hamming graphs in O(n²logn)time Show publication in PURE
1990
Book
Franz Aurenhammer, [No Value] Forman M., [No Value] Idury R., [No Value] Schäffer A. and [No Value] Wagner F. Faster isometric embedding in products of complete graphs Show publication in PURE
Franz Aurenhammer, [No Value] J. Hagauer and [No Value] W. Imrich Factoring Cartesian-product graphs at logarithmic cost per edge Show publication in PURE
Franz Aurenhammer Voronoi diagrams - a survey of a fundamental geomtric data structure Show publication in PURE
Journal Article
F. Aurenhammer A new duality result concerning Voronoi diagrams Show publication in PURE
F. Aurenhammer A relationship between Gale transforms and Voronoi diagrams Show publication in PURE
Conference/Workshop Article
F. Aurenhammer, J. Hagauer and W. Imrich Factoring Cartesian-product graphs at logarithmic cost per edge Proc. MPS Conference on Integer Programming and Combinatorial Optimization (IPCO'90) 29-44 Show publication in PURE
F. Aurenhammer and G. Stöckl Fenster - Voronoi Diagramme Tagungsband DMV Jubiläumstagung 52-52 Show publication in PURE
Other Article
Franz Aurenhammer, [No Value] J. Hagauer and [No Value] W. Imrich Factoring Cartesian-product graphs at lograithmic cost per edge Show publication in PURE
1989
Book
Franz Aurenhammer and [No Value] J. Hagauer Computing equivalence classes among the edges of a graph with applications Show publication in PURE
Conference/Workshop Article
F. Aurenhammer and J. Hagauer Computing equivalence classes among the edges of a graph with applications Proc. International Conference on Algebraic Graph Theory 11 Show publication in PURE
Other Article
Franz Aurenhammer and [No Value] J. Hagauer Computing equivalence classes among the edges of a graph with applications Show publication in PURE
1988
Book
Franz Aurenhammer and [No Value] G. Stöckl On the peeper's Voronoi diagram Show publication in PURE
Franz Aurenhammer Using Gale transforms in computational geomtry Show publication in PURE
Franz Aurenhammer A relationship between Gale transforms and Voronoi diagrams Show publication in PURE
Journal Article
F. Aurenhammer Improved algorithms for discs and balls using power diagrams Show publication in PURE
F. Aurenhammer On-line sorting of twisted sequences in linear time Show publication in PURE
F. Aurenhammer Linear combinations from power domains Show publication in PURE
F. Aurenhammer and H. Imai Geometric relations among Voronoi diagrams Show publication in PURE
Conference/Workshop Article
F. Aurenhammer Algorithmic aspects of Gale transforms Proc. 13th 3-Ann. International Symposium on Mathematical Programming 176 Show publication in PURE
F. Aurenhammer Using Gale transforms in computational geometry Proc. 4th Workshop on Computational Geometry (CG'88) 202-216 Show publication in PURE
F. Aurenhammer On-line sorting of twisted sequences in linear time Proc. 2nd Workshop on Computational Geometry and Discrete Algorithms 14 Show publication in PURE
1987
Book
Franz Aurenhammer Linear combinations from power domains Show publication in PURE
Franz Aurenhammer On-line sorting of twisted sequences in linear time Show publication in PURE
Journal Article
F. Aurenhammer A criterion for the affine equivalence of cell complexes in R^d and convex polyhedra in R^d+1 Show publication in PURE
F. Aurenhammer Recognizing polytopical cell complexes and constructing projection polyhedra Show publication in PURE
F. Aurenhammer Power diagrams: properties, algorithms and applications Show publication in PURE
Conference/Workshop Article
F. Aurenhammer Jordan sorting via convex hulls of certain non-simple polygons Proc. 3rd Ann. ACM Symposium on Computational Geometry (SoCG'87) 21-29 Show publication in PURE
Franz Aurenhammer and H. Imai Geometric relations among Voronoi diagrams Proc. 4th Ann. Symposium on Theoretical Aspects of Computer Science (STACS'87) 53-65 Show publication in PURE
Other Article
Franz Aurenhammer and [No Value] H. Imai Geometric relations among Voronoi diagrams Show publication in PURE
1986
Book
Franz Aurenhammer and [No Value] H. Imai Geometric relations among Voronoi diagrams Show publication in PURE
Journal Article
F. Aurenhammer The one-dimensional weighted Voronoi diagram Show publication in PURE
Conference/Workshop Article
F. Aurenhammer A new duality result concerning Vornonoi diagrams Proc. 13th Ann. International Colloquium on Automata, Languages and Programming (ICALP'86) 21-32 Show publication in PURE
1985
Book
Franz Aurenhammer A new duality result concerning Voronoi diagrams Show publication in PURE
Franz Aurenhammer A criterion for the affine equivalence of cell compleses in Rd and convex polyhedra in Rd+1 Show publication in PURE
Franz Aurenhammer Improved algorithms for discs and balls using power diagrams Show publication in PURE
Franz Aurenhammer Recognizing polytopical cell complexes and constructing projection polyhedra Show publication in PURE
Conference/Workshop Article
F. Aurenhammer Gewichtete Voronoi Diagramme Workshop on Computational Geometry CG '85 22 Show publication in PURE
1984
Book
Franz Aurenhammer Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-Algorithmen Show publication in PURE
Book Chapter
F. Aurenhammer Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-AlgorithmenDissertation, TU Graz, Austria Show publication in PURE
Journal Article
F. Aurenhammer and H. Edelsbrunner An optimal algorithm for constructing the weighted Voronoi diagram in the plane Show publication in PURE
1983
Book
Franz Aurenhammer The one-dimensional weighted Voronoi diagram Show publication in PURE
Franz Aurenhammer Power diagrams: properties, algorithms and applications Show publication in PURE
Franz Aurenhammer On the generality of power diagrams Show publication in PURE
Franz Aurenhammer and [No Value] H. Edelsbrunner An optimal algorithm for constructing the weighted Voronoi diagram in the plane Show publication in PURE
Contact
image/svg+xml

Prof. Dr. Franz Aurenhammer
Institute of Theoretical Computer Science
Inffeldgasse 16b/I
8010 Graz
Austria

Phone:  +43 316 / 873 - 5844
Fax:        +43 316 / 873 - 105844
franz.aurenhammernoSpam@igi.tugraz.at