The following pages link to Franz Aurenhammer (Q170469):
Displayed 50 items.
- New results on MWT subgraphs (Q294658) (← links)
- Straight skeletons and mitered offsets of nonconvex polytopes (Q331386) (← links)
- (Q400515) (redirect page) (← links)
- A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
- Computing convex quadrangulations (Q412380) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- On triangulation axes of polygons (Q458384) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- Computing equivalence classes among the edges of a graph with applications (Q686277) (← links)
- (Q750125) (redirect page) (← links)
- How to communicate efficiently (Q750126) (← links)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane (Q793982) (← links)
- Using Gale transforms in computational geometry (Q805285) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Pseudo-simplicial complexes from maximal locally convex functions (Q818695) (← links)
- Farthest line segment Voronoi diagrams (Q845871) (← links)
- Connecting colored point sets (Q868381) (← links)
- Hyperspheres in digital geometry (Q909499) (← links)
- A relationship between Gale transforms and Voronoi diagrams (Q920405) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- Transforming spanning trees and pseudo-triangulations (Q1044747) (← links)
- The one-dimensional weighted Voronoi diagram (Q1071508) (← links)
- A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\) (Q1085799) (← links)
- Recognising polytopical cell complexes and constructing projection polyhedra (Q1096404) (← links)
- Geometric relations among Voronoi diagrams (Q1101688) (← links)
- On-line sorting of twisted sequences in linear time (Q1104753) (← links)
- Linear combinations from power domains (Q1116094) (← links)
- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems (Q1179028) (← links)
- The enumeration of four-dimensional polytopes (Q1179273) (← links)
- Searching for segments with largest relative overlap (Q1186585) (← links)
- Cartesian graph factorization at logarithmic cost per edge (Q1210332) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- Constant-level greedy triangulations approximate the MWT well (Q1288473) (← links)
- Towards compatible triangulations. (Q1401254) (← links)
- Quickest paths, straight skeletons, and the city Voronoi diagram (Q1424315) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Enumerating order types for small point sets with applications (Q1863073) (← links)
- On computing the convex hull of (piecewise) curved objects (Q1948676) (← links)
- On shape Delaunay tessellations (Q2015147) (← links)
- On \(k\)-convex point sets (Q2248736) (← links)
- Partially walking a polygon (Q2331219) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- Weighted skeletons and fixed-share decomposition (Q2483555) (← links)
- (Q2736415) (← links)
- (Q2766811) (← links)