Franz Aurenhammer

From MaRDI portal
(Redirected from Franz Aurenhammer)
Person:170469

Available identifiers

zbMath Open aurenhammer.franzWikidataQ28911733 ScholiaQ28911733MaRDI QIDQ170469

List of research outcomes

PublicationDate of PublicationType
Straight skeletons for general polygonal figures in the plane2024-01-29Paper
https://portal.mardi4nfdi.de/entity/Q61475312024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q50910532022-07-21Paper
Mitered Offsets and Skeletons for Circular Arc Polygons2021-11-26Paper
https://portal.mardi4nfdi.de/entity/Q51362222020-11-25Paper
Partially walking a polygon2019-10-25Paper
On the crossing number of complete graphs2018-11-23Paper
Quickest paths, straight skeletons, and the city Voronoi diagram2018-11-23Paper
Divide-and-conquer for Voronoi diagrams revisited2017-10-20Paper
Enumerating order types for small sets with applications2017-09-29Paper
Spatial embedding of pseudo-triangulations2017-09-29Paper
Straight skeletons and mitered offsets of nonconvex polytopes2016-10-27Paper
New results on MWT subgraphs2016-06-16Paper
3-Colorability of Pseudo-Triangulations2016-03-14Paper
https://portal.mardi4nfdi.de/entity/Q29484232015-09-30Paper
Triangulations with Circular Arcs2015-01-27Paper
On triangulation axes of polygons2014-10-07Paper
A note on visibility-constrained Voronoi diagrams2014-08-22Paper
On \(k\)-convex point sets2014-06-27Paper
On shape Delaunay tessellations2014-06-23Paper
Structure and Computation of Straight Skeletons in 3-Space2014-01-14Paper
Voronoi Diagrams and Delaunay Triangulations2013-10-17Paper
On computing the convex hull of (piecewise) curved objects2013-04-24Paper
On \(k\)-convex polygons2012-06-13Paper
Computing convex quadrangulations2012-05-04Paper
Triangulations with Circular Arcs2012-03-09Paper
Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics2012-01-13Paper
COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION2011-06-17Paper
Divide-and-conquer for Voronoi diagrams revisited2010-09-02Paper
Algorithms and Data Structures2010-04-20Paper
Farthest line segment Voronoi diagrams2010-01-29Paper
Transforming spanning trees and pseudo-triangulations2009-12-18Paper
On minimum weight pseudo-triangulations2009-07-27Paper
Small weak epsilon-nets2009-06-18Paper
Computational and Structural Advantages of Circular Boundary Representation2009-02-17Paper
https://portal.mardi4nfdi.de/entity/Q36015502009-02-10Paper
Weighted skeletons and fixed-share decomposition2008-04-28Paper
Pre-triangulations and liftable complexes2008-02-18Paper
Gray code enumeration of plane straight-line graphs2007-12-10Paper
Connecting colored point sets2007-03-02Paper
Pseudo-simplicial complexes from maximal locally convex functions2006-03-21Paper
On the crossing number of complete graphs2006-03-02Paper
Convexity minimizes pseudo-triangulations2004-08-06Paper
Quickest paths, straight skeletons, and the city Voronoi diagram2004-03-11Paper
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip2004-01-08Paper
Towards compatible triangulations.2003-08-17Paper
Enumerating order types for small point sets with applications2003-03-11Paper
Approximating uniform triangular meshes in polygons.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q45513522002-09-05Paper
Sequences of spanning trees and a fixed tree theorem2002-09-03Paper
https://portal.mardi4nfdi.de/entity/Q27668112002-07-01Paper
Constant-level greedy triangulations approximate the MWT well2001-11-06Paper
https://portal.mardi4nfdi.de/entity/Q27364152001-10-23Paper
Generalized self-approaching curves2001-04-04Paper
https://portal.mardi4nfdi.de/entity/Q47618582001-02-21Paper
https://portal.mardi4nfdi.de/entity/Q45092052000-10-11Paper
https://portal.mardi4nfdi.de/entity/Q49422632000-05-11Paper
SKEW VORONOI DIAGRAMS2000-05-07Paper
https://portal.mardi4nfdi.de/entity/Q49455052000-03-23Paper
Triangulations intersect nicely1997-02-18Paper
Classifying Hyperplanes in Hypercubes1996-09-12Paper
Recognizing binary Hamming graphs inO(n 2 logn) time1995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q31391191994-11-06Paper
A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS1993-10-17Paper
Computing equivalence classes among the edges of a graph with applications1993-10-14Paper
Cartesian graph factorization at logarithmic cost per edge1993-08-08Paper
https://portal.mardi4nfdi.de/entity/Q40357411993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40281061993-03-28Paper
Searching for segments with largest relative overlap1992-06-28Paper
Using Gale transforms in computational geometry1991-01-01Paper
A relationship between Gale transforms and Voronoi diagrams1990-01-01Paper
A new duality result concerning Voronoi diagrams1990-01-01Paper
Geometric relations among Voronoi diagrams1988-01-01Paper
On-line sorting of twisted sequences in linear time1988-01-01Paper
Linear combinations from power domains1988-01-01Paper
Improved algorithms for discs and balls using power diagrams1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38336681988-01-01Paper
A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\)1987-01-01Paper
Recognising polytopical cell complexes and constructing projection polyhedra1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37823421987-01-01Paper
Power Diagrams: Properties, Algorithms and Applications1987-01-01Paper
The one-dimensional weighted Voronoi diagram1986-01-01Paper
A new duality result concerning Voronoi diagrams1986-01-01Paper
An optimal algorithm for constructing the weighted Voronoi diagram in the plane1984-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Franz Aurenhammer