Franz Aurenhammer

According to our database1, Franz Aurenhammer
  • authored at least 100 papers between 1984 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Voronoi Diagrams for Parallel Halflines and Line Segments in Space.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
Straight Skeletons and Mitered Offsets of Nonconvex Polytopes.
Discrete & Computational Geometry, 2016

2015
Triangulations with Circular Arcs.
J. Graph Algorithms Appl., 2015

On triangulation axes of polygons.
Inf. Process. Lett., 2015

3-Colorability of Pseudo-Triangulations.
Int. J. Comput. Geometry Appl., 2015

2014
On shape Delaunay tessellations.
Inf. Process. Lett., 2014

A note on visibility-constrained Voronoi diagrams.
Discrete Applied Mathematics, 2014

On k-convex point sets.
Comput. Geom., 2014

Polytope Offsets and Straight Skeletons in 3D.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

2013
Voronoi Diagrams from (Possibly Discontinuous) Embeddings.
Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering, 2013

Structure and Computation of Straight Skeletons in 3-Space.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Voronoi Diagrams and Delaunay Triangulations.
World Scientific, ISBN: 978-981-4447-63-8, 2013

2012
On Computing the Convex Hull of (Piecewise) Curved Objects.
Mathematics in Computer Science, 2012

Computing convex quadrangulations.
Discrete Applied Mathematics, 2012

On k-convex polygons.
Comput. Geom., 2012

2011
Computational and Structural Advantages of Circular Boundary Representation.
Int. J. Comput. Geometry Appl., 2011

Triangulations with Circular Arcs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
On k-Convex Polygons
CoRR, 2010

Divide-and-conquer for Voronoi diagrams revisited.
Comput. Geom., 2010

Straight skeletons for binary shapes.
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.
Proceedings of the Curves and Surfaces, 2010

2009
Optimal Triangulations.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Small weak epsilon-nets.
Comput. Geom., 2009

On minimum weight pseudo-triangulations.
Comput. Geom., 2009

Editorial.
Comput. Geom., 2009

Recovering Structure from r-Sampled Objects.
Comput. Graph. Forum, 2009

Medial axis computation for planar free-form shapes.
Computer-Aided Design, 2009

Divide-and-conquer for Voronoi diagrams revisited.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Weighted skeletons and fixed-share decomposition.
Comput. Geom., 2008

Matching edges and faces in polygonal partitions.
Comput. Geom., 2008

2007
Gray Code Enumeration of Plane Straight-Line Graphs.
Graphs and Combinatorics, 2007

Pre-Triangulations and Liftable Complexes.
Discrete & Computational Geometry, 2007

Connecting colored point sets.
Discrete Applied Mathematics, 2007

Computational and Structural Advantages of Circular Boundary Representation.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

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

On (Pointed) Minimum Weight Pseudo-Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Farthest line segment Voronoi diagrams.
Inf. Process. Lett., 2006

Transforming spanning trees and pseudo-triangulations.
Inf. Process. Lett., 2006

Pseudo-Simplicial Complexes from Maximal Locally Convex Functions.
Discrete & Computational Geometry, 2006

On the Crossing Number of Complete Graphs.
Computing, 2006

Pre-triangulations and liftable complexes.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Pseudo-tetrahedral complexes.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Transforming spanning trees and pseudo-triangulations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Small weak epsilon nets.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

Matching Edges and Faces in Polygonal Partitions.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.
Discrete & Computational Geometry, 2004

Convexity minimizes pseudo-triangulations.
Comput. Geom., 2004

2003
Towards compatible triangulations.
Theor. Comput. Sci., 2003

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
SIAM J. Comput., 2003

Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Spatial embedding of pseudo-triangulations.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Approximating uniform triangular meshes in polygons.
Theor. Comput. Sci., 2002

Enumerating Order Types for Small Point Sets with Applications.
Order, 2002

Sequences of spanning trees and a fixed tree theorem.
Comput. Geom., 2002

Quickest paths, straight skeletons, and the city Voronoi diagram.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

On the crossing number of complete graphs.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Convexity minimizes pseudo-triangulations.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Computational Geometry - Some Easy Questions and their Recent Solutions.
J. UCS, 2001

Generalized self-approaching curves.
Discrete Applied Mathematics, 2001

Enumerating order types for small sets with applications.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Towards Compatible Triangulations.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Edge Operations on Non-Crossing Spanning Trees.
EuroCG, 2000

Approximating Uniform Triangular Meshes in Polygons.
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

1999
New Results on MWT Subgraphs.
Inf. Process. Lett., 1999

Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl., 1999

1998
Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim., 1998

Minkowski-Type Theorems and Least-Squares Clustering.
Algorithmica, 1998

Generalized Self-Approaching Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
Voronoi Diagrams for Direction-Sensitive Distances.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Classifying Hyperplanes in Hypercubes.
SIAM J. Discrete Math., 1996

Triangulations Intersect Nicely.
Discrete & Computational Geometry, 1996

Straight Skeletons for General Polygonal Figures in the Plane.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Recognizing Binary Hamming Graphs in O(n² log n) Time.
Mathematical Systems Theory, 1995

A Novel Type of Skeleton for Polygons.
J. UCS, 1995

Triangulations Intersect Nicely.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Faster Isometric Embedding in Products of Complete Graphs.
Discrete Applied Mathematics, 1994

1992
Searching for Segments with Largest Relative Overlap.
Inf. Process. Lett., 1992

A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams.
Int. J. Comput. Geometry Appl., 1992

Computing equivalence classes among the edges of a graph with applications.
Discrete Mathematics, 1992

Cartesian Graph Factorization at Logarithmic Cost per Edge.
Computational Complexity, 1992

Minkowski-Type Theorems and Least-Squares Partitioning.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Using Gale transforms in computational geometry.
Math. Program., 1991

Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure.
ACM Comput. Surv., 1991

A Simple On-Line Randomized Incremental Algorithm for Computing Higher Order Voronoi Diagrams.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

The Post Office Problem for Fuzzy Point Sets.
Proceedings of the Computational Geometry, 1991

1990
A New Duality Result Concerning Voronoi Diagrams.
Discrete & Computational Geometry, 1990

A relationship between Gale transforms and Voronoi diagrams.
Discrete Applied Mathematics, 1990

Recognizing Binary Hamming Graphs in O(n² log n) Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990

Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1988
Improved Algorithms for Discs and Balls Using Power Diagrams.
J. Algorithms, 1988

On-Line Sorting of Twisted Sequences in Linear Time.
BIT, 1988

Using Gale Transforms in Computational Geometry.
Proceedings of the Computational Geometry and its Applications, 1988

1987
Power Diagrams: Properties, Algorithms and Applications.
SIAM J. Comput., 1987

Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra.
J. Symb. Comput., 1987

A Criterion for the Affine Equivalence of Cell Complexes in Rd and Convex Polyhedra in Rd+1+.
Discrete & Computational Geometry, 1987

Geometric Relations Among Voronoi Diagrams.
Proceedings of the STACS 87, 1987

Jordan Sorting Via Convex Hulls of Certain Non-Simple Polygons.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
The One-Dimensional Weighted Voronoi Diagram.
Inf. Process. Lett., 1986

A New Duality Result Concerning Voronoi Diagrams.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1984
An optimal algorithm for constructing the weighted voronoi diagram in the plane.
Pattern Recognition, 1984


  Loading...