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

              Institute of Theoretical Computer Science
                      Graz University of Technology


                 Research          Teaching            Projects             Publications


Publications


2019
Journal Article
Franz Aurenhammer Partially walking a polygon Show publication in PURE
2018
Other Article
Franz Aurenhammer Maximal Two-Guard Walks in Polygons Show publication in PURE
Franz Aurenhammer On merging straight skeletons Show publication in PURE
Franz Aurenhammer Mitered offsets and straight skeletons for circular arc polygons Show publication in PURE
Franz Aurenhammer Partially walking a polygon Show publication in PURE
2017
Conference/Workshop Article
Franz Aurenhammer Voronoi diagrams for parallel halflines and line segments in space LIPIcs-Leibniz International Proceedings in Informatics Show publication in PURE
Other Article
Franz Aurenhammer Computing straight skeletons for arc polygons Show publication in PURE
2016
Journal Article
Franz Aurenhammer Straight skeletons and mitered offsets of nonconvex polytopes Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Voronoi diagrams for parallel halflines in 3D Proceedings of the 32nd European Workshop on Computational Geometry EuroCG'2016 Show publication in PURE
2015
Journal Article
Franz Aurenhammer 3-Colorability of Pseudo-Triangulations Show publication in PURE
Franz Aurenhammer Triangulations with circular arcs Show publication in PURE
Franz Aurenhammer On Triangulation Axes of Polygons Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer 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
Franz Aurenhammer On k-Convex Point Sets Show publication in PURE
Franz Aurenhammer A note on visibility-constrained Voronoi diagrams Show publication in PURE
Franz Aurenhammer On shape Delaunay tessellations Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Polytope Offsets and Straight Skeletons in 3D Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG '14) 98-99 Show publication in PURE
2013
Book
Franz Aurenhammer Voronoi Diagrams and Delaunay Triangulations Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Voronoi Diagrams from Distance Graphs Proceeding 20th European Workshop on Computational Geometry EUROCG 2013 185-188 Show publication in PURE
Franz Aurenhammer Voronoi Diagrams from (possibly discontinous) Embeddings Proc. International Symposium on Voronoi Diagrams ISVD 2013, IEEE Computer Society 47-50 Show publication in PURE
Franz Aurenhammer 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
Franz Aurenhammer On k-convex polygons Show publication in PURE
Franz Aurenhammer Computing Convex Quadrangulations Show publication in PURE
Franz Aurenhammer On Computing the Convex Hull of (Piecewise) Curved Objects Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Exact medial axis computation for triangulated solids with respect to piecewise linear metrics Curves and Surfaces 1-27 Show publication in PURE
Franz Aurenhammer Triangulations with circular arcs Graph Drawing 296-307 Show publication in PURE
Franz Aurenhammer On triangulation axes of polygons Proc. 28th European Workshop on Computational Geometry EUROCG'2012 125-128 Show publication in PURE
2011
Journal Article
Franz Aurenhammer Computational and structural advantages of circular boundary representation Show publication in PURE
2010
Journal Article
Franz Aurenhammer Divide-and conquer for Voronoi diagrams revisited Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Arc Triangulations Proceedings of the 26th European Workshop on Computational Geometry 17-20 Show publication in PURE
Franz Aurenhammer 3-Colorability of pseudo-triangulations Collection of Abstracts of the 26th European Workshop on Computational Geometry 2010 21-24 Show publication in PURE
Franz Aurenhammer Straight skeletons for binary shapes Computer Vision and Pattern Recognition Workshops (CVPRW) 9-16 Show publication in PURE
2009
Journal Article
Franz Aurenhammer On minimum weight pseudo-triangulations Show publication in PURE
Franz Aurenhammer Medial axis computation for planar free-form shapes Show publication in PURE
Franz Aurenhammer Small weak epsilon nets Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Divide-and-conquer for voronoi diagrams revisited Collection of Abstracts of the 25th European Workshop on Computational Geometry 2009 293-296 Show publication in PURE
Franz Aurenhammer Recovering structure from r-sampled objects Symposium on Geometry Processing 2009 1349-1360 Show publication in PURE
Franz Aurenhammer Two-convex polygons Proc. 25th European Workshop on Computational Geometry EuroCG '09 117-120 Show publication in PURE
Franz Aurenhammer Lower and upper bounds on the number of empty cylinders and ellipsoids Collection of Abstracts of the 25th European Workshop on Computational Geometry 2009 139-142 Show publication in PURE
Franz Aurenhammer Divide-and-conquer for voronoi diagrams revisited Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry (SCG '09) 189-197 Show publication in PURE
2008
Book Chapter
Franz Aurenhammer Optimal triangulationsEncyclopedia of Optimization2757-2764 Show publication in PURE
Journal Article
Franz Aurenhammer Matching edges and faces in polygonal partitions Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Computing convex quadrangulations Proceedings of International Symposium on Voronoi Diagrams in Science and Engineering 2008 Show publication in PURE
Franz Aurenhammer Seed Polytopes for Incremental Approximation Collection of Abstracts of the 24th European Workshop on Computational Geometry 2008 13-16 Show publication in PURE
2007
Journal Article
Franz Aurenhammer Pre-triangulations and liftable complexes Show publication in PURE
Franz Aurenhammer Weighted skeletons and fixed-share decomposition Show publication in PURE
Franz Aurenhammer Connecting colored point sets Show publication in PURE
Franz Aurenhammer Gray Code Enumeration of Plane Straight Line Graphs Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Approximating Boundary-Triangulated Objects with Balls Collection of Abstracts of the 23rd European Workshop on Computational Geometry 130-133 Show publication in PURE
Franz Aurenhammer Computational and structural advantages of circular boundary representation International Workshop on Algorithms and Data Structures 374-385 Show publication in PURE
Franz Aurenhammer On (pointed) minimum weight pseudo-triangulations Canadian Conference on Computational Geometry 209-212 Show publication in PURE
Franz Aurenhammer Voronoi diagrams for oriented spheres Proc. ISVD'07: 4th Int. Conf. Voronoi Diagrams in Science and Engineering 33-37 Show publication in PURE
Other Article
Franz Aurenhammer Approximating boundary-triangulated objects with balls Show publication in PURE
Franz Aurenhammer Computational and structural advantages of circular boundary representation Show publication in PURE
Franz Aurenhammer On (pointed) minimum weight pseudo-triangulations Show publication in PURE
Franz Aurenhammer Voronoi diagrams for oriented spheres Show publication in PURE
2006
Book
Franz Aurenhammer Connecting colored point sets Show publication in PURE
Franz Aurenhammer Pseudo-simplicial complexes from maximal locally convex functions Show publication in PURE
Franz Aurenhammer Farthest line segment Voronoi diagrams Show publication in PURE
Franz Aurenhammer Approximating boundary-triangulated objects with balls Show publication in PURE
Franz Aurenhammer Computational and structural advantages of circular boundary representation Show publication in PURE
Franz Aurenhammer Voronoi diagrams for oriented spheres Show publication in PURE
Franz Aurenhammer Transforming spanning trees and pseudo-triangulations Show publication in PURE
Journal Article
Franz Aurenhammer Farthest line segment Voronoi diagrams Show publication in PURE
Franz Aurenhammer On the crossing number of complete graphs Show publication in PURE
Franz Aurenhammer Pseudo-simplicial complexes from maximal locally convex functions Show publication in PURE
Franz Aurenhammer Transforming spanning trees and pseudo-triangulations Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Gray code enumeration of plane straight-line graphs European Workshop on Computational Geometry 71-74 Show publication in PURE
Franz Aurenhammer Pre-triangulations and liftable complexes Proceedings of the Twenty-Second Annual Symposium on Computational Geometry (SCG '06) 282-291 Show publication in PURE
2005
Conference/Workshop Article
Franz Aurenhammer 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 CFP for VD2005 235-235 Show publication in PURE
Franz Aurenhammer Transforming spanning trees and pseudo-triangulations Proc. 21th European Workshop on Computational Geometry EuroCG '05 81-84 Show publication in PURE
Franz Aurenhammer Small weak epsilon nets Proc. 17th Canadian Conference on Computational Geometry CCCG '05 51-54 Show publication in PURE
Franz Aurenhammer Pseudo-tetrahedral complexes Proc. 21th European Workshop on Computational Geometry EuroCG '05 85-88 Show publication in PURE
2004
Journal Article
Franz Aurenhammer Convexity minimizes pseudo-triangulations Show publication in PURE
Franz Aurenhammer Quickest paths, straight skeletons, and the city Voronoi diagram Show publication in PURE
2003
Journal Article
Franz Aurenhammer Pseudo-triangulations from surfaces and a novel type of edge flip Show publication in PURE
Franz Aurenhammer Towards compatible triangulations Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Pseudo-simplices and their derivation Voronoi Conference on Analytic Number Theory and Spatial Tesselations 11-11 Show publication in PURE
Franz Aurenhammer Spatial Embedding of Pseudo-Triangulations Proceedings of the Nineteenth Annual Symposium on Computational Geometry (SCG '03) 144-153 Show publication in PURE
2002
Book
Franz Aurenhammer Progress on rectilinear crossing numbers Show publication in PURE
Journal Article
Franz Aurenhammer Voronoi diagrams - computational geometry's favorite Show publication in PURE
Franz Aurenhammer Evolution strategy and hierarchical clustering Show publication in PURE
Franz Aurenhammer Points and combinatorics Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Quickest paths, straight skeletons, and the city Voronoi diagram ACM Symposium on Computational Geometry 151-159 Show publication in PURE
2001
Journal Article
Franz Aurenhammer Generalized self-approaching curves Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Towards Compatible Triangulations Computing and combinatorics 101-110 Show publication in PURE
Franz Aurenhammer Enumerating order types for small point sets with applications ACM Symposium on Computational Geometry 11-18 Show publication in PURE
Franz Aurenhammer Evolution Strategy and Hierarchical Clustering Conference on the Computation of Electromagnetic Fields ?-? Show publication in PURE
2000
Conference/Workshop Article
Franz Aurenhammer Niching evolution strategy with cluster algorithms Biennial IEEE Conference on Electromagnetic Field Computation ?-? Show publication in PURE
Franz Aurenhammer Edge Operations on Non-Crossing Spanning Trees European Workshop on Computational Geometry 121-125 Show publication in PURE
1999
Journal Article
Franz Aurenhammer Skew Voronoi diagrams Show publication in PURE
Franz Aurenhammer New results on MWT subgraphs Show publication in PURE
1998
Journal Article
Franz Aurenhammer Constant-level greedy triangulations approximate the MWT well Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Generalized self-approaching curves European Workshop on Computational Geometry 15-18 Show publication in PURE
Franz Aurenhammer Straight skeletons for general polygonal figures in the plane Voronoi's impact of modern sciences / Vol. 2 7-21 Show publication in PURE
Franz Aurenhammer Generalized self-approaching curves Algorithms and computation 317-326 Show publication in PURE
1997
Conference/Workshop Article
Franz Aurenhammer New results on minimum-weight triangulations and the LMT skeleton European Workshop on Computational Geometry 4-6 Show publication in PURE
1996
Journal Article
Franz Aurenhammer Triangulations intersect nicely Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Straight skeletons for general polygonal figures 2nd Ann. Int'l. Computing and Combinatorics Conf. COCOON'96 117-126 Show publication in PURE
Franz Aurenhammer Straight skeletons for general polygonal figures in the plane Computing and combinatorics 117-126 Show publication in PURE
Franz Aurenhammer New greedy triangulation algorithms European Workshop on Computational Geometry 11-14 Show publication in PURE
Franz Aurenhammer Constant-level greedy triangulations approximate the MWT well Operations research and its applications 309-318 Show publication in PURE
1995
Book
Franz Aurenhammer Optimal graph orientation with storage applications Show publication in PURE
Franz Aurenhammer Straight skeletons for general polygonal figures Show publication in PURE
Journal Article
Franz Aurenhammer A novel type of skeleton for polygons Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Straight skeletons of simple polygons LIESMARS 114-124 Show publication in PURE
1994
Journal Article
Franz Aurenhammer Faster isometric embedding in products of complete graphs Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Classifying hyperplanes in hypercubes European Workshop on Computational Geometry 53-57 Show publication in PURE
Other Article
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 System Modelling and Optimization 93-94 Show publication in PURE
1992
Book
Franz Aurenhammer Minkowski-type theorems and least-squares partitioning Show publication in PURE
Journal Article
Franz Aurenhammer Computing equivalence classes among the edges of a graph with applications Show publication in PURE
Franz Aurenhammer A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams Show publication in PURE
Franz Aurenhammer Cartesian graph factorization at logarithmic cost per edge Show publication in PURE
Franz Aurenhammer Searching for segments with largest relative operlap Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Least-squares partitioning European Workshop on Computational Geometry 55-57 Show publication in PURE
Franz Aurenhammer Searching for sements with largest relative overlap System modelling and optimization 77-84 Show publication in PURE
Franz Aurenhammer Minkowski-type theorems and least-squares partitioning 8th Ann. ACM Symp. Computational Geometry 350-357 Show publication in PURE
Other Article
Franz Aurenhammer Least-squares partitioning Show publication in PURE
Franz Aurenhammer Searching for segments with largest relative overlap Show publication in PURE
Franz Aurenhammer Minkowski-type theorems and least-squares partitioning Show publication in PURE
1991
Book
Franz Aurenhammer 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
Franz Aurenhammer A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams 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 On the peeper's Voronoi diagram Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer The post-office problem for fuzzy point sets Computational geometry - methods, algorithms and applications 1-11 Show publication in PURE
Franz Aurenhammer A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams ACM Symposium on Computational Geometry 142-151 Show publication in PURE
Franz Aurenhammer Recognizing binary Hamming graphs in O(n²log n) time Graph-theoretic concepts in computer science 90-98 Show publication in PURE
Other Article
Franz Aurenhammer The post-office problem for fuzzy points sets Show publication in PURE
Franz Aurenhammer A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams Show publication in PURE
Franz Aurenhammer Recognizing binary Hamming graphs in O(n²logn)time Show publication in PURE
1990
Book
Franz Aurenhammer Faster isometric embedding in products of complete graphs Show publication in PURE
Franz Aurenhammer 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 new duality result concerning Voronoi diagrams Show publication in PURE
Franz Aurenhammer A relationship between Gale transforms and Voronoi diagrams Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Factoring Cartesian-product graphs at logarithmic cost per edge Integer programming and combinatorial optimization 29-44 Show publication in PURE
Franz Aurenhammer Fenster - Voronoi Diagramme Tagunsband DMV Jubiläumstagung 52-52 Show publication in PURE
Other Article
Franz Aurenhammer Factoring Cartesian-product graphs at lograithmic cost per edge Show publication in PURE
1989
Book
Franz Aurenhammer Computing equivalence classes among the edges of a graph with applications Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Computing equivalence classes among the edges of a graph with applications Int. Conf. Algebraic Graph Theory 11-11 Show publication in PURE
Other Article
Franz Aurenhammer Computing equivalence classes among the edges of a graph with applications Show publication in PURE
1988
Book
Franz Aurenhammer 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 Geometric relations among Voronoi diagrams Show publication in PURE
Conference/Workshop Article
Franz Aurenhammer Algorithmic aspects of Gale transforms International Symposium on Mathematical Programming 176-176 Show publication in PURE
Franz Aurenhammer Using Gale transforms in computational geometry Computational geometry and its applications 202-216 Show publication in PURE
Franz Aurenhammer On-line sorting of twisted sequences in linear time Workshop on Computational Geometry and Discrete Algorithms 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 ACM Symposium on Computational Geometry 21-29 Show publication in PURE
Franz Aurenhammer Geometric relations among Voronoi diagrams Annual Symposium on Theoretical Aspects of Computer Science 53-65 Show publication in PURE
Other Article
Franz Aurenhammer Geometric relations among Voronoi diagrams Show publication in PURE
1986
Book
Franz Aurenhammer 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 International Colloquium on Automata, Languages and Programming 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 Workshop on Computational Geometry CG '85 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 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 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