The following pages link to Herbert Edelsbrunner (Q242843):
Displaying 50 items.
- (Q194154) (redirect page) (← links)
- Multiple covers with balls. II: Weighted averages (Q510571) (← links)
- Quantifying transversality by measuring the robustness of intersections (Q544809) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\) (Q664353) (← links)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere (Q672249) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- Design and analysis of planar shape deformation (Q699976) (← links)
- Computing the writhing number of a polygonal knot (Q701774) (← links)
- An area derivative of a space-filling diagram (Q705122) (← links)
- The Voronoi functional is maximized by the Delaunay triangulation in the plane (Q722309) (← links)
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 (Q748891) (← links)
- An acyclicity theorem for cell complexes in d dimensions (Q756134) (← links)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane (Q793982) (← links)
- Extreme elevation on a 2-manifold (Q854709) (← links)
- Inclusion-exclusion formulas from independent complexes (Q866971) (← links)
- Stability of persistence diagrams (Q866974) (← links)
- The persistent homology of a self-map (Q887153) (← links)
- Approximation and convergence of the intrinsic volume (Q895555) (← links)
- Triangulations from topologically correct digital Voronoi diagrams (Q899709) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Covering convex sets with non-overlapping polygons (Q912393) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- The upper envelope of piecewise linear functions: Tight bounds on the number of faces (Q919829) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- Inequalities for the curvature of curves and surfaces (Q941781) (← links)
- Time-varying Reeb graphs for continuous space-time data (Q945940) (← links)
- Lipschitz functions have \(L_{p}\)-stable persistence (Q967205) (← links)
- Extending persistence using Poincaré and Lefschetz duality (Q1029553) (← links)
- Efficient algorithms for agglomerative hierarchical clustering methods (Q1057599) (← links)
- Optimal solutions for a class of point retrieval problems (Q1062772) (← links)
- Finding extreme points in three dimensions and solving the post-office problem in the plane (Q1069424) (← links)
- On the maximal number of edges of many faces in an arrangement (Q1071264) (← links)
- Voronoi diagrams and arrangements (Q1079823) (← links)
- Finding transversals for sets of simple geometric figures (Q1083215) (← links)
- The number of extreme pairs of finite point-sets in Euclidean spaces (Q1087828) (← links)
- Computing a ham-sandwich cut in two dimensions (Q1091824) (← links)
- Edge-skeletons in arrangements with applications (Q1091825) (← links)
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time (Q1097038) (← links)
- Zooming by repeated range detection (Q1098306) (← links)
- A tight lower bound on the size of visibility graphs (Q1098639) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- The complexity of cutting complexes (Q1115186) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- A space-optimal solution of general region location (Q1156491) (← links)
- Stabbing line segments (Q1163869) (← links)
- Polygonal intersection searching (Q1165007) (← links)
