The following pages link to Micha Sharir (Q396765):
Displaying 50 items.
- (Q178850) (redirect page) (← links)
- Generalizations of the Szemerédi-Trotter theorem (Q282741) (← links)
- On the union complexity of diametral disks (Q396766) (← links)
- Union of random Minkowski sums and network vulnerability analysis (Q471144) (← links)
- Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited (Q504018) (← links)
- Incidences between points and lines in \({\mathbb {R}}^4\) (Q527445) (← links)
- Counting triangulations of planar point sets (Q540059) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← 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)
- On lines and joints (Q603871) (← links)
- An improved bound on the number of unit area triangles (Q603876) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- A kinetic triangulation scheme for moving points in the plane (Q632719) (← links)
- Relative \((p,\varepsilon )\)-approximations in geometry (Q633202) (← links)
- The overlay of minimization diagrams in a randomized incremental construction (Q633216) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- On critical orientations in the Kedem-Sharir motion planning algorithm (Q677023) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection (Q686143) (← links)
- Optimal slope selection via expanders (Q689630) (← links)
- Cell complexities in hyperplane arrangements (Q701778) (← links)
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
- The number of unit-area triangles in the plane: theme and variation (Q722324) (← links)
- Partial-matching RMS distance under translation: combinatorics and algorithms (Q724243) (← links)
- Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
- A note on distinct distances in rectangular lattices (Q740655) (← links)
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2 (Q748891) (← links)
- A new proof of the Maurey-Pisier theorem (Q755789) (← links)
- On the ''Piano Movers'' problem. II: General techniques for computing topological properties of real algebraic manifolds (Q760006) (← links)
- Merging visibility maps (Q808306) (← links)
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
- \(k\)-sets in four dimensions (Q818689) (← links)
- Minkowski sums of monotone and general simple polygons (Q818692) (← links)
- Output sensitive algorithms for approximate incidences and their applications (Q827295) (← links)
- Linear data structures for fast ray-shooting amidst convex polyhedra (Q834599) (← links)
- On the union of \(\kappa\)-round objects in three and four dimensions (Q854705) (← links)
- Kinetic and dynamic data structures for convex hulls and upper envelopes (Q857064) (← links)
- A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\) (Q866969) (← links)
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions (Q908209) (← links)
- On triple intersections of three families of unit circles (Q908211) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
- On the performance of the ICP algorithm (Q934025) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Eppstein's bound on intersecting triangles revisited (Q1003657) (← links)
- The Minkowski sum of a simple polygon and a segment (Q1007520) (← links)
