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

Institute of Theoretical Computer Science
Graz University of Technology

 


Publications

2016
Journal Article
Franz Aurenhammer and Gernot Christian Walzl Straight skeletons and mitered offsets of nonconvex polytopes Discrete & computational geometry 2016, 743-801, 2016
Conference/Workshop Article
Franz Aurenhammer, Günter Paulini and Bert Jüttler Voronoi diagrams for parallel halflines in 3DProceedings of the 32nd European Workshop on Computational Geometry EuroCG'2016 , 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
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
Franz Aurenhammer, Bing Su, Yinfeng Xu and Binhai Zhu A note on visibility-constrained Voronoi diagrams Discrete applied mathematics 2014, 52-56, 2014 , DOI
Conference/Workshop Article
Franz Aurenhammer and Gernot Christian Walzl Three-dimensional straight skeletons from bisector graphsProc. 5th International Conference on Analytic Number Theory and Spatial Tessellations1-13
Gernot Christian Walzl and Franz Aurenhammer Polytope Offsets and Straight Skeletons in 3DProceedings of the 30th Annual Symposium on Computational Geometry (SoCG '14)98-99
2013
Conference/Workshop Article
Gernot Christian Walzl and Franz Aurenhammer Structure and Computation of Straight Skeletons in 3-SpaceProc. 24th International Symposium on Algorithms and Computation ISAAC'1344-54
Franz Aurenhammer, Mario Kapl and Bert Jüttler Voronoi Diagrams from Distance GraphsEUROCG
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
Thomas Schiffer, Franz Aurenhammer and Markus Demuth Computing Convex Quadrangulations Discrete applied mathematics 2012, 648-656, 2012 , DOI
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 arcsGraph Drawing296-307
O. Aichholzer, W. Aigner, F. Aurenhammer and B. Jüttler Exact medial axis computation for triangulated solids with respect to piecewise linear metricsCurves and Surfaces1-27
Franz Aurenhammer On triangulation axes of polygons28th European Workshop on Computational Geometry125-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 shapesComputer Vision and Pattern Recognition Workshops (CVPRW)9-16
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz and Birgit Vogtenhuber 3-Colorability of pseudo-triangulationsCollection of Abstracts of the 26th European Workshop on Computational Geometry 201021-24
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Dobiásová and Bert Jüttler Arc TriangulationsProceedings of the 26th European Workshop on Computational Geometry17-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
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 revisitedProceedings of the Twenty-Fifth Annual Symposium on Computational Geometry (SCG '09)189-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 ellipsoidsCollection of Abstracts of the 25th European Workshop on Computational Geometry 2009139-142
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado, P.A. Ramos and Jorge Urrutia Two-convex polygonsProc. 25th European Workshop on Computational Geometry EuroCG '09117-120
Oswin Aichholzer, Franz Aurenhammer, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm and Gert Vegter Recovering structure from r-sampled objectsSymposium on Geometry Processing 20091349-1360
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer and Margot Rabl Divide-and-conquer for voronoi diagrams revisitedCollection of Abstracts of the 25th European Workshop on Computational Geometry 2009293-296
2008
Book Chapter
Franz Aurenhammer and [No Value] Xu Y.-F. Optimal triangulationsEncyclopedia of Optimization2757-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
Franz Aurenhammer, Markus Demuth and Thomas Schiffer Computing convex quadrangulationsProceedings of International Symposium on Voronoi Diagrams in Science and Engineering 2008
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bernhard Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm and Gert Vegter Seed Polytopes for Incremental ApproximationCollection of Abstracts of the 24th European Workshop on Computational Geometry 200813-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-triangulationsCanadian Conference on Computational Geometry209-212
Franz Aurenhammer, Johannes Wallner, Martin Peternell and Helmut Pottmann Voronoi diagrams for oriented spheresProc. ISVD'07: 4th Int. Conf. Voronoi Diagrams in Science and Engineering33-37
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder and Zbynek Sir Computational and structural advantages of circular boundary representationInternational Workshop on Algorithms and Data Structures374-385
Bernhard Kornberger, Thomas Hackl, Franz Aurenhammer, Oswin Aichholzer, Helmut Pottmann and Martin Peternell Approximating Boundary-Triangulated Objects with BallsCollection of Abstracts of the 23rd European Workshop on Computational Geometry130-133
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
Franz Aurenhammer and [No Value] Krasser H Pseudo-simplicial complexes from maximal locally convex functions Discrete & computational geometry 2006, 201-221, 2006
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 graphsEuropean Workshop on Computational Geometry71-74
Oswin Aichholzer, Franz Aurenhammer and Thomas Hackl Pre-triangulations and liftable complexesProceedings of the Twenty-Second Annual Symposium on Computational Geometry (SCG '06)282-291
2005
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer, C. Huemer and Hannes Krasser Transforming spanning trees and pseudo-triangulationsProc. 21th European Workshop on Computational Geometry EuroCG '0581-84
Franz Aurenhammer Pre-triangulations: A generalization of Delaunay triangulations and flips2nd CFP for VD2005235-235
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 partitionsProc. 17th Canadian Conference on Computational Geometry CCCG '05123-126
Franz Aurenhammer and Hannes Krasser Pseudo-tetrahedral complexesProc. 21th European Workshop on Computational Geometry EuroCG '0585-88
B. Aronov, Oswin Aichholzer, Franz Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, S. Smorodinsky and C. Seara Small weak epsilon netsProc. 17th Canadian Conference on Computational Geometry CCCG '0551-54
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
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado and Hannes Krasser Towards compatible triangulations Theoretical computer science 2003, 3-13, 2003
Conference/Workshop Article
Franz Aurenhammer Pseudo-simplices and their derivationVoronoi Conference on Analytic Number Theory and Spatial Tesselations11-11
Oswin Aichholzer, Franz Aurenhammer, P. Brass and Hannes Krasser Spatial Embedding of Pseudo-TriangulationsProceedings of the Nineteenth Annual Symposium on Computational Geometry (SCG '03)144-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 diagramACM Symposium on Computational Geometry151-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 ClusteringConference on the Computation of Electromagnetic Fields?-?
Oswin Aichholzer, Franz Aurenhammer and H. Krasser Enumerating order types for small point sets with applicationsACM Symposium on Computational Geometry11-18
Oswin Aichholzer, Franz Aurenhammer, F. Hurtado and H. Krasser Towards Compatible TriangulationsComputing and combinatorics101-110
2000
Conference/Workshop Article
Oswin Aichholzer, Franz Aurenhammer and F. Hurtado Edge Operations on Non-Crossing Spanning TreesEuropean Workshop on Computational Geometry121-125
Oswin Aichholzer, Franz Aurenhammer, B. Brandtstätter, Thomas Ebner, H. Krasser and Christian Magele Niching evolution strategy with cluster algorithmsBiennial IEEE Conference on Electromagnetic Field Computation?-?
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 planeVoronoi's impact of modern sciences / Vol. 27-21
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curvesEuropean Workshop on Computational Geometry15-18
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe and Günter Rote Generalized self-approaching curvesAlgorithms and computation317-326
1997
Conference/Workshop Article
Oswin Aichholzer, Reinhard Hainz and Franz Aurenhammer New results on minimum-weight triangulations and the LMT skeletonEuropean Workshop on Computational Geometry4-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 figures2nd Ann. Int'l. Computing and Combinatorics Conf. COCOON'96117-126
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu Constant-level greedy triangulations approximate the MWT wellOperations research and its applications309-318
Oswin Aichholzer, Franz Aurenhammer, Günter Rote and Yinfeng Xu New greedy triangulation algorithmsEuropean Workshop on Computational Geometry11-14
Oswin Aichholzer and Franz Aurenhammer Straight skeletons for general polygonal figures in the planeComputing and combinatorics117-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 polygonsLIESMARS114-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
Conference/Workshop Article
Oswin Aichholzer and Franz Aurenhammer Classifying hyperplanes in hypercubesEuropean Workshop on Computational Geometry53-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 partitionsSystem Modelling and Optimization93-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 overlapSystem modelling and optimization77-84
Franz Aurenhammer, [No Value] Hoffmann F. and [No Value] Aronov B. Minkowski-type theorems and least-squares partitioning8th Ann. ACM Symp. Computational Geometry350-357
Franz Aurenhammer, [No Value] Hoffmann F. and [No Value] Aranov B. Least-squares partitioningEuropean Workshop on Computational Geometry55-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 diagramsACM Symposium on Computational Geometry142-151
Franz Aurenhammer, Gerd Stöckl and Emo Welzl The post-office problem for fuzzy point setsComputational geometry - methods, algorithms and applications1-11
Franz Aurenhammer and Johann Hagauer Recognizing binary Hamming graphs in O(n²log n) timeGraph-theoretic concepts in computer science90-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 DiagrammeTagunsband DMV Jubiläumstagung52-52
Franz Aurenhammer, [No Value] Hagauer J. and [No Value] Imrich W. Factoring Cartesian-product graphs at logarithmic cost per edgeInteger programming and combinatorial optimization29-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 applicationsInt. Conf. Algebraic Graph Theory11-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 timeWorkshop on Computational Geometry and Discrete Algorithms14-14
Franz Aurenhammer Using Gale transforms in computational geometryComputational geometry and its applications202-216
Franz Aurenhammer Algorithmic aspects of Gale transformsInternational Symposium on Mathematical Programming176-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 polygonsACM Symposium on Computational Geometry21-29
Franz Aurenhammer and [No Value] Imai H. Geometric relations among Voronoi diagramsAnnual Symposium on Theoretical Aspects of Computer Science53-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 diagramsInternational Colloquium on Automata, Languages and Programming21-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 VoronoidiagrammeWorkshop on Computational Geometry CG '8522-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

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