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

              Institute of Theoretical Computer Science
                      Graz University of Technology

 


Publications


2018
Other Article
Franz Aurenhammer, Michael Steinkogler and Rolf Klein Maximal Two-Guard Walks in Polygons Show publication in PURE
Franz Aurenhammer and Michael Steinkogler On merging straight skeletons Show publication in PURE
Bastian Weiß, Bert Jüttler and Franz Aurenhammer Mitered offsets and straight skeletons for circular arc polygons Show publication in PURE
Franz Aurenhammer, Michael Steinkogler and Rolf Klein Partially walking a polygon Show publication in PURE
2017
Conference/Workshop Article
Franz Aurenhammer, Bert Jüttler and Günter Paulini Voronoi diagrams for parallel halflines and line segments in space Voronoi diagrams for parallel halflines and line segments in space 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
Franz Aurenhammer and Gernot Christian Walzl Straight skeletons and mitered offsets of nonconvex polytopes Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer, Günter Paulini and Bert Jüttler Voronoi diagrams for parallel halflines in 3D Voronoi diagrams for parallel halflines in 3D Show publication in PURE
2015
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber and Clemens Huemer 3-Colorability of Pseudo-Triangulations Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Wolfgang Aigner, Bert Jüttler, Katerina Dobiásová and G. Rote Triangulations with circular arcs Show publication in PURE
Wolfgang Aigner, Franz Aurenhammer and Bert Jüttler On Triangulation Axes of Polygons Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer and Gernot Christian Walzl Three-dimensional straight skeletons from bisector graphs Three-dimensional straight skeletons from bisector graphs 15-29 Show publication in PURE
2014
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr and Birgit Vogtenhuber On k-Convex Point Sets Show publication in PURE
Franz Aurenhammer, Bing Su, Yinfeng Xu and Binhai Zhu A note on visibility-constrained Voronoi diagrams Show publication in PURE
Franz Aurenhammer and Günter Paulini On shape Delaunay tessellations Show publication in PURE
Conference/Workshop Article
Gernot Christian Walzl and Franz Aurenhammer Polytope Offsets and Straight Skeletons in 3D Polytope Offsets and Straight Skeletons in 3D 98-99 Show publication in PURE
2013
Book
Franz Aurenhammer, Rolf Klein and Der Tsai Lee Voronoi Diagrams and Delaunay TriangulationsWolrd Scientific Publishing Company Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer, Mario Kapl and Bert Jüttler Voronoi Diagrams from Distance Graphs Voronoi Diagrams from Distance Graphs 185-188 Show publication in PURE
Mario Kapl, Franz Aurenhammer and Bert Jüttler Voronoi Diagrams from (possibly discontinous) Embeddings Voronoi Diagrams from (possibly discontinous) Embeddings 47-50 Show publication in PURE
Gernot Christian Walzl and Franz Aurenhammer Structure and Computation of Straight Skeletons in 3-Space Structure and Computation of Straight Skeletons in 3-Space 44-54 Show publication in PURE
2012
Journal Article
Thomas Schiffer, Franz Aurenhammer and Markus Demuth Computing Convex Quadrangulations Show publication in PURE
Franz Aurenhammer and Bert Jüttler On Computing the Convex Hull of (Piecewise) Curved Objects Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, E. Demaine, F. Hurtado, P.A. Ramos and Jorge Urrutia On k-convex polygons 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 Exact medial axis computation for triangulated solids with respect to piecewise linear metrics 1-27 Show publication in PURE
O. Aichholzer, W. Aigner, F. Aurenhammer, B. Jüttler, K. Dobiásová and G. Rote Triangulations with circular arcs Triangulations with circular arcs 296-307 Show publication in PURE
Franz Aurenhammer, Wolfgang Aigner and Bert Jüttler On triangulation axes of polygons On triangulation axes of polygons 125-128 Show publication in PURE
2011
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder and Zbynek Sir Computational and structural advantages of circular boundary representation Show publication in PURE
2010
Journal Article
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, [No Value] Jüttler B., [No Value] Pilgerstorfer E. and [No Value] Rabl M. Divide-and conquer for Voronoi diagrams revisited Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Dobiásová and Bert Jüttler Arc Triangulations Arc Triangulations 17-20 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz and Birgit Vogtenhuber 3-Colorability of pseudo-triangulations 3-Colorability of pseudo-triangulations 21-24 Show publication in PURE
Markus Demuth, Franz Aurenhammer and Axel Pinz Straight skeletons for binary shapes Straight skeletons for binary shapes 9-16 Show publication in PURE
2009
Journal Article
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler and Margot Rabl Medial axis computation for planar free-form shapes Show publication in PURE
B. Aranaov , Franz Aurenhammer, F. Hurtado , S. Langerman , D. Rappaport , S. Smorodinsky and C. Seara Small weak epsilon nets Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl and Bettina Speckmann On minimum weight pseudo-triangulations Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer and Margot Rabl Divide-and-conquer for voronoi diagrams revisited Divide-and-conquer for voronoi diagrams revisited 293-296 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm and Gert Vegter Recovering structure from r-sampled objects Recovering structure from r-sampled objects 1349-1360 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado, P.A. Ramos and Jorge Urrutia Two-convex polygons Two-convex polygons 117-120 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Olivier Devillers, Thomas Hackl, Monique Teillaud and Birgit Vogtenhuber Lower and upper bounds on the number of empty cylinders and ellipsoids Lower and upper bounds on the number of empty cylinders and ellipsoids 139-142 Show publication in PURE
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer and Margot Rabl Divide-and-conquer for voronoi diagrams revisited Divide-and-conquer for voronoi diagrams revisited 189-197 Show publication in PURE
2008
Book Chapter
Franz Aurenhammer and [No Value] Xu Y.-F. Optimal triangulationsOptimal triangulations2757-2764 Show publication in PURE
Journal Article
Oswin Aichholzer, Franz Aurenhammer, P. Gonzalez-Nava, Thomas Hackl, Clemens Huemer, F. Hurtado, Hannes Krasser, S. Ray and Birgit Vogtenhuber Matching edges and faces in polygonal partitions Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm and Gert Vegter Seed Polytopes for Incremental Approximation Seed Polytopes for Incremental Approximation 13-16 Show publication in PURE
2007
Journal Article
Franz Aurenhammer Weighted skeletons and fixed-share decomposition Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl and Clemens Huemer Connecting colored point sets Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer and Birgit Vogtenhuber Gray Code Enumeration of Plane Straight Line Graphs Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Pre-triangulations and liftable complexes Show publication in PURE
Conference/Workshop Article
Bernhard Kornberger, Thomas Hackl, Franz Aurenhammer, Oswin Aichholzer, Helmut Pottmann and Martin Peternell Approximating Boundary-Triangulated Objects with Balls Approximating Boundary-Triangulated Objects with Balls 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 Computational and structural advantages of circular boundary representation 374-385 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl and B. Speckmann On (pointed) minimum weight pseudo-triangulations On (pointed) minimum weight pseudo-triangulations 209-212 Show publication in PURE
Franz Aurenhammer, Johannes Wallner, Martin Peternell and Helmut Pottmann Voronoi diagrams for oriented spheres Voronoi diagrams for oriented spheres 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
Oswin Aichholzer, Franz Aurenhammer, B. Juettler, M. Oberneder, Z. Sir and Thomas Hackl 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
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
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Connecting colored point sets. Show publication in PURE
Journal Article
Franz Aurenhammer, R. L. S. Drysdale and Hannes Krasser Farthest line segment Voronoi diagrams Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser On the crossing number of complete graphs Show publication in PURE
Franz Aurenhammer and [No Value] Krasser H Pseudo-simplicial complexes from maximal locally convex functions Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulations Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Birgit Vogtenhuber Gray code enumeration of plane straight-line graphs Gray code enumeration of plane straight-line graphs 71-74 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Pre-triangulations and liftable complexes Pre-triangulations and liftable complexes 282-291 Show publication in PURE
2005
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, P. Gonzalez-Nava, Thomas Hackl, C. Huemer, F. Hurtado, Hannes Krasser, S. Ray and Birgit Vogtenhuber Matching edges and faces in polygonal partitions Matching edges and faces in polygonal partitions 123-126 Show publication in PURE
Franz Aurenhammer Pre-triangulations: A generalization of Delaunay triangulations and flips Pre-triangulations: A generalization of Delaunay triangulations and flips 235-235 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulations Transforming spanning trees and pseudo-triangulations 81-84 Show publication in PURE
B. Aronov, Oswin Aichholzer, Franz Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, S. Smorodinsky and C. Seara Small weak epsilon nets Small weak epsilon nets 51-54 Show publication in PURE
Franz Aurenhammer and Hannes Krasser Pseudo-tetrahedral complexes Pseudo-tetrahedral complexes 85-88 Show publication in PURE
2004
Journal Article
Oswin Aichholzer, Franz Aurenhammer, H. Krasser and B. Speckmann Convexity minimizes pseudo-triangulations Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and B. Palop Quickest paths, straight skeletons, and the city Voronoi diagram Show publication in PURE
2003
Journal Article
Oswin Aichholzer, Franz Aurenhammer, P. Brass and Hannes Krasser Pseudo-triangulations from surfaces and a novel type of edge flip Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado and Hannes Krasser Towards compatible triangulations Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Pseudo-simplices and their derivation Pseudo-simplices and their derivation 11-11 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, P. Brass and Hannes Krasser Spatial Embedding of Pseudo-Triangulations Spatial Embedding of Pseudo-Triangulations 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
Oswin Aichholzer and Franz Aurenhammer Voronoi diagrams - computational geometry's favorite Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Bernhard Brandstätter, Thomas Ebner, Hannes Krasser, Christian Magele and Martin Mühlmann Evolution strategy and hierarchical clustering Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Points and combinatorics Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer and Belén Palop Quickest paths, straight skeletons, and the city Voronoi diagram Quickest paths, straight skeletons, and the city Voronoi diagram 151-159 Show publication in PURE
2001
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curves Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado and H. Krasser Towards Compatible Triangulations Towards Compatible Triangulations 101-110 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Enumerating order types for small point sets with applications Enumerating order types for small point sets with applications 11-18 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, B. Brandtstätter, H. Krasser, Christian Magele, Martin Mühlmann and Werner Renhart Evolution Strategy and Hierarchical Clustering Evolution Strategy and Hierarchical Clustering ?-? Show publication in PURE
2000
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer and F. Hurtado Edge Operations on Non-Crossing Spanning Trees Edge Operations on Non-Crossing Spanning Trees 121-125 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, B. Brandtstätter, Thomas Ebner, H. Krasser and Christian Magele Niching evolution strategy with cluster algorithms Niching evolution strategy with cluster algorithms ?-? Show publication in PURE
1999
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D.T. Lee and Evanthia Papadopoulou Skew Voronoi diagrams Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer and Reinhard Hainz New results on MWT subgraphs Show publication in PURE
1998
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu Constant-level greedy triangulations approximate the MWT well Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curves Generalized self-approaching curves 15-18 Show publication in PURE
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures in the plane Straight skeletons for general polygonal figures in the plane 7-21 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curves Generalized self-approaching curves 317-326 Show publication in PURE
1997
Conference/Workshop Article
Oswin Aichholzer, Reinhard Hainz and Franz Aurenhammer New results on minimum-weight triangulations and the LMT skeleton New results on minimum-weight triangulations and the LMT skeleton 4-6 Show publication in PURE
1996
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, N. Katoh, G. Rote, M. Taschwer and Yin-Feng Xu Triangulations intersect nicely Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures Straight skeletons for general polygonal figures 117-126 Show publication in PURE
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures in the plane Straight skeletons for general polygonal figures in the plane 117-126 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu New greedy triangulation algorithms New greedy triangulation algorithms 11-14 Show publication in PURE
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu Constant-level greedy triangulations approximate the MWT well Constant-level greedy triangulations approximate the MWT well 309-318 Show publication in PURE
1995
Book
Oswin Aichholzer, Franz Aurenhammer and Günter 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
Oswin Aichholzer, D. Alberts, Franz Aurenhammer and B. Gärtner A novel type of skeleton for polygons Show publication in PURE
Conference/Workshop Article
Oswin Aichholzer, D. Alberts, Franz Aurenhammer and B. Gärtner Straight skeletons of simple polygons Straight skeletons of simple polygons 114-124 Show publication in PURE
1994
Journal Article
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
Conference/Workshop Article
Oswin Aichholzer and Franz Aurenhammer Classifying hyperplanes in hypercubes Classifying hyperplanes in hypercubes 53-57 Show publication in PURE
Other Article
Oswin Aichholzer and Franz Aurenhammer Classifying hyperplanes in hypercubes Show publication in PURE
1993
Journal Article
Franz Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Geometric clustering and Voronoi-type partitions Geometric clustering and Voronoi-type partitions 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
Journal Article
Franz Aurenhammer and Johann 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
Franz Aurenhammer, Johann Hagauer and W. Imrich Cartesian graph factorization at logarithmic cost per edge Show publication in PURE
Franz Aurenhammer and Gerd 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 Least-squares partitioning 55-57 Show publication in PURE
Franz Aurenhammer and [No Value] Stöckl H. Searching for sements with largest relative overlap Searching for sements with largest relative overlap 77-84 Show publication in PURE
Franz Aurenhammer, [No Value] Hoffmann F. and [No Value] Aronov B. Minkowski-type theorems and least-squares partitioning Minkowski-type theorems and least-squares partitioning 350-357 Show publication in PURE
Other Article
Franz Aurenhammer, [No Value] F. Hoffmann and [No Value] 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 The post-office problem for fuzzy points sets. 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
Franz Aurenhammer and [No Value] G. Stöckl Searching for segments with largest relative operlap. Show publication in PURE
Journal Article
Franz Aurenhammer Using Gale transforms in computational geometry Show publication in PURE
Franz Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure Show publication in PURE
Franz Aurenhammer and Gerd Stöckl On the peeper's Voronoi diagram Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer, Gerd Stöckl and Emo Welzl The post-office problem for fuzzy point sets The post-office problem for fuzzy point sets 1-11 Show publication in PURE
Franz Aurenhammer and [No Value] Schwarzkopf O. A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams 142-151 Show publication in PURE
Franz Aurenhammer and Johann Hagauer Recognizing binary Hamming graphs in O(n²log n) time Recognizing binary Hamming graphs in O(n²log n) time 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
Franz Aurenhammer A relationship between Gale transforms and Voronoi diagrams Show publication in PURE
Franz Aurenhammer A new duality result concerning Voronoi diagrams Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer, [No Value] Hagauer J. and [No Value] Imrich W. Factoring Cartesian-product graphs at logarithmic cost per edge Factoring Cartesian-product graphs at logarithmic cost per edge 29-44 Show publication in PURE
Franz Aurenhammer and [No Value] G. Stöckl Fenster - Voronoi Diagramme Fenster - Voronoi Diagramme 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
Franz Aurenhammer and [No Value] J. Hagauer Computing equivalence classes among the edges of a graph with applications Computing equivalence classes among the edges of a graph with applications 11-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
Franz Aurenhammer Improved algorithms for discs and balls using power diagrams Show publication in PURE
Franz Aurenhammer On-line sorting of twisted sequences in linear time Show publication in PURE
Franz Aurenhammer Linear combinations from power domains Show publication in PURE
Franz Aurenhammer and H. Imai Geometric relations among Voronoi diagrams Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Algorithmic aspects of Gale transforms Algorithmic aspects of Gale transforms 176-176 Show publication in PURE
Franz Aurenhammer Using Gale transforms in computational geometry Using Gale transforms in computational geometry 202-216 Show publication in PURE
Franz Aurenhammer On-line sorting of twisted sequences in linear time On-line sorting of twisted sequences in linear time 14-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
Franz Aurenhammer A criterion for the affine equivalence of cell complexes in Rd and convex polyhedra in Rd+1 Show publication in PURE
Franz Aurenhammer Recognizing polytopical cell complexes and constructing projection ployhedra Show publication in PURE
Franz Aurenhammer Power diagrams: properties, algorithms and applications Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Jordan sorting via convex hulls of certain non-simple polygons Jordan sorting via convex hulls of certain non-simple polygons 21-29 Show publication in PURE
Franz Aurenhammer and [No Value] Imai H. Geometric relations among Voronoi diagrams Geometric relations among Voronoi diagrams 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
Franz Aurenhammer The one-dimensional weighted Voronoi diagram Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer A new duality result concerning Vornonoi diagrams A new duality result concerning Vornonoi diagrams 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
Franz Aurenhammer Gewichtete Voronoidiagramme Gewichtete Voronoidiagramme 22-22 Show publication in PURE
1984
Book
Franz Aurenhammer Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-Algorithmen. Show publication in PURE
Journal Article
Franz 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
0
Conference/Workshop Article
Franz Aurenhammer, Markus Demuth and Thomas Schiffer Computing convex quadrangulations Computing convex quadrangulations 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