Franz Aurenhammer

According to our database, Franz Aurenhammer authored at least 88 papers between 1984 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

Incremental Construction of Motorcycle Graphs.

Franz Aurenhammer, Christoph Ladurner, Michael Steinkogler

Algorithms, 2022

2021

Piecewise-Linear Farthest-Site Voronoi Diagrams.

Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

2020

Mitered Offsets and Skeletons for Circular Arc Polygons.

Bastian Weiß, Bert Jüttler, Franz Aurenhammer

Int. J. Comput. Geom. Appl., 2020

2019

Partially walking a polygon.

Franz Aurenhammer, Michael Steinkogler, Rolf Klein

Comput. Geom., 2019

2017

Voronoi Diagrams for Parallel Halflines and Line Segments in Space.

Franz Aurenhammer, Bert Jüttler, Günter Paulini

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

Straight Skeletons and Mitered Offsets of Nonconvex Polytopes.

Franz Aurenhammer, Gernot Walzl

Discret. Comput. Geom., 2016

2015

Triangulations with Circular Arcs.

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote

J. Graph Algorithms Appl., 2015

On triangulation axes of polygons.

Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler

Inf. Process. Lett., 2015

3-Colorability of Pseudo-Triangulations.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber

Int. J. Comput. Geom. Appl., 2015

2014

On shape Delaunay tessellations.

Franz Aurenhammer, Günter Paulini

Inf. Process. Lett., 2014

A note on visibility-constrained Voronoi diagrams.

Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu

Discret. Appl. Math., 2014

On k-convex point sets.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber

Comput. Geom., 2014

Polytope Offsets and Straight Skeletons in 3D.

Franz Aurenhammer, Gernot Walzl

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013

Voronoi Diagrams from (Possibly Discontinuous) Embeddings.

Mario Kapl, Franz Aurenhammer, Bert Jüttler

Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

Structure and Computation of Straight Skeletons in 3-Space.

Franz Aurenhammer, Gernot Walzl

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Voronoi Diagrams and Delaunay Triangulations.

Franz Aurenhammer, Rolf Klein, Der-Tsai Lee

World Scientific, ISBN: 978-981-4447-63-8, 2013

2012

On Computing the Convex Hull of (Piecewise) Curved Objects.

Franz Aurenhammer, Bert Jüttler

Math. Comput. Sci., 2012

Computing convex quadrangulations.

T. Schiffer, Franz Aurenhammer, M. Demuth

Discret. Appl. Math., 2012

On k-convex polygons.

Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia

Comput. Geom., 2012

2011

Computational and Structural Advantages of Circular Boundary Representation.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl, Zbynek Sír

Int. J. Comput. Geom. Appl., 2011

2010

Divide-and-conquer for Voronoi diagrams revisited.

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl

Comput. Geom., 2010

Straight skeletons for binary shapes.

M. Demuth, Franz Aurenhammer, Axel Pinz

Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2010

Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics.

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler

Proceedings of the Curves and Surfaces, 2010

2009

Optimal Triangulations.

Franz Aurenhammer, Yinfeng Xu

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Small weak epsilon-nets.

Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky

Comput. Geom., 2009

On minimum weight pseudo-triangulations.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann

Comput. Geom., 2009

Editorial.

Oswin Aichholzer, Franz Aurenhammer

Comput. Geom., 2009

Recovering Structure from <i>r</i>-Sampled Objects.

Oswin Aichholzer, Franz Aurenhammer, B. Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter

Comput. Graph. Forum, 2009

Medial axis computation for planar free-form shapes.

Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl

Comput. Aided Des., 2009

2008

Weighted skeletons and fixed-share decomposition.

Franz Aurenhammer

Comput. Geom., 2008

Matching edges and faces in polygonal partitions.

Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber

Comput. Geom., 2008

2007

Gray Code Enumeration of Plane Straight-Line Graphs.

Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Birgit Vogtenhuber

Graphs Comb., 2007

Pre-Triangulations and Liftable Complexes.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl

Discret. Comput. Geom., 2007

Connecting colored point sets.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer

Discret. Appl. Math., 2007

Voronoi Diagrams for Oriented Spheres.

Franz Aurenhammer, Johannes Wallner, Martin Peternell, Helmut Pottmann

Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering, 2007

On (Pointed) Minimum Weight Pseudo-Triangulations.

Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Farthest line segment Voronoi diagrams.

Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser

Inf. Process. Lett., 2006

Transforming spanning trees and pseudo-triangulations.

Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser

Inf. Process. Lett., 2006

Pseudo-Simplicial Complexes from Maximal Locally Convex Functions.

Franz Aurenhammer, Hannes Krasser

Discret. Comput. Geom., 2006

On the Crossing Number of Complete Graphs.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser

Computing, 2006

2005

Pseudo-tetrahedral complexes.

Franz Aurenhammer, Hannes Krasser

Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

2004

Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.

Oswin Aichholzer, Franz Aurenhammer, Belén Palop

Discret. Comput. Geom., 2004

