Franz Aurenhammer Univ.-Prof. DI Dr. techn.
Institute of Machine Learning and Neural Computation
Graz University of Technology
2022
Journal Article
Incremental Construction of Motorcycle Graphs
Show publication in PURE
Conference/Workshop Article
An insertion strategy for motorcycle graphs
38th European Workshop on Computational Geometry : March 14-16, 2022, Perugia, Italy : booklet of abstracts
Show publication in PURE
2021
Book Chapter
Conference/Workshop Article
Piecewise-linear farthest-site Voronoi diagrams
Proc. 32th Interntional Symposium on Algorithms and Computation (ISAAC'21)
Show publication in PURE
2020
Journal Article
Mitered offsets and straight skeletons for circular arc polygons.
Show publication in PURE
2019
Journal Article
Partially walking a polygon
Show publication in PURE
2018
Conference/Workshop Article
Maximal two-guard walks in polygons
Proc. 34th European Workshop on Computational Geometry (EuroCG'18)
#1
Show publication in PURE
Mitered offsets and straight skeletons for circular arc polygons
Proc. 34th European Workshop on Computational Geometry (EuroCG'18)
#52
Show publication in PURE
On merging straight skeletons
Proc. 34th European Workshop on Computational Geometry (EuroCG'18)
#42
Show publication in PURE
Partially walking a polygon
Proc. 29th International Symposium on Algorithms and Computation (ISAAC'18)
Show publication in PURE
2017
Conference/Workshop Article
Voronoi diagrams for parallel halflines and line segments in space
Proc. 28th International Symposium on Algorithms and Computation (ISAAC'17)
#7
Show publication in PURE
Computing straight skeletons for arc polygons
Proc. 2nd Conference on Subdivision, Geometric and Algebraic Methods, Isogeometric Analysis and Refinability (SMART'2017)
Show publication in PURE
2016
Journal Article
Straight skeletons and mitered offsets of nonconvex polytopes
Show publication in PURE
Conference/Workshop Article
Voronoi diagrams for parallel halflines in 3D
Proc. 32nd European Workshop on Computational Geometry (EuroCG 2016)
127-130
Show publication in PURE
2015
Journal Article
3-Colorability of pseudo-triangulations
Show publication in PURE
Triangulations with circular arcs
Show publication in PURE
On triangulation axes of polygons
Show publication in PURE
Conference/Workshop Article
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
A note on visibility-constrained Voronoi diagrams
Show publication in PURE
On shape Delaunay tessellations
Show publication in PURE
On k-convex point sets
Show publication in PURE
Conference/Workshop Article
Polytope offsets and straight skeletons in 3D
Proc. 30th Ann. Symposium on Computational Geometry (SoCG'14)
98-99
Show publication in PURE
2013
Book
Voronoi Diagrams and Delaunay Triangulations
Show publication in PURE
Conference/Workshop Article
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
Voronoi diagrams from distance graphs
Proceeding 20th European Workshop on Computational Geometry (EuroCG'13)
185-188
Show publication in PURE
Voronoi diagrams from (possibly discontinous) embeddings
Proc. International Symposium on Voronoi Diagrams (ISVD 2013), IEEE Computer Society
47-50
Show publication in PURE
Using scaled embedded distances to generate metrics for R^2
Proc. 14th IMA Conference on Algorithms and Computation
Show publication in PURE
2012
Journal Article
Computing convex quadrangulations
Show publication in PURE
On computing the convex hull of (piecewise) curved objects
Show publication in PURE
On k-convex polygons
Show publication in PURE
Conference/Workshop Article
On triangulation axes of polygons
Proc. 28th European Workshop on Computational Geometry (EuroCG'12)
125-128
Show publication in PURE
2011
Journal Article
Computational and structural advantages of circular boundary representation
Show publication in PURE
Conference/Workshop Article
Triangulations with circular arcs
Proc. 19th International Symposium on Graph Drawing
296-307
Show publication in PURE
2010
Journal Article
Divide-and conquer for Voronoi diagrams revisited
Show publication in PURE
Conference/Workshop Article
Arc triangulations
Proc. 26th European Workshop on Computational Geometry (EuroCG'10)
17-20
Show publication in PURE
3-Colorability of pseudo-triangulations
Proc. 26th European Workshop on Computational Geometry (EuroCG'10)
21-24
Show publication in PURE
Straight skeletons for binary shapes
Computer Vision and Pattern Recognition Workshop (CVPRW)
9-16
Show publication in PURE
Exact medial axis computation for triangulated solids with respect to piecewise linear metrics
Curves and Surfaces
1-27
Show publication in PURE
2009
Journal Article
Small weak epsilon nets
Show publication in PURE
On minimum weight pseudo-triangulations
Show publication in PURE
Medial axis computation for planar free-form shapes
Show publication in PURE
Conference/Workshop Article
Two-convex polygons
Proc. 25th European Workshop on Computational Geometry (EuroCG'09)
117-120
Show publication in PURE
Lower and upper bounds on the number of empty cylinders and ellipsoids
Proc. 25th European Workshop on Computational Geometry (EuroCG'09)
139-142
Show publication in PURE
Divide-and-conquer for voronoi diagrams revisited
Proc. 25th Ann. Symposium on Computational Geometry (SoCG'09)
189-197
Show publication in PURE
Divide-and-conquer for voronoi diagrams revisited
Proc. 25th European Workshop on Computational Geometry (EuroCG'09)
293-296
Show publication in PURE
2008
Book Chapter
Journal Article
Matching edges and faces in polygonal partitions
Show publication in PURE
Conference/Workshop Article
Seed polytopes for incremental approximation
Proc. 24th European Workshop on Computational Geometry (EuroCG'08)
13-16
Show publication in PURE
Computing convex quadrangulations
Proc. International Symposium on Voronoi Diagrams in Science and Engineering
32-43
Show publication in PURE
Other Article
Counting quadrics and Delaunay triangulations and a new convex hull theorem
Show publication in PURE
2007
Journal Article
Connecting colored point sets
Show publication in PURE
Weighted skeletons and fixed-share decomposition
Show publication in PURE
Gray code enumeration of plane straight line graphs
Show publication in PURE
Pre-triangulations and liftable complexes
Show publication in PURE
Conference/Workshop Article
Voronoi diagrams for oriented spheres
Proc. 4th International Conference on Voronoi Diagrams in Science and Engineering (ISVD'07)
33-37
Show publication in PURE
Approximating boundary-triangulated objects with balls
Proc. 23rd European Workshop on Computational Geometry (EuroCG'07)
130-133
Show publication in PURE
On (pointed) minimum weight pseudo-triangulations
Proc. 19th Canadian Conference on Computational Geometry (CCCG'07)
209-212
Show publication in PURE
Computational and structural advantages of circular boundary representation
Proc. 10th International Workshop on Algorithms and Data Structures (WADS'07)
374-385
Show publication in PURE
2006
Journal Article
Pseudo-simplicial complexes from maximal locally convex functions
Show publication in PURE
Transforming spanning trees and pseudo-triangulations
Show publication in PURE
On the crossing number of complete graphs
Show publication in PURE
Farthest line segment Voronoi diagrams
Show publication in PURE
Conference/Workshop Article
Pre-triangulations and liftable complexes
Proc, 22nd Ann. Symposium on Computational Geometry (SoCG'06)
282-291
Show publication in PURE
Gray code enumeration of plane straight-line graphs
Proc. 22nd European Workshop on Computational Geometry (EuroCG'06)
71-74
Show publication in PURE
2005
Conference/Workshop Article
Small weak epsilon nets
Proc. 17th Canadian Conference on Computational Geometry (CCCG'05)
51-54
Show publication in PURE
Pseudo-tetrahedral complexes
Proc. 21th European Workshop on Computational Geometry (EuroCG'05)
85-88
Show publication in PURE
Matching edges and faces in polygonal partitions
Proc. 17th Canadian Conference on Computational Geometry (CCCG'05)
123-126
Show publication in PURE
Pre-triangulations: A generalization of Delaunay triangulations and flips
2nd Int. Symposium on Voronoi Diagrams in Science and Engineering
235-235
Show publication in PURE
Transforming spanning trees and pseudo-triangulations
Proc. 21th European Workshop on Computational Geometry (EuroCG'05)
81-84
Show publication in PURE
2004
Journal Article
Convexity minimizes pseudo-triangulations
Show publication in PURE
Quickest paths, straight skeletons, and the city Voronoi diagram
Show publication in PURE
2003
Journal Article
Pseudo-triangulations from surfaces and a novel type of edge flip
Show publication in PURE
Towards compatible triangulations
Show publication in PURE
Conference/Workshop Article
Spatial embedding of pseudo-triangulations
Proc. 19th Ann. Symposium on Computational Geometry (SoCG'03)
144-153
Show publication in PURE
Pseudo-simplices and their derivation
Proc. Voronoi Conference on Analytic Number Theory and Spatial Tesselations
11-11
Show publication in PURE
Adapting (pseudo)-triangulations with a near-linear number of edge flips
Proc. 8th International Workshop on Algorithms and Data Structures (WADS'03)
12-24
Show publication in PURE
2002
Journal Article
Evolution strategy and hierarchical clustering
Show publication in PURE
Points and combinatorics
Show publication in PURE
Voronoi diagrams - computational geometry's favorite
Show publication in PURE
Approximating uniform triangular meshes in polygons
Show publication in PURE
Sequences of spanning trees and a fixed tree theorem
Show publication in PURE
Enumerating order types for small point sets with applications
Show publication in PURE
Algorithmic fun - Abalona
Show publication in PURE
Conference/Workshop Article
Quickest paths, straight skeletons, and the city Voronoi diagram
Proc. 18th Ann. ACM Symposium on Computational Geometry (SoCG'02)
151-159
Show publication in PURE
On the crossing number of complete graphs
Proc. 18th Ann. ACM Symposium on Computational Geometry (SoCG'02)
19-24
Show publication in PURE
On the crossing number of complete graphs
Proc. 18th European Workshop on Computational Geometry (EuroCG'02)
90-92
Show publication in PURE
Convexity minimizes pseudo-triangulations
Proc. 14th Canadian Conference on Computational Geometry (CCCG'02)
158-161
Show publication in PURE
2001
Journal Article
Generalized self-approaching curves
Show publication in PURE
Computational geometry -- some easy questions and their recent solutions
Show publication in PURE
Conference/Workshop Article
Enumerating order types for small point sets with applications
Proc. 17th Ann. ACM Symposium on Computational Geometry (SoCG'01)
11-18
Show publication in PURE
Evolution strategy and hierarchical clustering
Proc. 13th COMPUMAG Conference on the Computation of Electromagnetic Fields
?-?
Show publication in PURE
Towards compatible triangulations
Proc. 7th Ann. Computing and Combinatorics Conference (COCOON'01)
101-110
Show publication in PURE
On compatible triangulations of point sets
Proc. 17th European Workshop on Computational Geometry (EuroCG'01)
23-26
Show publication in PURE
2000
Book Chapter
Conference/Workshop Article
Niching evolution strategy with cluster algorithms
Proc. 9th Biennial IEEE Conference on Electromagnetic Field Computations
1-3
Show publication in PURE
Edge operations on non-crossing spanning trees
Proc. 16th European Workshop on Computational Geometry (EuroCG'00)
121-125
Show publication in PURE
Approximating uniform triangular meshes in polygons
Proc. 6th Ann. International Computing and Combinatorics Conference (COCOON'00)
23-33
Show publication in PURE
1999
Journal Article
New results on MWT subgraphs
Show publication in PURE
Skew Voronoi diagrams
Show publication in PURE
1998
Journal Article
Constant-level greedy triangulations approximate the MWT well
Show publication in PURE
Minkowski-type theorems and least-squares clusterings
Show publication in PURE
Conference/Workshop Article
Generalized self-approaching curves
Proc. 9th International Symposium on Algorithms and Computation (ISAAC'98)
317-326
Show publication in PURE
Generalized self-approaching curves
Proc. 14th European Workshop on Computational Geometry (EuroCG'98)
15-18
Show publication in PURE
Straight skeletons for general polygonal figures in the plane
Voronoi's Impact on Modern Sciences II
7-21
Show publication in PURE
1997
Conference/Workshop Article
New results on minimum-weight triangulations and the LMT skeleton
Proc. 13th European Workshop on Computational Geometry (EuroCG'97)
4-6
Show publication in PURE
Voronoi diagrams for direction-sensitive distances
Proc. 13th Ann. ACM Symposium on Computational Geometry (SoCG'97)
418-420
Show publication in PURE
1996
Journal Article
Triangulations intersect nicely
Show publication in PURE
Classifying hyperplanes in hypercubes
Show publication in PURE
Conference/Workshop Article
New greedy triangulation algorithms
Proc. 12th European Workshop on Computational Geometry (EuroCG'96)
11-14
Show publication in PURE
Constant-level greedy triangulations approximate the MWT well
Proc. 2nd International Symposium on Operations Research & Applications (ISORA'96)
309-318
Show publication in PURE
Straight skeletons for general polygonal figures
Proc. 2nd Ann. Internatioanl Computing and Combinatorics Conference (COCOON'96)
117-126
Show publication in PURE
1995
Book
Optimal graph orientation with storage applications
Show publication in PURE
Journal Article
A novel type of skeleton for polygons
Show publication in PURE
Recognizing binary Hamming graphs in O(n^2 logn) time
Show publication in PURE
Conference/Workshop Article
Straight skeletons of simple polygons
Proc. 4th International Symposium LIESMARS
114-124
Show publication in PURE
Triangulations intersect nicely
Proc. 11th Ann. ACM Symposium on Computational Geometry (SoCG'95)
220-229
Show publication in PURE
1994
Journal Article
Faster isometric embedding in products of complete graphs
Show publication in PURE
Conference/Workshop Article
Classifying hyperplanes in hypercubes
Proc. 10th European Workshop on Computational Geometry (EuroCG'94)
53-57
Show publication in PURE
1993
Journal Article
Voronoi diagrams - a survey of a fundamental geometric data structure
Show publication in PURE
Conference/Workshop Article
Geometric clustering and Voronoi-type partitions
Proc. 16th IFIP Conference on System Modelling and Optimization
93-94
Show publication in PURE
1992
Journal Article
Searching for segments with largest relative operlap
Show publication in PURE
Cartesian graph factorization at logarithmic cost per edge
Show publication in PURE
Computing equivalence classes among the edges of a graph with applications
Show publication in PURE
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
Show publication in PURE
Conference/Workshop Article
Minkowski-type theorems and least-squares partitioning
Proc. 8th Ann. ACM Symposium on Computational Geometry (SOCG'92)
350-357
Show publication in PURE
Searching for sements with largest relative overlap
Proc. 15th IFIP Conference on System Modelling and Optimization
77-84
Show publication in PURE
Least-squares partitioning
Proc. 8th European Wokshop on Computational Geometry (EuroCG'92)
55-57
Show publication in PURE
1991
Journal Article
Voronoi diagrams - a survey of a fundamental geometric data structure
Show publication in PURE
Using Gale transforms in computational geometry
Show publication in PURE
On the peeper's Voronoi diagram
Show publication in PURE
Conference/Workshop Article
Recognizing binary Hamming graphs in O(n²log n) time
Proc. 16th International Workshop on Graph-Theoretical Concepts in Computer Science
90-98
Show publication in PURE
The post-office problem for fuzzy point sets
Proc. 7th Workshop on Computational Geometry (CG'91)
1-11
Show publication in PURE
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams
Proc. 7th Ann. ACM Symposium on Computational Geometry (SoCG'91)
142-151
Show publication in PURE
1990
Journal Article
A relationship between Gale transforms and Voronoi diagrams
Show publication in PURE
A new duality result concerning Voronoi diagrams
Show publication in PURE
Conference/Workshop Article
Factoring Cartesian-product graphs at logarithmic cost per edge
Proc. MPS Conference on Integer Programming and Combinatorial Optimization (IPCO'90)
29-44
Show publication in PURE
1989
Conference/Workshop Article
Computing equivalence classes among the edges of a graph with applications
Proc. International Conference on Algebraic Graph Theory
11
Show publication in PURE
1988
Journal Article
Linear combinations from power domains
Show publication in PURE
Improved algorithms for discs and balls using power diagrams
Show publication in PURE
On-line sorting of twisted sequences in linear time
Show publication in PURE
Geometric relations among Voronoi diagrams
Show publication in PURE
Conference/Workshop Article
Algorithmic aspects of Gale transforms
Proc. 13th 3-Ann. International Symposium on Mathematical Programming
176
Show publication in PURE
Using Gale transforms in computational geometry
Proc. 4th Workshop on Computational Geometry (CG'88)
202-216
Show publication in PURE
On-line sorting of twisted sequences in linear time
Proc. 2nd Workshop on Computational Geometry and Discrete Algorithms
14
Show publication in PURE
1987
Journal Article
Recognizing polytopical cell complexes and constructing projection polyhedra
Show publication in PURE
Power diagrams: properties, algorithms and applications
Show publication in PURE
A criterion for the affine equivalence of cell complexes in R^d and convex polyhedra in R^d+1
Show publication in PURE
Conference/Workshop Article
Geometric relations among Voronoi diagrams
4th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1987
53-65
Show publication in PURE
Jordan sorting via convex hulls of certain non-simple polygons
Proc. 3rd Ann. ACM Symposium on Computational Geometry (SoCG'87)
21-29
Show publication in PURE
1986
Journal Article
The one-dimensional weighted Voronoi diagram
Show publication in PURE
Conference/Workshop Article
A new duality result concerning Vornonoi diagrams
Proc. 13th Ann. International Colloquium on Automata, Languages and Programming (ICALP'86)
21-32
Show publication in PURE
1985
Conference/Workshop Article
1984
Book Chapter
Gewichtete Voronoi Diagramme: Geometrische Deutung und Konstruktions-AlgorithmenDissertation, TU Graz, Austria
Show publication in PURE
Journal Article
An optimal algorithm for constructing the weighted Voronoi diagram in the plane
Show publication in PURE
Contact
Prof. Dr. Franz Aurenhammer
Institute of Machine Learning and Neural Computation
Inffeldgasse 16b/I
8010 Graz
Austria
Phone: +43 316 / 873 - 5844
franz.aurenhammer@tugraz.at