Franz Aurenhammer

Publication Activity (10 Years)

Years Active: 1984-2022
Publications (10 Years): 7

Top Venues

ISAAC

Int. J. Comput. Geom. Appl.

Inf. Process. Lett.

Comput. Geom.

Publications

Franz Aurenhammer, Christoph Ladurner, Michael Steinkogler
Incremental Construction of Motorcycle Graphs. Algorithms 15 (7) (2022)
Franz Aurenhammer, Evanthia Papadopoulou, Martin Suderland
Piecewise-Linear Farthest-Site Voronoi Diagrams. ISAAC (2021)
Bastian Weiß, Bert Jüttler, Franz Aurenhammer
Mitered Offsets and Skeletons for Circular Arc Polygons. Int. J. Comput. Geom. Appl. 30 (3&4) (2020)
Franz Aurenhammer, Michael Steinkogler, Rolf Klein
Partially walking a polygon. Comput. Geom. 84 (2019)
Franz Aurenhammer, Michael Steinkogler, Rolf Klein
Partially Walking a Polygon. ISAAC (2018)
Franz Aurenhammer, Bert Jüttler, Günter Paulini
Voronoi Diagrams for Parallel Halflines and Line Segments in Space. ISAAC (2017)
Franz Aurenhammer, Gernot Walzl
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes. Discret. Comput. Geom. 56 (3) (2016)
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote
Triangulations with Circular Arcs. J. Graph Algorithms Appl. 19 (1) (2015)
Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler
On triangulation axes of polygons. Inf. Process. Lett. 115 (1) (2015)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer, Alexander Pilz, Birgit Vogtenhuber
3-Colorability of Pseudo-Triangulations. Int. J. Comput. Geom. Appl. 25 (4) (2015)
Franz Aurenhammer, Günter Paulini
On shape Delaunay tessellations. Inf. Process. Lett. 114 (10) (2014)
Franz Aurenhammer, Gernot Walzl
Polytope Offsets and Straight Skeletons in 3D. SoCG (2014)
Franz Aurenhammer, Bing Su, Yin-Feng Xu, Binhai Zhu
A note on visibility-constrained Voronoi diagrams. Discret. Appl. Math. 174 (2014)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Ferran Hurtado, Alexander Pilz, Pedro Ramos, Jorge Urrutia, Pavel Valtr, Birgit Vogtenhuber
On k-convex point sets. Comput. Geom. 47 (8) (2014)
Mario Kapl, Franz Aurenhammer, Bert Jüttler
Voronoi Diagrams from (Possibly Discontinuous) Embeddings. ISVD (2013)
Franz Aurenhammer, Gernot Walzl
Structure and Computation of Straight Skeletons in 3-Space. ISAAC (2013)
Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia
On k-convex polygons. Comput. Geom. 45 (3) (2012)
T. Schiffer, Franz Aurenhammer, M. Demuth
Computing convex quadrangulations. Discret. Appl. Math. 160 (4-5) (2012)
Franz Aurenhammer, Bert Jüttler
On Computing the Convex Hull of (Piecewise) Curved Objects. Math. Comput. Sci. 6 (3) (2012)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl, Zbynek Sír
Computational and Structural Advantages of Circular Boundary Representation. Int. J. Comput. Geom. Appl. 21 (1) (2011)
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Katerina Cech Dobiásová, Bert Jüttler, Günter Rote
Triangulations with Circular Arcs. Graph Drawing (2011)
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl
Divide-and-conquer for Voronoi diagrams revisited. Comput. Geom. 43 (8) (2010)
Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia
On k-Convex Polygons CoRR (2010)
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler
Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics. Curves and Surfaces (2010)
M. Demuth, Franz Aurenhammer, Axel Pinz
Straight skeletons for binary shapes. CVPR Workshops (2010)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
On minimum weight pseudo-triangulations. Comput. Geom. 42 (6-7) (2009)
Oswin Aichholzer, Franz Aurenhammer
Editorial. Comput. Geom. 42 (8) (2009)
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Rabl
Medial axis computation for planar free-form shapes. Comput. Aided Des. 41 (5) (2009)
Oswin Aichholzer, Franz Aurenhammer, B. Kornberger, Simon Plantinga, Günter Rote, Astrid Sturm, Gert Vegter
-Sampled Objects. Comput. Graph. Forum 28 (5) (2009)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky
Small weak epsilon-nets. Comput. Geom. 42 (5) (2009)
Oswin Aichholzer, Wolfgang Aigner, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Elisabeth Pilgerstorfer, Margot Rabl
Divide-and-conquer for Voronoi diagrams revisited. SCG (2009)
Franz Aurenhammer
Weighted skeletons and fixed-share decomposition. Comput. Geom. 40 (2) (2008)
Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
Matching edges and faces in polygonal partitions. Comput. Geom. 39 (2) (2008)
Franz Aurenhammer, Johannes Wallner, Martin Peternell, Helmut Pottmann
Voronoi Diagrams for Oriented Spheres. ISVD (2007)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
Pre-Triangulations and Liftable Complexes. Discret. Comput. Geom. 38 (4) (2007)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bert Jüttler, Margot Oberneder, Zbynek Sír
Computational and Structural Advantages of Circular Boundary Representation. WADS (2007)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Clemens Huemer
Connecting colored point sets. Discret. Appl. Math. 155 (3) (2007)
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Birgit Vogtenhuber
Gray Code Enumeration of Plane Straight-Line Graphs. Graphs Comb. 23 (5) (2007)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl, Bettina Speckmann
On (Pointed) Minimum Weight Pseudo-Triangulations. CCCG (2007)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
On the Crossing Number of Complete Graphs. Computing 76 (1-2) (2006)
Oswin Aichholzer, Franz Aurenhammer, Thomas Hackl
Pre-triangulations and liftable complexes. SCG (2006)
Franz Aurenhammer, Hannes Krasser
Pseudo-Simplicial Complexes from Maximal Locally Convex Functions. Discret. Comput. Geom. 35 (2) (2006)
Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser
Farthest line segment Voronoi diagrams. Inf. Process. Lett. 100 (6) (2006)
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
Transforming spanning trees and pseudo-triangulations. Inf. Process. Lett. 97 (1) (2006)
Franz Aurenhammer, Hannes Krasser
Pseudo-tetrahedral complexes. EuroCG (2005)
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Hannes Krasser
Transforming spanning trees and pseudo-triangulations. EuroCG (2005)
Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber
Matching Edges and Faces in Polygonal Partitions. CCCG (2005)
Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
Small weak epsilon nets. CCCG (2005)
Oswin Aichholzer, Franz Aurenhammer, Belén Palop
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram. Discret. Comput. Geom. 31 (1) (2004)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
Convexity minimizes pseudo-triangulations. Comput. Geom. 28 (1) (2004)
Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado, Hannes Krasser
Towards compatible triangulations. Theor. Comput. Sci. 296 (1) (2003)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips. WADS (2003)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Peter Braß
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip. SIAM J. Comput. 32 (6) (2003)
Oswin Aichholzer, Franz Aurenhammer, Peter Braay
Spatial embedding of pseudo-triangulations. SCG (2003)
Oswin Aichholzer, Franz Aurenhammer, Belén Palop
Quickest paths, straight skeletons, and the city Voronoi diagram. SCG (2002)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Bettina Speckmann
Convexity minimizes pseudo-triangulations. CCCG (2002)
Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
Sequences of spanning trees and a fixed tree theorem. Comput. Geom. 21 (1-2) (2002)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
Enumerating Order Types for Small Point Sets with Applications. Order 19 (3) (2002)
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yin-Feng Xu
Approximating uniform triangular meshes in polygons. Theor. Comput. Sci. 289 (2) (2002)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
On the crossing number of complete graphs. SCG (2002)
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
Generalized self-approaching curves. Discret. Appl. Math. 109 (1-2) (2001)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser, Ferran Hurtado
Towards Compatible Triangulations. COCOON (2001)
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser
Enumerating order types for small sets with applications. SCG (2001)
Franz Aurenhammer
Computational Geometry - Some Easy Questions and their Recent Solutions. J. Univers. Comput. Sci. 7 (5) (2001)
Franz Aurenhammer, Naoki Katoh, Hiromichi Kojima, Makoto Ohsaki, Yinfeng Xu
Approximating Uniform Triangular Meshes in Polygons. COCOON (2000)
Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado
Edge Operations on Non-Crossing Spanning Trees. EuroCG (2000)
Oswin Aichholzer, Franz Aurenhammer, Reinhard Hainz
New Results on MWT Subgraphs. Inf. Process. Lett. 69 (5) (1999)
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Evanthia Papadopoulou
Skew Voronoi Diagrams. Int. J. Comput. Geom. Appl. 9 (3) (1999)
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
Generalized Self-Approaching Curves. ISAAC (1998)
Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu
Constant-Level Greedy Triangulations Approximate the MWT Well. J. Comb. Optim. 2 (4) (1998)
Franz Aurenhammer, F. Hoffmann, Boris Aronov
Minkowski-Type Theorems and Least-Squares Clustering. Algorithmica 20 (1) (1998)
Oswin Aichholzer, Franz Aurenhammer, Danny Z. Chen, D. T. Lee, Asish Mukhopadhyay, Evanthia Papadopoulou
Voronoi Diagrams for Direction-Sensitive Distances. SCG (1997)
Oswin Aichholzer, Franz Aurenhammer
Straight Skeletons for General Polygonal Figures in the Plane. COCOON (1996)
Oswin Aichholzer, Franz Aurenhammer, Siu-Wing Cheng, Naoki Katoh, Günter Rote, Michael Taschwer, Yin-Feng Xu
Triangulations Intersect Nicely. Discret. Comput. Geom. 16 (4) (1996)
Oswin Aichholzer, Franz Aurenhammer
Classifying Hyperplanes in Hypercubes. SIAM J. Discret. Math. 9 (2) (1996)
Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner
A Novel Type of Skeleton for Polygons. J. Univers. Comput. Sci. 1 (12) (1995)
Oswin Aichholzer, Franz Aurenhammer, Michael Taschwer, Günter Rote
Triangulations Intersect Nicely. SCG (1995)
Franz Aurenhammer, Johann Hagauer
Recognizing Binary Hamming Graphs in O(n² log n) Time. Math. Syst. Theory 28 (5) (1995)
Franz Aurenhammer, Michael Formann, Ramana M. Idury, Alejandro A. Schäffer, Frank Wagner
Faster Isometric Embedding in Products of Complete Graphs. Discret. Appl. Math. 52 (1) (1994)
Franz Aurenhammer, Otfried Schwarzkopf
A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. Int. J. Comput. Geom. Appl. 2 (4) (1992)
Franz Aurenhammer, Gerd Stöckl
Searching for Segments with Largest Relative Overlap. Inf. Process. Lett. 41 (2) (1992)
Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
Cartesian Graph Factorization at Logarithmic Cost per Edge. Comput. Complex. 2 (1992)
Franz Aurenhammer, Johann Hagauer
Computing equivalence classes among the edges of a graph with applications. Discret. Math. 109 (1-3) (1992)
Franz Aurenhammer, Friedrich Hoffmann, Boris Aronov
Minkowski-Type Theorems and Least-Squares Partitioning. SCG (1992)
Franz Aurenhammer, Gerd Stöckl
On the Peeper's Voronoi diagram. SIGACT News 22 (4) (1991)
Franz Aurenhammer, Gerd Stöckl, Emo Welzl
The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry (1991)
Franz Aurenhammer
Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Comput. Surv. 23 (3) (1991)
Franz Aurenhammer, Otfried Schwarzkopf
A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams. SCG (1991)
Franz Aurenhammer
Using Gale transforms in computational geometry. Math. Program. 52 (1991)
Franz Aurenhammer
A New Duality Result Concerning Voronoi Diagrams. Discret. Comput. Geom. 5 (1990)
Franz Aurenhammer, Johann Hagauer
Recognizing Binary Hamming Graphs in O(n² log n) Time. WG (1990)
Franz Aurenhammer, Johann Hagauer, Wilfried Imrich
Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge. IPCO (1990)
Franz Aurenhammer
A relationship between Gale transforms and Voronoi diagrams. Discret. Appl. Math. 28 (2) (1990)
Franz Aurenhammer
Using Gale Transforms in Computational Geometry. Workshop on Computational Geometry (1988)
Franz Aurenhammer
On-Line Sorting of Twisted Sequences in Linear Time. BIT 28 (2) (1988)
Franz Aurenhammer
Improved Algorithms for Discs and Balls Using Power Diagrams. J. Algorithms 9 (2) (1988)
Franz Aurenhammer
Power Diagrams: Properties, Algorithms and Applications. SIAM J. Comput. 16 (1) (1987)
Franz Aurenhammer
Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons. SCG (1987)
Franz Aurenhammer
Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra. J. Symb. Comput. 3 (3) (1987)
Franz Aurenhammer
. Discret. Comput. Geom. 2 (1987)

Franz Aurenhammer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Franz Aurenhammer