Convexity minimizes pseudo-triangulations.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann

Comput. Geom., 2004

2003

Towards compatible triangulations.

Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser

Theor. Comput. Sci., 2003

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß

SIAM J. Comput., 2003

Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Spatial embedding of pseudo-triangulations.

Oswin Aichholzer, Franz Aurenhammer, Peter Braay

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Approximating uniform triangular meshes in polygons.

Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu

Theor. Comput. Sci., 2002

Enumerating Order Types for Small Point Sets with Applications.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser

Order, 2002

Sequences of spanning trees and a fixed tree theorem.

Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado

Comput. Geom., 2002

2001

Computational Geometry - Some Easy Questions and their Recent Solutions.

Franz Aurenhammer

J. Univers. Comput. Sci., 2001

Generalized self-approaching curves.

Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote

Discret. Appl. Math., 2001

Enumerating order types for small sets with applications.

Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000

Edge Operations on Non-Crossing Spanning Trees.

Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado

EuroCG, 2000

Voronoi Diagrams.

Franz Aurenhammer, Rolf Klein

Proceedings of the Handbook of Computational Geometry, 2000

1999

New Results on MWT Subgraphs.

Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz

Inf. Process. Lett., 1999

Skew Voronoi Diagrams.

Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou

Int. J. Comput. Geom. Appl., 1999

1998

Constant-Level Greedy Triangulations Approximate the MWT Well.

Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu

J. Comb. Optim., 1998

Minkowski-Type Theorems and Least-Squares Clustering.

Franz Aurenhammer, F. Hoffmann, Boris Aronov

Algorithmica, 1998

1997

Voronoi Diagrams for Direction-Sensitive Distances.

Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996

Classifying Hyperplanes in Hypercubes.

Oswin Aichholzer, Franz Aurenhammer

SIAM J. Discret. Math., 1996

Triangulations Intersect Nicely.

Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu

Discret. Comput. Geom., 1996

Straight Skeletons for General Polygonal Figures in the Plane.

Oswin Aichholzer, Franz Aurenhammer

Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995

Recognizing Binary Hamming Graphs in O(n² log n) Time.

Franz Aurenhammer, Johann Hagauer

Math. Syst. Theory, 1995

A Novel Type of Skeleton for Polygons.

Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner

J. Univers. Comput. Sci., 1995

Triangulations Intersect Nicely.

Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Faster Isometric Embedding in Products of Complete Graphs.

Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner

Discret. Appl. Math., 1994

1992

Searching for Segments with Largest Relative Overlap.

Franz Aurenhammer, Gerd Stöckl

Inf. Process. Lett., 1992

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams.

Franz Aurenhammer, Otfried Schwarzkopf

Int. J. Comput. Geom. Appl., 1992

Computing equivalence classes among the edges of a graph with applications.

Franz Aurenhammer, Johann Hagauer

Discret. Math., 1992

Cartesian Graph Factorization at Logarithmic Cost per Edge.

Franz Aurenhammer, Johann Hagauer, Wilfried Imrich

Comput. Complex., 1992

Minkowski-Type Theorems and Least-Squares Partitioning.

Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

On the Peeper's Voronoi diagram.

Franz Aurenhammer, Gerd Stöckl

SIGACT News, 1991

Using Gale transforms in computational geometry.

Franz Aurenhammer

Math. Program., 1991

Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure.

Franz Aurenhammer

ACM Comput. Surv., 1991

The Post Office Problem for Fuzzy Point Sets.

Franz Aurenhammer, Gerd Stöckl, Emo Welzl

Proceedings of the Computational Geometry, 1991

1990

A New Duality Result Concerning Voronoi Diagrams.

Franz Aurenhammer

Discret. Comput. Geom., 1990

A relationship between Gale transforms and Voronoi diagrams.

Franz Aurenhammer

Discret. Appl. Math., 1990

Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.

Franz Aurenhammer, Johann Hagauer, Wilfried Imrich

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1988

Improved Algorithms for Discs and Balls Using Power Diagrams.

Franz Aurenhammer

J. Algorithms, 1988

On-Line Sorting of Twisted Sequences in Linear Time.

Franz Aurenhammer

BIT, 1988

1987

Power Diagrams: Properties, Algorithms and Applications.

Franz Aurenhammer

SIAM J. Comput., 1987

Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra.

Franz Aurenhammer

J. Symb. Comput., 1987

A Criterion for the Affine Equivalence of Cell Complexes in R^d and Convex Polyhedra in R^d+1+.

Franz Aurenhammer

Discret. Comput. Geom., 1987

Geometric Relations Among Voronoi Diagrams.

Franz Aurenhammer, Hiroshi Imai

Proceedings of the STACS 87, 1987

Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons.

Franz Aurenhammer

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

The One-Dimensional Weighted Voronoi Diagram.

Franz Aurenhammer

Inf. Process. Lett., 1986

1984

An optimal algorithm for constructing the weighted voronoi diagram in the plane.

Franz Aurenhammer, Herbert Edelsbrunner

Pattern Recognit., 1984