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
Franz Aurenhammer and Michael Steinkogler On merging straight skeletons
Bastian Weiß, Bert Jüttler and Franz Aurenhammer Mitered offsets and straight skeletons for circular arc polygons
Franz Aurenhammer, Michael Steinkogler and Rolf Klein Partially walking a polygon
2017
Conference/Workshop Article
Franz Aurenhammer, Bert Jüttler and Günter Paulini Voronoi diagrams for parallel halflines and line segments in spaceVoronoi diagrams for parallel halflines and line segments in space , Link
Other Article
Franz Aurenhammer, Bert Jüttler and B. Weiß Computing straight skeletons for arc polygons
2016
Journal Article
Franz Aurenhammer and Gernot Christian Walzl Straight skeletons and mitered offsets of nonconvex polytopes Discrete & computational geometry 2016, 743-801, 2016 , Link
Conference/Workshop Article
Franz Aurenhammer, Günter Paulini and Bert Jüttler Voronoi diagrams for parallel halflines in 3DVoronoi diagrams for parallel halflines in 3D , Link
2015
Journal Article
Wolfgang Aigner, Franz Aurenhammer and Bert Jüttler On Triangulation Axes of Polygons Information Processing Letters 2015, 45-51, 2015 , DOI
Oswin Aichholzer, Franz Aurenhammer, Wolfgang Aigner, Bert Jüttler, Katerina Dobiásová and G. Rote Triangulations with circular arcs Journal of Graph Algorithms and Applications 2015, 43-65, 2015
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber and Clemens Huemer 3-Colorability of Pseudo-Triangulations International Journal of Computational Geometry and Applications 2015, 283-298, 2015
Conference/Workshop Article
Franz Aurenhammer and Gernot Christian Walzl Three-dimensional straight skeletons from bisector graphsThree-dimensional straight skeletons from bisector graphs15-29
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 Computational geometry 2014, 809-832, 2014 , DOI
Franz Aurenhammer and Günter Paulini On shape Delaunay tessellations Information Processing Letters 2014, 535-541, 2014 , DOI , Link
Franz Aurenhammer, Bing Su, Yinfeng Xu and Binhai Zhu A note on visibility-constrained Voronoi diagrams Discrete applied mathematics 2014, 52-56, 2014 , DOI , Link
Conference/Workshop Article
Gernot Christian Walzl and Franz Aurenhammer Polytope Offsets and Straight Skeletons in 3DPolytope Offsets and Straight Skeletons in 3D98-99
2013
Book
Franz Aurenhammer, Rolf Klein and Der Tsai Lee Voronoi Diagrams and Delaunay TriangulationsWolrd Scientific Publishing Company , Link
Conference/Workshop Article
Mario Kapl, Franz Aurenhammer and Bert Jüttler Voronoi Diagrams from (possibly discontinous) EmbeddingsVoronoi Diagrams from (possibly discontinous) Embeddings47-50
Gernot Christian Walzl and Franz Aurenhammer Structure and Computation of Straight Skeletons in 3-SpaceStructure and Computation of Straight Skeletons in 3-Space44-54
Franz Aurenhammer, Mario Kapl and Bert Jüttler Voronoi Diagrams from Distance GraphsVoronoi Diagrams from Distance Graphs185-188
2012
Journal Article
Franz Aurenhammer and Bert Jüttler On Computing the Convex Hull of (Piecewise) Curved Objects Mathematics in computer science 2012, 261-266, 2012 , DOI , Link
Thomas Schiffer, Franz Aurenhammer and Markus Demuth Computing Convex Quadrangulations Discrete applied mathematics 2012, 648-656, 2012 , DOI , Link
Oswin Aichholzer, Franz Aurenhammer, E. Demaine, F. Hurtado, P.A. Ramos and Jorge Urrutia On k-convex polygons Computational geometry 2012, 73-87, 2012
Conference/Workshop Article
O. Aichholzer, W. Aigner, F. Aurenhammer, B. Jüttler, K. Dobiásová and G. Rote Triangulations with circular arcsTriangulations with circular arcs296-307
O. Aichholzer, W. Aigner, F. Aurenhammer and B. Jüttler Exact medial axis computation for triangulated solids with respect to piecewise linear metricsExact medial axis computation for triangulated solids with respect to piecewise linear metrics1-27
Franz Aurenhammer, Wolfgang Aigner and Bert Jüttler On triangulation axes of polygonsOn triangulation axes of polygons125-128
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 International Journal of Computational Geometry and Applications 2011, 47-69, 2011 , DOI
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 Computational geometry 2010, 688-699, 2010 , DOI
Conference/Workshop Article
Markus Demuth, Franz Aurenhammer and Axel Pinz Straight skeletons for binary shapesStraight skeletons for binary shapes9-16
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz and Birgit Vogtenhuber 3-Colorability of pseudo-triangulations3-Colorability of pseudo-triangulations21-24
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Dobiásová and Bert Jüttler Arc TriangulationsArc Triangulations17-20
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 Computer-aided design 2009, 339-349, 2009 , DOI , Link
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl and Bettina Speckmann On minimum weight pseudo-triangulations Computational geometry 2009, 627-631, 2009
B. Aranaov , Franz Aurenhammer, F. Hurtado , S. Langerman , D. Rappaport , S. Smorodinsky and C. Seara Small weak epsilon nets Computational geometry 2009, 455-462, 2009 , DOI
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 revisitedDivide-and-conquer for voronoi diagrams revisited189-197
Oswin Aichholzer, Franz Aurenhammer, Olivier Devillers, Thomas Hackl, Monique Teillaud and Birgit Vogtenhuber Lower and upper bounds on the number of empty cylinders and ellipsoidsLower and upper bounds on the number of empty cylinders and ellipsoids139-142
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado, P.A. Ramos and Jorge Urrutia Two-convex polygonsTwo-convex polygons117-120
Oswin Aichholzer, Franz Aurenhammer, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm and Gert Vegter Recovering structure from r-sampled objectsRecovering structure from r-sampled objects1349-1360
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer and Margot Rabl Divide-and-conquer for voronoi diagrams revisitedDivide-and-conquer for voronoi diagrams revisited293-296
2008
Book Chapter
Franz Aurenhammer and [No Value] Xu Y.-F. Optimal triangulationsOptimal triangulations2757-2764
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 Computational geometry 2008, 134-141, 2008 , DOI
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 ApproximationSeed Polytopes for Incremental Approximation13-16
2007
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl and Clemens Huemer Connecting colored point sets Discrete applied mathematics 2007, 271-278, 2007
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer and Birgit Vogtenhuber Gray Code Enumeration of Plane Straight Line Graphs Graphs and combinatorics 2007, 467-479, 2007
Franz Aurenhammer Weighted skeletons and fixed-share decomposition Computational geometry 2007, 93-101, 2007
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Pre-triangulations and liftable complexes Discrete & computational geometry 2007, 701-725, 2007
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl and B. Speckmann On (pointed) minimum weight pseudo-triangulationsOn (pointed) minimum weight pseudo-triangulations209-212
Franz Aurenhammer, Johannes Wallner, Martin Peternell and Helmut Pottmann Voronoi diagrams for oriented spheresVoronoi diagrams for oriented spheres33-37
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder and Zbynek Sir Computational and structural advantages of circular boundary representationComputational and structural advantages of circular boundary representation374-385
Bernhard Kornberger, Thomas Hackl, Franz Aurenhammer, Oswin Aichholzer, Helmut Pottmann and Martin Peternell Approximating Boundary-Triangulated Objects with BallsApproximating Boundary-Triangulated Objects with Balls130-133 , Link
Other Article
Franz Aurenhammer, M. Peternell, Helmut Pottmann and J. Wallner Voronoi diagrams for oriented spheres
Franz Aurenhammer, B. Speckmann, Oswin Aichholzer and Thomas Hackl On (pointed) minimum weight pseudo-triangulations
Oswin Aichholzer, Franz Aurenhammer, B. Juettler, M. Oberneder, Z. Sir and Thomas Hackl Computational and structural advantages of circular boundary representation
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, B. Kornberger , M. Peternell and Helmut Pottmann Approximating boundary-triangulated objects with balls
2006
Book
Franz Aurenhammer, [No Value] M. Peternell, [No Value] H. Pottmann and [No Value] J. Wallner Voronoi diagrams for oriented spheres.
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, B. Juettler, M. Oberneder and Z. Sir Computational and structural advantages of circular boundary representation.
Franz Aurenhammer, B. Kornberger , M. Peternell , H. Pottmann, Oswin Aichholzer and Thomas Hackl Approximating boundary-triangulated objects with balls.
Franz Aurenhammer, [No Value] R. L. S. Drysdale and [No Value] H. Krasser Farthest line segment Voronoi diagrams.
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Connecting colored point sets.
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulations.
Franz Aurenhammer and [No Value] H. Krasser Pseudo-simplicial complexes from maximal locally convex functions.
Journal Article
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulations Information Processing Letters 2006, 19-22, 2006 , Link
Franz Aurenhammer and [No Value] Krasser H Pseudo-simplicial complexes from maximal locally convex functions Discrete & computational geometry 2006, 201-221, 2006 , Link
Franz Aurenhammer, R. L. S. Drysdale and Hannes Krasser Farthest line segment Voronoi diagrams Information Processing Letters 2006, 220-225, 2006
Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser On the crossing number of complete graphs Computing <Wien> 2006, 165-176, 2006
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Birgit Vogtenhuber Gray code enumeration of plane straight-line graphsGray code enumeration of plane straight-line graphs71-74 , Link
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Pre-triangulations and liftable complexesPre-triangulations and liftable complexes282-291
2005
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulationsTransforming spanning trees and pseudo-triangulations81-84 , Link
Franz Aurenhammer Pre-triangulations: A generalization of Delaunay triangulations and flipsPre-triangulations: A generalization of Delaunay triangulations and flips235-235 , Link
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 partitionsMatching edges and faces in polygonal partitions123-126 , Link
Franz Aurenhammer and Hannes Krasser Pseudo-tetrahedral complexesPseudo-tetrahedral complexes85-88 , Link
B. Aronov, Oswin Aichholzer, Franz Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, S. Smorodinsky and C. Seara Small weak epsilon netsSmall weak epsilon nets51-54 , Link
2004
Journal Article
Oswin Aichholzer, Franz Aurenhammer and B. Palop Quickest paths, straight skeletons, and the city Voronoi diagram Discrete & computational geometry 2004, 17-35, 2004
Oswin Aichholzer, Franz Aurenhammer, H. Krasser and B. Speckmann Convexity minimizes pseudo-triangulations Computational geometry 2004, 3-10, 2004
2003
Journal Article
Oswin Aichholzer, Franz Aurenhammer, P. Brass and Hannes Krasser Pseudo-triangulations from surfaces and a novel type of edge flip SIAM journal on computing 2003, 1621-1653, 2003 , Link
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado and Hannes Krasser Towards compatible triangulations Theoretical computer science 2003, 3-13, 2003 , Link
Conference/Workshop Article
Franz Aurenhammer Pseudo-simplices and their derivationPseudo-simplices and their derivation11-11 , Link
Oswin Aichholzer, Franz Aurenhammer, P. Brass and Hannes Krasser Spatial Embedding of Pseudo-TriangulationsSpatial Embedding of Pseudo-Triangulations144-153
2002
Book
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Progress on rectilinear crossing numbers.
Journal Article
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Points and combinatorics Telematik 2002, 12-17, 2002
Oswin Aichholzer, Franz Aurenhammer, Bernhard Brandstätter, Thomas Ebner, Hannes Krasser, Christian Magele and Martin Mühlmann Evolution strategy and hierarchical clustering IEEE Transactions on Magnetics 2002, 1041-1044, 2002
Oswin Aichholzer and Franz Aurenhammer Voronoi diagrams - computational geometry's favorite Telematik 2002, 7-11, 2002
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer and Belén Palop Quickest paths, straight skeletons, and the city Voronoi diagramQuickest paths, straight skeletons, and the city Voronoi diagram151-159
2001
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curves Discrete applied mathematics 2001, 3-24, 2001
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, B. Brandtstätter, H. Krasser, Christian Magele, Martin Mühlmann and Werner Renhart Evolution Strategy and Hierarchical ClusteringEvolution Strategy and Hierarchical Clustering?-?
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Enumerating order types for small point sets with applicationsEnumerating order types for small point sets with applications11-18
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado and H. Krasser Towards Compatible TriangulationsTowards Compatible Triangulations101-110 , Link
2000
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer and F. Hurtado Edge Operations on Non-Crossing Spanning TreesEdge Operations on Non-Crossing Spanning Trees121-125
Oswin Aichholzer, Franz Aurenhammer, B. Brandtstätter, Thomas Ebner, H. Krasser and Christian Magele Niching evolution strategy with cluster algorithmsNiching evolution strategy with cluster algorithms?-?
1999
Journal Article
Oswin Aichholzer, Franz Aurenhammer and Reinhard Hainz New results on MWT subgraphs Information Processing Letters 1999, 215-219, 1999
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D.T. Lee and Evanthia Papadopoulou Skew Voronoi diagrams International Journal of Computational Geometry and Applications 1999, 235-247, 1999 , DOI
1998
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu Constant-level greedy triangulations approximate the MWT well Journal of combinatorial optimization 1998, 361-369, 1998
Conference/Workshop Article
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures in the planeStraight skeletons for general polygonal figures in the plane7-21
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curvesGeneralized self-approaching curves15-18
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curvesGeneralized self-approaching curves317-326 , Link
1997
Conference/Workshop Article
Oswin Aichholzer, Reinhard Hainz and Franz Aurenhammer New results on minimum-weight triangulations and the LMT skeletonNew results on minimum-weight triangulations and the LMT skeleton4-6
1996
Journal Article
Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, N. Katoh, G. Rote, M. Taschwer and Yin-Feng Xu Triangulations intersect nicely Discrete & computational geometry 1996, 339-359, 1996 , Link
Conference/Workshop Article
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figuresStraight skeletons for general polygonal figures117-126
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu Constant-level greedy triangulations approximate the MWT wellConstant-level greedy triangulations approximate the MWT well309-318
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu New greedy triangulation algorithmsNew greedy triangulation algorithms11-14
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures in the planeStraight skeletons for general polygonal figures in the plane117-126
1995
Book
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures.
Oswin Aichholzer, Franz Aurenhammer and Günter Rote Optimal graph orientation with storage applications.
Journal Article
Oswin Aichholzer, D. Alberts, Franz Aurenhammer and B. Gärtner A novel type of skeleton for polygons Journal of Universal Computer Science 1995, 752-761, 1995
Conference/Workshop Article
Oswin Aichholzer, D. Alberts, Franz Aurenhammer and B. Gärtner Straight skeletons of simple polygonsStraight skeletons of simple polygons114-124
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 Discrete applied mathematics 1994, 17-28, 1994 , Link
Conference/Workshop Article
Oswin Aichholzer and Franz Aurenhammer Classifying hyperplanes in hypercubesClassifying hyperplanes in hypercubes53-57
Other Article
Oswin Aichholzer and Franz Aurenhammer Classifying hyperplanes in hypercubes
1993
Journal Article
Franz Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure ACM Computing Surveys 1993, 131-185, 1993
Conference/Workshop Article
Franz Aurenhammer Geometric clustering and Voronoi-type partitionsGeometric clustering and Voronoi-type partitions93-94
1992
Book
Franz Aurenhammer, [No Value] F. Hoffmann and [No Value] B. Aronov Minkowski-type theorems and least-squares partitioning.
Journal Article
Franz Aurenhammer and Johann Hagauer Computing equivalence classes among the edges of a graph with applications Discrete Mathematics 1992, 3-12, 1992 , DOI
Franz Aurenhammer, Johann Hagauer and W. Imrich Cartesian graph factorization at logarithmic cost per edge Computational complexity 1992, 331-349, 1992 , DOI
Franz Aurenhammer and Gerd Stöckl Searching for segments with largest relative operlap Information Processing Letters 1992, 103-108, 1992 , DOI
Franz Aurenhammer and Otfried Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams International Journal of Computational Geometry and Applications 1992, 363-381, 1992 , DOI
Conference/Workshop Article
Franz Aurenhammer and [No Value] Stöckl H. Searching for sements with largest relative overlapSearching for sements with largest relative overlap77-84
Franz Aurenhammer, [No Value] Hoffmann F. and [No Value] Aronov B. Minkowski-type theorems and least-squares partitioningMinkowski-type theorems and least-squares partitioning350-357
Franz Aurenhammer, [No Value] Hoffmann F. and [No Value] Aranov B. Least-squares partitioningLeast-squares partitioning55-57
Other Article
Franz Aurenhammer, [No Value] F. Hoffmann and [No Value] B. Aronov Minkowski-type theorems and least-squares partitioning
Franz Aurenhammer and G. Stöckl Searching for segments with largest relative overlap
Franz Aurenhammer, [No Value] F. Hoffmann and [No Value] B. Aronov Least-squares partitioning
1991
Book
Franz Aurenhammer and [No Value] G. Stöckl Searching for segments with largest relative operlap.
Franz Aurenhammer The post-office problem for fuzzy points sets.
Franz Aurenhammer and Otfried Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams.
Journal Article
Franz Aurenhammer and Gerd Stöckl On the peeper's Voronoi diagram SIGACT news 1991, 50-59, 1991
Franz Aurenhammer Using Gale transforms in computational geometry Mathematical programming 1991, 179-190, 1991
Franz Aurenhammer Voronoi diagrams - a survey of a fundamental geometric data structure ACM Computing Surveys 1991, 345-405, 1991
Conference/Workshop Article
Franz Aurenhammer and [No Value] Schwarzkopf O. A simple on-line randomized incremental algorithm for computing higher order Voronoi diagramsA simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams142-151
Franz Aurenhammer, Gerd Stöckl and Emo Welzl The post-office problem for fuzzy point setsThe post-office problem for fuzzy point sets1-11
Franz Aurenhammer and Johann Hagauer Recognizing binary Hamming graphs in O(n²log n) timeRecognizing binary Hamming graphs in O(n²log n) time90-98
Other Article
Franz Aurenhammer and [No Value] J. Hagauer Recognizing binary Hamming graphs in O(n²logn)time
Franz Aurenhammer and O. Schwarzkopf A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
Franz Aurenhammer, G. Stöckl and Emo Welzl The post-office problem for fuzzy points sets
1990
Book
Franz Aurenhammer, [No Value] J. Hagauer and [No Value] W. Imrich Factoring Cartesian-product graphs at logarithmic cost per edge.
Franz Aurenhammer Voronoi diagrams - a survey of a fundamental geomtric data structure.
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.
Journal Article
Franz Aurenhammer A new duality result concerning Voronoi diagrams Discrete & computational geometry 1990, 243-254, 1990
Franz Aurenhammer A relationship between Gale transforms and Voronoi diagrams Discrete applied mathematics 1990, 83-91, 1990
Conference/Workshop Article
Franz Aurenhammer and [No Value] G. Stöckl Fenster - Voronoi DiagrammeFenster - Voronoi Diagramme52-52
Franz Aurenhammer, [No Value] Hagauer J. and [No Value] Imrich W. Factoring Cartesian-product graphs at logarithmic cost per edgeFactoring Cartesian-product graphs at logarithmic cost per edge29-44
Other Article
Franz Aurenhammer, [No Value] J. Hagauer and [No Value] W. Imrich Factoring Cartesian-product graphs at lograithmic cost per edge
1989
Book
Franz Aurenhammer and [No Value] J. Hagauer Computing equivalence classes among the edges of a graph with applications.
Conference/Workshop Article
Franz Aurenhammer and [No Value] J. Hagauer Computing equivalence classes among the edges of a graph with applicationsComputing equivalence classes among the edges of a graph with applications11-11
Other Article
Franz Aurenhammer and [No Value] J. Hagauer Computing equivalence classes among the edges of a graph with applications
1988
Book
Franz Aurenhammer and [No Value] G. Stöckl On the peeper's Voronoi diagram.
Franz Aurenhammer A relationship between Gale transforms and Voronoi diagrams.
Franz Aurenhammer Using Gale transforms in computational geomtry.
Journal Article
Franz Aurenhammer and H. Imai Geometric relations among Voronoi diagrams Geometriae dedicata 1988, 65-75, 1988 , DOI
Franz Aurenhammer On-line sorting of twisted sequences in linear time BIT - Numerical Mathematics 1988, 194-204, 1988 , DOI
Franz Aurenhammer Improved algorithms for discs and balls using power diagrams Journal of algorithms 1988, 151-161, 1988
Franz Aurenhammer Linear combinations from power domains Geometriae dedicata 1988, 45-52, 1988 , DOI
Conference/Workshop Article
Franz Aurenhammer On-line sorting of twisted sequences in linear timeOn-line sorting of twisted sequences in linear time14-14
Franz Aurenhammer Using Gale transforms in computational geometryUsing Gale transforms in computational geometry202-216
Franz Aurenhammer Algorithmic aspects of Gale transformsAlgorithmic aspects of Gale transforms176-176
1987
Book
Franz Aurenhammer Linear combinations from power domains.
Franz Aurenhammer On-line sorting of twisted sequences in linear time.
Journal Article
Franz Aurenhammer A criterion for the affine equivalence of cell complexes in Rd and convex polyhedra in Rd+1 Discrete & computational geometry 1987, 49-64, 1987
Franz Aurenhammer Power diagrams: properties, algorithms and applications SIAM journal on computing 1987, 78-96, 1987
Franz Aurenhammer Recognizing polytopical cell complexes and constructing projection ployhedra Journal of symbolic computation 1987, 249-255, 1987
Conference/Workshop Article
Franz Aurenhammer Jordan sorting via convex hulls of certain non-simple polygonsJordan sorting via convex hulls of certain non-simple polygons21-29
Franz Aurenhammer and [No Value] Imai H. Geometric relations among Voronoi diagramsGeometric relations among Voronoi diagrams53-65
Other Article
Franz Aurenhammer and [No Value] H. Imai Geometric relations among Voronoi diagrams
1986
Book
Franz Aurenhammer and [No Value] H. Imai Geometric relations among Voronoi diagrams.
Journal Article
Franz Aurenhammer The one-dimensional weighted Voronoi diagram Information Processing Letters 1986, 119-123, 1986
Conference/Workshop Article
Franz Aurenhammer A new duality result concerning Vornonoi diagramsA new duality result concerning Vornonoi diagrams21-32
1985
Book
Franz Aurenhammer Recognizing polytopical cell complexes and constructing projection polyhedra.
Franz Aurenhammer Improved algorithms for discs and balls using power diagrams.
Franz Aurenhammer A criterion for the affine equivalence of cell compleses in Rd and convex polyhedra in Rd+1.
Franz Aurenhammer A new duality result concerning Voronoi diagrams. , Link
Conference/Workshop Article
Franz Aurenhammer Gewichtete VoronoidiagrammeGewichtete Voronoidiagramme22-22
1984
Book
Franz Aurenhammer Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-Algorithmen.
Journal Article
Franz Aurenhammer and H. Edelsbrunner An optimal algorithm for constructing the weighted Voronoi diagram in the plane Pattern recognition 1984, 251-257, 1984 , DOI
1983
Book
Franz Aurenhammer On the generality of power diagrams.
Franz Aurenhammer Power diagrams: properties, algorithms and applications.
Franz Aurenhammer The one-dimensional weighted Voronoi diagram.
Franz Aurenhammer and [No Value] H. Edelsbrunner An optimal algorithm for constructing the weighted Voronoi diagram in the plane. , Link

To top

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