Franz Aurenhammer
#74,681
Most Influential Person Now
Austrian computational geometer
Franz Aurenhammer's AcademicInfluence.com Rankings
Franz Aurenhammermathematics Degrees
Mathematics
#5044
World Rank
#7133
Historical Rank
Geometry
#110
World Rank
#168
Historical Rank
Measure Theory
#1681
World Rank
#2067
Historical Rank
Download Badge
Computer Science Mathematics
Franz Aurenhammer's Degrees
- PhD Mathematics Graz University of Technology
Why Is Franz Aurenhammer Influential?
(Suggest an Edit or Addition)According to Wikipedia, Franz Aurenhammer is an Austrian computational geometer known for his research in computational geometry on Voronoi diagrams, straight skeletons, and related structures. He is a professor in the Institute for Theoretical Computer Science of Graz University of Technology.
Franz Aurenhammer's Published Works
Published Works
- Voronoi diagrams—a survey of a fundamental geometric data structure (1991) (4318)
- Power Diagrams: Properties, Algorithms and Applications (1987) (837)
- Voronoi Diagrams (2000) (635)
- A Novel Type of Skeleton for Polygons (1995) (367)
- Handbook of Computational Geometry (2000) (283)
- An optimal algorithm for constructing the weighted voronoi diagram in the plane (1984) (274)
- Minkowski-Type Theorems and Least-Squares Clustering (1998) (226)
- Straight Skeletons for General Polygonal Figures in the Plane (1996) (196)
- Enumerating Order Types for Small Point Sets with Applications (2002) (123)
- A criterion for the affine equivalence of cell complexes inRd and convex polyhedra inRd+1 (1987) (90)
- Medial axis computation for planar free-form shapes (2009) (88)
- A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams (1991) (75)
- On the Crossing Number of Complete Graphs (2002) (61)
- Improved Algorithms for Discs and Balls Using Power Diagrams (1988) (57)
- Geometric relations among Voronoi diagrams (1987) (54)
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip (2003) (49)
- Farthest line segment Voronoi diagrams (2006) (48)
- Quickest paths, straight skeletons, and the city Voronoi diagram (2002) (46)
- Cartesian graph factorization at logarithmic cost per edge (1992) (45)
- Triangulations intersect nicely (1995) (44)
- Recognising Polytopical Cell Complexes and Constructing Projection Polyhedra (1987) (43)
- Sequences of spanning trees and a fixed tree theorem (2002) (42)
- A new duality result concerning voronoi diagrams (1986) (40)
- Minkowski-type theorems and least-squares partitioning (1992) (40)
- Generalized self-approaching curves (1998) (36)
- Classifying Hyperplanes in Hypercubes (1994) (35)
- Voronoi diagrams for direction-sensitive distances (1997) (32)
- Divide-and-conquer for Voronoi diagrams revisited (2009) (31)
- Convexity minimizes pseudo-triangulations (2004) (31)
- Edge Operations on Non-Crossing Spanning Trees (2000) (26)
- Skew Voronoi Diagrams (1999) (26)
- Straight skeletons of simple polygons (1995) (26)
- Recognizing Binary Hamming Graphs in O(n² log n) Time (1990) (25)
- Computational and Structural Advantages of Circular Boundary Representation (2007) (24)
- Gray Code Enumeration of Plane Straight-Line Graphs (2006) (24)
- Weighted skeletons and fixed-share decomposition (2008) (23)
- Towards compatible triangulations (2001) (23)
- Evolution strategy and hierarchical clustering (2002) (21)
- Quickest Paths, Straight Skeletons, and the City Voronoi Diagram (2004) (20)
- Small weak epsilon nets (2009) (19)
- Transforming spanning trees and pseudo-triangulations (2006) (19)
- On minimum weight pseudo-triangulations (2009) (17)
- The One-Dimensional Weighted Voronoi Diagram (1986) (17)
- On-line sorting of twisted sequences in linear time (1988) (17)
- Straight skeletons for general polygonal figures (1995) (16)
- Optimal graph orientation with storage applications (1995) (16)
- Recognizing binary Hamming graphs inO(n2 logn) time (1995) (15)
- On k-convex polygons (2010) (15)
- Enumerating order types for small sets with applications (2001) (14)
- Computing equivalence classes among the edges of a graph with applications (1992) (13)
- Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics (2010) (12)
- International Journal of Computational Geometry & Applications (2014) (11)
- Matching Edges and Faces in Polygonal Partitions (2008) (11)
- Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips (2003) (11)
- Linear combinations from power domains (1988) (11)
- Optimal Triangulations (2009) (11)
- Computational Geometry - Some Easy Questions and their Recent Solutions (2001) (11)
- Recovering Structure from r‐Sampled Objects (2009) (11)
- New Results on MWT Subgraphs (1999) (11)
- Faster Isometric Embedding in Products of Complete Graphs (1994) (11)
- Approximating uniform triangular meshes in polygons (2000) (10)
- Pre-Triangulations and Liftable Complexes (2006) (10)
- Pseudo-Simplicial Complexes from Maximal Locally Convex Functions (2006) (9)
- On triangulation axes of polygons (2015) (8)
- On shape Delaunay tessellations (2014) (8)
- Straight Skeletons and Mitered Offsets of Nonconvex Polytopes (2016) (8)
- On the Peeper's Voronoi diagram (1991) (7)
- Algorithmic Fun-Abalone ∗ (7)
- Computing convex quadrangulations☆ (2012) (7)
- Approximating Boundary-Triangulated Objects with Balls (2007) (7)
- A relationship between Gale transforms and Voronoi diagrams (1990) (7)
- The Post Office Problem for Fuzzy Point Sets (1991) (6)
- Two-convex polygons (2009) (6)
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space (2017) (6)
- Structure and Computation of Straight Skeletons in 3-Space (2013) (6)
- Constant-Level Greedy Triangulations Approximate the MWT Well (1998) (6)
- New results on minimum-weight triangulations and the LMT skeleton (1997) (5)
- Connecting colored point sets (2007) (5)
- Factoring Cartesian-Product Graphs at Logarithmic Cost per Edge (1990) (5)
- Voronoi diagrams - computational geometry's favorite (2002) (5)
- Using Gale transforms in computational geometry (1988) (5)
- Arc Triangulations (2009) (5)
- On Computing the Convex Hull of (Piecewise) Curved Objects (2012) (4)
- On k-convex point sets (2014) (4)
- Spatial embedding of pseudo-triangulations (2003) (4)
- Triangulations with Circular Arcs (2011) (4)
- Niching evolution strategy with cluster algorithms (2000) (4)
- Jordan sorting via convex hulls of certain non-simple polygons (1987) (3)
- On (Pointed) Minimum Weight Pseudo-Triangulations (2007) (3)
- New greedy triangulation algorithms (1996) (3)
- A note on visibility-constrained Voronoi diagrams (2014) (3)
- Voronoi diagrams for parallel halflines in 3D (2016) (3)
- 3-Colorability of Pseudo-Triangulations (2015) (3)
- On the generality of power diagrams (1983) (2)
- Straight skeletons for binary shapes (2010) (2)
- Pseudo-tetrahedral complexes (2005) (1)
- Using Scaled Embedded Distances to Generate Metrics for R 2 (2013) (1)
- Progress on rectilinear crossing numbers (2002) (1)
- Counting Quadrics and Delaunay Triangulations and a new Convex Hull Theorem (2008) (1)
- On merging straight skeletons (2018) (1)
- Mitered offsets and straight skeletons for circular arc polygons (2018) (1)
- Lower and upper bounds on the number of empty cylinders and ellipsoids (2009) (1)
- Maximal Two-Guard Walks in a Polygon (2018) (1)
- Anisotropic Voronoi diagrams from distance graphs (2000) (0)
- Straight Skeletons and Mitered Offsets of Nonconvex Polytopes (2016) (0)
- Maximal Two-Guard Walks in Polygons (2018) (0)
- GENERAL SPACES & DISTANCES (2013) (0)
- University of Groningen Seed Polytopes for Incremental Approximation (2008) (0)
- SERIE B INFORMATIK Minkowski Type Theorems and Least Squares Partitioning (2009) (0)
- Editorial (2009) (0)
- Company SKEW VORONOI DIAGRAMS (2009) (0)
- Piecewise-Linear Farthest-Site Voronoi Diagrams (2021) (0)
- Searching for Segments with Largest Relative Overlap (1992) (0)
- Computing straight skeletons for arc polygons (2017) (0)
- Seed Polytopes for Incremental Approximation (2008) (0)
- Mitered Offsets and Skeletons for Circular Arc Polygons (2020) (0)
- Voronoi Diagrams for Oriented Spheres (2007) (0)
- Voronoi Diagrams from (Possibly Discontinuous) Embeddings (2013) (0)
- Approximating Uniform Triangular Meshes in Polygons (Algorithm Engineering as a New Paradigm) (1999) (0)
- Voronoi Diagrams from Distance Graphs ∗ (2013) (0)
- Polytope Offsets and Straight Skeletons in 3D (2014) (0)
- Towards Compatible TriangulationsOswin (2007) (0)
- Incremental Construction of Motorcycle Graphs (2022) (0)
- OSWIN AICHHOLZER AND FRANZ AURENHAMMER (0)
- Workshop Committee (2021) (0)
- phi-Self-Approaching Curves (1997) (0)
- On Computing the Convex Hull of (Piecewise) Curved Objects (2012) (0)
- APPLICATIONS AND RELATIVES (2013) (0)
- Partially Walking a Polygon (2018) (0)
- On the Crossing Number of Complete Graphs ( Extended Abstract ) (2013) (0)
- ALTERNATIVE SOLUTIONS IN Rd (2013) (0)
- International Journal of Computational Geometry & Applications C World Scientiic Publishing Company Skew Voronoi Diagrams (2008) (0)
- Pseudo-simplices and their derivation (2003) (0)
- Least-squares partitioning (1992) (0)
This paper list is powered by the following services:
Other Resources About Franz Aurenhammer
What Schools Are Affiliated With Franz Aurenhammer?
Franz Aurenhammer is affiliated with the following schools: