Micha Sharir

From MaRDI portal
Revision as of 15:15, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Micha Sharir to Micha Sharir: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:396765

Available identifiers

zbMath Open sharir.michaWikidataQ6827992 ScholiaQ6827992MaRDI QIDQ396765

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61473412024-01-15Paper
https://portal.mardi4nfdi.de/entity/Q61877872024-01-15Paper
Throwing a sofa through the window2023-12-21Paper
On reverse shortest paths in geometric proximity graphs2023-11-23Paper
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets.2023-11-02Paper
How to Find a Point in the Convex Hull Privately2023-11-02Paper
https://portal.mardi4nfdi.de/entity/Q60600172023-11-02Paper
Bottleneck matching in the plane2023-06-26Paper
Space-aware reconfiguration2023-05-12Paper
Erratum: “Breaking the 3/2 barrier for unit distances in three dimensions”2023-02-10Paper
Computing the smallest k-enclosing circle and related problems2023-01-18Paper
Time and space efficient collinearity indexing2023-01-09Paper
Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications2022-12-16Paper
On the number of regular vertices of the union of Jordan regions2022-12-09Paper
Computing depth orders and related problems2022-12-09Paper
Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems2022-12-08Paper
Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model2022-11-16Paper
On rich points and incidences with restricted sets of lines in 3-space2022-10-31Paper
Dynamic data structures for fat objects and their applications2022-08-19Paper
A combinatorial bound for linear programming and related problems2022-08-18Paper
On Ray Shooting for Triangles in 3-Space and Related Problems2022-07-22Paper
https://portal.mardi4nfdi.de/entity/Q50910172022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50910422022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50889352022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50889952022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50758092022-05-11Paper
Counting and Cutting Rich Lenses in Arrangements of Circles2022-04-20Paper
The maximum-level vertex in an arrangement of lines2022-03-21Paper
Incidences between points and curves with almost two degrees of freedom2022-02-24Paper
Space-Aware Reconfiguration2021-09-20Paper
Union of Hypercubes and 3D Minkowski Sums with Random Sizes.2021-07-28Paper
Stabbing pairwise intersecting disks by five points2021-06-14Paper
Union of hypercubes and 3D Minkowski sums with random sizes2021-04-29Paper
On the complexity of the \(k\)-level in arrangements of pseudoplanes2021-04-28Paper
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time2021-04-14Paper
Output sensitive algorithms for approximate incidences and their applications2021-01-07Paper
On rich lenses in planar arrangements of circles and related problems2020-12-07Paper
Dominance Product and High-Dimensional Closest Pair under L_infty2020-11-25Paper
Eliminating depth cycles among triangles in three dimensions2020-10-23Paper
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications2020-10-23Paper
Algebraic Techniques in Geometry2020-09-09Paper
Incidences with curves in three dimensions2020-07-06Paper
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location2020-06-16Paper
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51116872020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51116882020-05-27Paper
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy2020-05-27Paper
https://portal.mardi4nfdi.de/entity/Q51117412020-05-27Paper
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points2019-10-25Paper
Incidences between points and lines in three dimensions2019-06-12Paper
A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model2019-05-21Paper
Computing the Discrete Fréchet Distance in Subquadratic Time2019-05-15Paper
Reporting Neighbors in High-Dimensional Euclidean Space2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434042019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338232019-05-06Paper
Dynamic Time Warping and Geometric Edit Distance2019-03-28Paper
Point-line incidences in space2018-11-23Paper
Incidences between points and circles in three and higher dimensions2018-11-23Paper
Lenses in arrangements of pseudo-circles and their applications2018-11-23Paper
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations2018-11-23Paper
Polyhedral Voronoi diagrams of polyhedra in three dimensions2018-11-23Paper
The Elekes-Szabó theorem in four dimensions2018-11-13Paper
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications2018-11-05Paper
Kinetic and dynamic data structures for closest pair and all nearest neighbors2018-11-05Paper
Algorithms for center and Tverberg points2018-11-05Paper
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles2018-11-05Paper
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection2018-10-30Paper
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM2018-08-13Paper
Partial-matching RMS distance under translation: combinatorics and algorithms2018-07-25Paper
The number of unit-area triangles in the plane: theme and variation2018-07-23Paper
Approximating the k-Level in Three-Dimensional Plane Arrangements2018-07-16Paper
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances2018-07-16Paper
Eliminating Depth Cycles among Triangles in Three Dimensions2018-07-16Paper
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications2018-07-16Paper
Homotheties and incidences2018-05-24Paper
On triple intersections of three families of unit circles2018-04-23Paper
Incidences between points and lines in R42018-04-23Paper
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage2018-04-23Paper
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection2018-04-23Paper
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited2018-04-23Paper
Almost tight bounds for eliminating depth cycles in three dimensions2018-04-20Paper
https://portal.mardi4nfdi.de/entity/Q46079142018-03-15Paper
Distinct distances between points and lines2018-02-28Paper
Incidences between points and lines on two- and three-dimensional varieties2018-02-28Paper
Approximating the k-Level in Three-Dimensional Plane Arrangements2018-02-26Paper
Distinct distances between a collinear set and an arbitrary set of points2017-10-24Paper
An improved bound on the number of unit area triangles2017-10-20Paper
Distinct Distances from Three Points2017-10-10Paper
Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited2017-10-10Paper
Incidences between points and lines in three dimensions2017-10-10Paper
The number of unit-area triangles in the plane: Theme and variations2017-10-10Paper
Improved Bounds for Incidences Between Points and Circles2017-10-04Paper
An improved bound for k -sets in three dimensions2017-09-29Paper
The 2-center problem with obstacles2017-09-29Paper
On the number of congruent simplices in a point2017-09-29Paper
The union of congruent cubes in three dimensions2017-09-29Paper
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles2017-09-29Paper
The Clarkson-Shor technique revisited and extended2017-09-29Paper
Balanced lines, halving triangles, and the generalized lower bound theorem2017-09-29Paper
A tight bound for the number of different directions in three dimensions2017-09-29Paper
Curve-sensitive cuttings2017-09-29Paper
Hausdorff distance under translation for points and balls2017-09-29Paper
On lines avoiding unit balls in three dimensions2017-09-29Paper
Algorithms for center and Tverberg points2017-09-29Paper
Solution of Scott's problem on the number of directions determined by a point set in 3-space2017-09-29Paper
New results on shortest paths in three dimensions2017-09-29Paper
Counting and representing intersections among triangles in three dimensions2017-09-29Paper
On the union of κ-round objects2017-09-29Paper
On empty convex polygons in a planar point set2017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53651542017-09-29Paper
Almost tight bounds for eliminating depth cycles in three dimensions2017-09-29Paper
On the number of unit-area triangles spanned by convex grids in the plane2017-06-29Paper
Cutting algebraic curves into pseudo-segments and applications2017-05-29Paper
Incidences between points and lines in \({\mathbb {R}}^4\)2017-05-11Paper
Finding the largest disk containing a query point in logarithmic time with linear storage2017-03-30Paper
Polynomials vanishing on Cartesian products: the Elekes-Szabó theorem revisited2017-01-25Paper
Incidences with curves in \(\mathbb{R}^d\)2016-12-06Paper
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited2016-08-22Paper
In Memory of Jacob Schwartz2016-06-15Paper
Generalizations of the Szemerédi-Trotter theorem2016-05-12Paper
Distinct and repeated distances on a surface and incidences between points and spheres2016-04-06Paper
Incidences between points on a variety and planes in R^32016-03-15Paper
Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions2016-02-03Paper
On triple intersections of three families of unit circles2016-02-03Paper
On the union of fat tetrahedra in three dimensions2015-12-07Paper
Incidences with Curves in ℝ d2015-11-19Paper
Weak ε-nets and interval chains2015-11-11Paper
https://portal.mardi4nfdi.de/entity/Q55018262015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55012882015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013002015-08-03Paper
Geometrically aware communication in random wireless networks2015-08-03Paper
Lenses in arrangements of pseudo-circles and their applications2015-08-01Paper
Distinct distances on two lines2015-06-19Paper
Improved bounds on weak ε-nets for convex sets2015-05-07Paper
Sets with few distinct distances do not have heavy lines2015-04-29Paper
Improved bounds for incidences between points and circles2015-02-17Paper
Union of random minkowski sums and network vulnerability analysis2015-02-17Paper
Incidences between points and lines on a two-dimensional variety2015-01-13Paper
https://portal.mardi4nfdi.de/entity/Q29346652014-12-18Paper
Hausdorff distance under translation for points and balls2014-11-18Paper
Union of random Minkowski sums and network vulnerability analysis2014-11-14Paper
Reporting Neighbors in High-Dimensional Euclidean Space2014-11-14Paper
https://portal.mardi4nfdi.de/entity/Q29216632014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29217092014-10-13Paper
https://portal.mardi4nfdi.de/entity/Q29217112014-10-13Paper
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms2014-10-08Paper
A note on distinct distances in rectangular lattices2014-09-04Paper
On the union complexity of diametral disks2014-08-14Paper
FINDING THE LARGEST EMPTY DISK CONTAINING A QUERY POINT2014-08-11Paper
Counting plane graphs2014-08-07Paper
Finding the maximal empty disk containing a query point2014-08-07Paper
Computing the Discrete Fréchet Distance in Subquadratic Time2014-07-30Paper
Improved Bounds for the Union of Locally Fat Objects in the Plane2014-07-30Paper
On Range Searching with Semialgebraic Sets. II2014-04-11Paper
The 2-center problem in three dimensions2014-04-03Paper
A kinetic triangulation scheme for moving points in the plane2014-04-03Paper
On degrees in random triangulations of point sets2014-04-03Paper
Incidences in three dimensions and distinct distances in the plane2014-04-03Paper
Counting Plane Graphs: Cross-Graph Charging Schemes2014-02-24Paper
On lattices, distinct distances, and the Elekes-Sharir framework2013-06-02Paper
The 2-center problem in three dimensions2013-04-29Paper
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique2013-04-15Paper
Counting Plane Graphs: Cross-Graph Charging Schemes2013-04-03Paper
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique2012-10-15Paper
Unit Distances in Three Dimensions2012-09-04Paper
Improved Bounds for Geometric Permutations2012-08-10Paper
Near-linear approximation algorithms for geometric hitting sets2012-04-26Paper
Optimal Cover of Points by Disks in a Simple Polygon2012-03-15Paper
Semialgebraic Range Reporting and Emptiness Searching with Applications2011-11-07Paper
Non-Degenerate Spheres in Three Dimensions2011-08-16Paper
Incidences in Three Dimensions and Distinct Distances in the Plane2011-08-16Paper
On degrees in random triangulations of point sets2011-07-07Paper
Counting triangulations of planar point sets2011-06-01Paper
On lines, joints, and incidences in three dimensions2011-04-11Paper
Approximate Halfspace Range Counting2011-04-04Paper
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes2011-04-04Paper
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$2011-04-04Paper
Relative \((p,\varepsilon )\)-approximations in geometry2011-03-31Paper
The overlay of minimization diagrams in a randomized incremental construction2011-03-31Paper
A kinetic triangulation scheme for moving points in the plane2011-03-25Paper
Range minima queries with respect to a random permutation, and approximate range counting2011-03-10Paper
An Improved Bound for k-Sets in Four Dimensions2011-01-17Paper
On lines and joints2010-11-08Paper
An improved bound on the number of unit area triangles2010-11-08Paper
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space2010-11-02Paper
Guarding a terrain by two watchtowers2010-09-16Paper
Optimal Cover of Points by Disks in a Simple Polygon2010-09-06Paper
Cutting triangular cycles of lines in space2010-08-16Paper
Distinct distances in three and higher dimensions2010-08-16Paper
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting2010-08-16Paper
On the number of crossing-free matchings, (cycles, and partitions)2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35793892010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35647242010-05-26Paper
Algorithms and Data Structures2010-04-20Paper
Algorithms - ESA 20032010-03-03Paper
Extremal problems on triangle areas in two and three dimensions2009-11-26Paper
Linear data structures for fast ray-shooting amidst convex polyhedra2009-08-27Paper
Efficient Colored Orthogonal Range Counting2009-06-22Paper
On regular vertices of the union of planar convex objects2009-05-13Paper
On overlays and minimization diagrams2009-04-27Paper
https://portal.mardi4nfdi.de/entity/Q36199302009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36199562009-04-14Paper
The Minkowski sum of a simple polygon and a segment2009-03-23Paper
Eppstein's bound on intersecting triangles revisited2009-03-04Paper
On planar intersection graphs with forbidden subgraphs2009-02-20Paper
Bi-criteria linear-time approximations for generalized k-mean/median/center2009-02-12Paper
On regular vertices on the union of planar objects2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36028792009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36028862009-02-12Paper
On approximate halfspace range counting and relative epsilon-approximations2009-02-12Paper
The complexity of the outer face in arrangements of random segments2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36029142009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36015182009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q36015222009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q36015272009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q36015492009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q36015642009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q53026102009-01-08Paper
Stabbing Convex Polygons with a Segment or a Polygon2008-11-25Paper
Arrangements in Geometry: Recent Advances and Challenges2008-09-25Paper
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra2008-09-25Paper
Efficient algorithms for maximum regression depth2008-08-19Paper
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes2008-08-13Paper
On the performance of the ICP algorithm2008-07-29Paper
https://portal.mardi4nfdi.de/entity/Q35145152008-07-21Paper
Computing a Center-Transversal Line2008-04-17Paper
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D2008-04-16Paper
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions2008-04-16Paper
Solution of Scott's problem on the number of directions determined by a point set in 3-space2007-12-19Paper
Online Conflict‐Free Coloring for Intervals2007-10-22Paper
On the Number of Crossing‐Free Matchings, Cycles, and Partitions2007-06-26Paper
Computing Maximally Separated Sets in the Plane2007-06-26Paper
A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)2007-02-14Paper
Kinetic and dynamic data structures for convex hulls and upper envelopes2006-12-14Paper
On the union of \(\kappa\)-round objects in three and four dimensions2006-12-06Paper
Algorithms and Data Structures2006-10-25Paper
On graphs that do not contain the cube and related problems2006-06-27Paper
Repeated Angles in Three and Four Dimensions2006-06-01Paper
On empty convex polygons in a planar point set2006-04-28Paper
\(k\)-sets in four dimensions2006-03-21Paper
Minkowski sums of monotone and general simple polygons2006-03-21Paper
https://portal.mardi4nfdi.de/entity/Q33742532006-03-09Paper
Topological graphs with no large grids2005-11-24Paper
Counting and representing intersections among triangles in three dimensions2005-11-01Paper
Lines avoiding unit balls in three dimensions2005-11-01Paper
https://portal.mardi4nfdi.de/entity/Q56926892005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q56927282005-09-28Paper
Crossing patterns of semi-algebraic sets2005-09-28Paper
Curve-Sensitive Cuttings2005-09-16Paper
Output-Sensitive Construction of the Union of Triangles2005-09-16Paper
Top-Down Analysis of Path Compression2005-09-16Paper
Pseudo-Line Arrangements: Duality, Algorithms, and Applications2005-09-16Paper
Ray shooting and stone throwing with near-linear storage2005-05-12Paper
Cutting triangular cycles of lines in space2005-04-15Paper
An improved bound for joints in arrangements of lines in space2005-04-15Paper
Incidences between points and circles in three and higher dimensions2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46575902005-03-14Paper
The Simplex Algorithm in Dimension Three2005-02-21Paper
Cell complexities in hyperplane arrangements2004-12-16Paper
https://portal.mardi4nfdi.de/entity/Q48290162004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q48290172004-11-29Paper
On the number of directions determined by a three-dimensional points set2004-10-14Paper
Point–Line Incidences in Space2004-09-24Paper
Distinct Distances in Three and Higher Dimensions2004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48192502004-09-24Paper
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q30464852004-08-12Paper
On the number of views of translates of a cube and related problems.2004-03-14Paper
Polyhedral Voronoi diagrams of polyhedra in three dimensions2004-03-11Paper
The Clarkson–Shor Technique Revisited and Extended2004-02-20Paper
Speeding up the incremental construction of the union of geometric objects in practice.2004-01-23Paper
The union of congruent cubes in three dimensions2003-08-21Paper
On neighbors in geometric permutations.2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44113442003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44113842003-07-08Paper
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations2003-06-19Paper
The Partition Technique for Overlays of Envelopes2003-06-19Paper
Cutting circles into pseudo-segments and improved bounds for incidences2003-03-17Paper
The number of congruent simplices in a point set2003-03-17Paper
Reporting intersecting pairs of convex polytopes in two and three dimensions2003-03-10Paper
The Random Edge Rule on Three-Dimensional Linear Programs2003-01-09Paper
https://portal.mardi4nfdi.de/entity/Q47785482002-11-18Paper
On the number of regular vertices of the union of Jordan regions2002-11-04Paper
The 2-Center Problem with Obstacles2002-10-02Paper
Radial points in the plane2002-08-21Paper
Exact and approximation algorithms for minimum-width cylindrical shells2002-07-22Paper
An improved bound for \(k\)-sets in three dimensions2002-07-10Paper
On the complexity of arrangements of circles in the plane2002-02-07Paper
https://portal.mardi4nfdi.de/entity/Q27682722002-01-30Paper
Online point location in planar arrangements and its applications2002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27082362002-01-17Paper
Approximation algorithms for minimum-width annuli and shells2001-08-16Paper
https://portal.mardi4nfdi.de/entity/Q27219922001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q49526602001-01-29Paper
Pipes, cigars, and Kreplach: The union of Minkowski sums in three dimensions2000-12-19Paper
https://portal.mardi4nfdi.de/entity/Q49455022000-11-12Paper
Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)2000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45016612000-09-04Paper
Dynamic data structures for fat objects and their applications2000-05-08Paper
https://portal.mardi4nfdi.de/entity/Q49455012000-03-23Paper
On the complexity of the union of fat convex objects in the plane2000-03-23Paper
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications2000-03-19Paper
On the boundary of the union of planar convex sets1999-12-06Paper
https://portal.mardi4nfdi.de/entity/Q44010301999-11-08Paper
Motion planning for a convex polygon in a polygonal environment1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42522671999-06-17Paper
Line transversals of balls and smallest enclosing cylinders in three dimensions1999-05-27Paper
Partial surface matching by using directed footprints1999-05-03Paper
The discrete 2-center problem1999-04-19Paper
https://portal.mardi4nfdi.de/entity/Q42253131999-01-18Paper
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions1999-01-17Paper
On the Number of Incidences Between Points and Curves1998-11-22Paper
Vertical decomposition of a single cell in a three-dimensional arrangement of surfaces1998-07-27Paper
Voronoi diagrams in higher dimensions under certain polyhedral distance functions1998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43855131998-05-04Paper
Largest placement of one convex polygon inside another1998-03-11Paper
Approximating shortest paths on a convex polytope in three dimensions1998-02-17Paper
The common exterior of convex polygons in the plane1998-02-16Paper
An Expander-Based Approach to Geometric Optimization1998-02-10Paper
The Union of Convex Polyhedra in Three Dimensions1998-02-10Paper
Computing Envelopes in Four Dimensions with Applications1998-02-10Paper
On Translational Motion Planning of a Convex Polyhedron in 3-Space1998-02-10Paper
Quasi-planar graphs have a linear number of edges1998-01-05Paper
A near-linear algorithm for the planar 2-center problem1997-08-24Paper
Coordinated motion planning for two independent robots1997-07-07Paper
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems1997-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43351981997-04-23Paper
On critical orientations in the Kedem-Sharir motion planning algorithm1997-03-23Paper
Filling gaps in the boundary of a polyhedron1997-02-28Paper
Excess in arrangements of segments1997-02-27Paper
A subexponential bound for linear programming1997-02-18Paper
Ray Shooting Amidst Convex Polygons in 2D1996-12-08Paper
A near-linear algorithm for the planar segment-center problem1996-11-26Paper
Efficient randomized algorithms for some geometric optimization problems1996-11-26Paper
Computing depth orders for fat objects and related problems1996-11-10Paper
Robot motion planning1996-11-05Paper
A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment1996-10-13Paper
https://portal.mardi4nfdi.de/entity/Q48860491996-08-22Paper
Piecewise-Linear Interpolation between Polygonal Slices1996-07-31Paper
The overlay of lower envelopes and its applications1996-06-27Paper
Almost tight upper bounds for the single cell and zone problems in the three dimensions1996-06-23Paper
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions1996-06-05Paper
Lines in space: Combinatorics and algorithms1996-05-27Paper
https://portal.mardi4nfdi.de/entity/Q48751761996-04-28Paper
https://portal.mardi4nfdi.de/entity/Q48486101996-03-27Paper
Applications of Parametric Searching in Geometric Optimization1995-11-22Paper
Common tangents and common transversals1995-11-12Paper
https://portal.mardi4nfdi.de/entity/Q43281851995-09-19Paper
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains1995-08-27Paper
Almost tight upper bounds for lower envelopes in higher dimensions1995-08-27Paper
Algorithms for bichromatic line-segment problems and polyhedral terrains1995-08-20Paper
Vertical decomposition of arrangements of hyperplanes in four dimensions1995-08-13Paper
An elementary approach to lower bounds in geometric discrepancy1995-07-02Paper
https://portal.mardi4nfdi.de/entity/Q47633911995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q47633931995-04-11Paper
Selecting Heavily Covered Points1995-04-06Paper
Improved bounds on weak \(\varepsilon\)-nets for convex sets1995-04-03Paper
https://portal.mardi4nfdi.de/entity/Q31387421995-03-29Paper
https://portal.mardi4nfdi.de/entity/Q43255461995-03-12Paper
On the union of fat wedges and separating a collection of segments by a line1994-11-29Paper
https://portal.mardi4nfdi.de/entity/Q31404281994-11-29Paper
Motion planning in the presence of moving obstacles1994-11-03Paper
Castles in the air revisited1994-09-26Paper
On the number of views of polyhedral terrains1994-09-26Paper
\(k\)-sets and random hulls1994-08-22Paper
Ray shooting in polygons using geodesic triangulations1994-08-10Paper
On joints in arrangements of lines in space and related problems1994-08-09Paper
Computing the smallest \(k\)-enclosing circle and related problems1994-08-03Paper
Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines1994-08-03Paper
Extremal polygon containment problems1994-07-21Paper
On the sum of squares of cell complexities in hyperplane arrangements1994-06-06Paper
An improved technique for output-sensitive hidden surface removal1994-05-05Paper
Fat Triangles Determine Linearly Many Holes1994-04-27Paper
Computing a Segment Center for a Planar Point Set1994-04-20Paper
Computing a Face in an Arrangement of Line Segments and Related Problems1994-02-24Paper
An invariant property of balls in arrangements of hyperplanes1994-01-19Paper
Optimal slope selection via expanders1993-11-15Paper
Tail estimates for the efficiency of randomized incremental algorithms for line segment intersection1993-11-01Paper
https://portal.mardi4nfdi.de/entity/Q31389811993-10-20Paper
https://portal.mardi4nfdi.de/entity/Q31389821993-10-20Paper
Counting Circular Arc Intersections1993-10-10Paper
Diameter, width, closest line pair, and parametric searching1993-09-30Paper
CIRCULAR VISIBILITY FROM A POINT IN A SIMPLE POLYGON1993-08-22Paper
Selecting distances in the plane1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40366021993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374031993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374341993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40387081993-05-18Paper
On the Zone Theorem for Hyperplane Arrangements1993-05-17Paper
The upper envelope of Voronoi surfaces and its applications1993-05-16Paper
Efficient hidden surface removal for objects with small union size1993-05-16Paper
On the zone of a surface in a hyperplane arrangement1993-05-16Paper
Circle Shooting in a Simple Polygon1993-05-16Paper
The number of edges of many faces in a line segment arrangement1993-01-17Paper
Quasi-optimal upper bounds for simplex range searching and new zone theorems1993-01-17Paper
Applications of a new space-partitioning technique1992-12-14Paper
Off-line dynamic maintenance of the width of a planar point set1992-09-27Paper
Counting and cutting cycles of lines and rods in space1992-09-27Paper
Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom1992-09-27Paper
Finding effective ``Force targets for two-dimensional, multifinger frictional grips1992-08-13Paper
On disjoint concave chains in arrangements of (pseudo) lines1992-06-28Paper
Arrangements of curves in the plane --- topology, combinatorics, and algorithms1992-06-28Paper
Randomized incremental construction of Delaunay and Voronoi diagrams1992-06-28Paper
Repeated angles in the plane and related problems1992-06-28Paper
Efficient Motion Planning for an L-Shaped Object1992-06-28Paper
A simple output-sensitive algorithm for hidden surface removal1992-06-28Paper
A singly exponential stratification scheme for real semi-algebraic varieties and its applications1992-06-26Paper
On \(k\)-sets in arrangements of curves and surfaces1992-06-26Paper
Tight bounds on a problem of lines and intersections1992-06-25Paper
Points and triangles in the plane and halving planes in space1992-06-25Paper
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm1992-06-25Paper
Merging visibility maps1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33597931991-01-01Paper
The complexity and construction of many faces in arrangements of lines and of segments1990-01-01Paper
The complexity of many cells in arrangements of planes and related problems1990-01-01Paper
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-21990-01-01Paper
Storing line segments in partition trees1990-01-01Paper
Combinatorial complexity bounds for arrangements of curves and spheres1990-01-01Paper
An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space1990-01-01Paper
On the two-dimensional Davenport-Schinzel problem1990-01-01Paper
Triangles in space or building (and analyzing) castles in the air1990-01-01Paper
An algorithm for generalized point location and its applications1990-01-01Paper
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection1990-01-01Paper
Computing the geodesic center of a simple polygon1989-01-01Paper
The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis1989-01-01Paper
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences1989-01-01Paper
The upper envelope of piecewise linear functions: Algorithms and applications1989-01-01Paper
On the general motion-planning problem with two degrees of freedom1989-01-01Paper
On arrangements of Jordan arcs with three intersections per pair1989-01-01Paper
Implicitly representing arrangements of lines or segments1989-01-01Paper
A note on the Papadimitriou-Silverberg algorithm for planning optimal piecewise-linear motion of a ladder1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34812161989-01-01Paper
Planar realizations of nonlinear Davenport-Schinzel sequences by segments1988-01-01Paper
Separating two simple polygons by a sequence of translations1988-01-01Paper
Computing the link center of a simple polygon1988-01-01Paper
The shortest watchtower and related problems for polyhedral terrains1988-01-01Paper
Improved lower bounds on the length of Davenport-Schinzel sequences1988-01-01Paper
A survey of motion planning and related geometric algorithms1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952191988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967501988-01-01Paper
On the shortest paths between two convex polyhedra1988-01-01Paper
Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams1987-01-01Paper
Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram1987-01-01Paper
Almost linear upper bounds on the length of general Davenport-Schinzel sequences1987-01-01Paper
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons1987-01-01Paper
A new efficient motion-planning algorithm for a rod in two-dimensional polygonal space1987-01-01Paper
On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30283781987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34795431987-01-01Paper
On Shortest Paths Amidst Convex Polyhedra1987-01-01Paper
On k-Hulls and Related Problems1987-01-01Paper
An efficient and simple motion planning algorithm for a ladder amidst polygonal barriers1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38320911987-01-01Paper
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles1986-01-01Paper
Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes1986-01-01Paper
Probabilistic propositional temporal logics1986-01-01Paper
Generalized voronoi diagrams for moving a ladder. I: Topological analysis1986-01-01Paper
On Shortest Paths in Polyhedral Spaces1986-01-01Paper
Intersection and Closest-Pair Problems for a Set of Planar Discs1985-01-01Paper
Concurrent Probabilistic Programs, Or: How to Schedule If You Must1985-01-01Paper
On the piano movers' problem: V. The case of a rod moving in three-dimensional space amidst polyhedral obstacles1984-01-01Paper
Verification of Probabilistic Programs1984-01-01Paper
On the Piano Movers' problem: IV. Various decomposable two-dimensional motion-planning problems1984-01-01Paper
On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds1983-01-01Paper
Termination of Probabilistic Concurrent Program1983-01-01Paper
On the “piano movers'” problem I. The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36740521983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37213141983-01-01Paper
Experience with the SETL Optimizer1983-01-01Paper
Some modified algorithms for Dijkstra's longest upsequence problem1982-01-01Paper
Fast composition of sparse maps1982-01-01Paper
Some Observations Concerning Formal Differentiation of Set Theoretic Expressions1982-01-01Paper
Transformational Derivation of a Garbage Collection Algorithm1982-01-01Paper
A strong-connectivity algorithm and its applications in data flow analysis1981-01-01Paper
A strange sorting method inspired by formal differentiation1981-01-01Paper
An Automatic Technique for Selection of Data Representations in SETL Programs1981-01-01Paper
Formal integration: A program transformation technique1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39221561981-01-01Paper
Structural analysis: A new approach to flow analysis in optimizing compilers1980-01-01Paper
A new proof of the Maurey-Pisier theorem1979-01-01Paper
Shrinking Minimal Systems and Complementation oflpnSpaces in Reflexive Banach Spaces1979-01-01Paper
A non-nice extreme operator1977-01-01Paper
A counterexample on extreme operators1976-01-01Paper
Extremal structure in operator spaces1974-01-01Paper
A Note on Extreme Elements in A 0 (K, E)1974-01-01Paper
Characterization and properties of extreme operators into C(Y)1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56348211971-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: Micha Sharir