Micha Sharir
Micha Sharir
Verified email at tauex.tau.ac.il
Cited by
Cited by
Handbook of discrete and computational geometry
CD Toth, J O'Rourke, JE Goodman
CRC press, 2017
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
JT Schwartz, M Sharir
Advances in applied Mathematics 4 (3), 298-351, 1983
Davenport-Schinzel sequences and their geometric applications
M Sharir, M ŠārÓr, PK Agarwal
Cambridge university press, 1995
Two approaches to interprocedural data flow analysis
M Sharir, A Pnueli
New York University. Courant Institute of Mathematical Sciences†…, 1978
Shortest path algorithms: an evaluation using real road networks
FB Zhan, CE Noon
Transportation science 32 (1), 65-73, 1998
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
L Guibas, J Hershberger, D Leven, M Sharir, RE Tarjan
Algorithmica 2 (1), 209-233, 1987
On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers
JT Schwartz, M Sharir
Communications on pure and applied mathematics 36 (3), 345-398, 1983
Randomized incremental construction of Delaunay and Voronoi diagrams
LJ Guibas, DE Knuth, M Sharir
Algorithmica 7 (1), 381-413, 1992
On the existence and synthesis of multifinger positive grips
B Mishra, JT Schwartz, M Sharir
Algorithmica 2 (1), 541-558, 1987
On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE-Hardness of the" Warehouseman's Problem"
JE Hopcroft, JT Schwartz, M Sharir
The International Journal of Robotics Research 3 (4), 76-88, 1984
On shortest paths in polyhedral spaces
M Sharir, A Schorr
SIAM Journal on Computing 15 (1), 193-215, 1986
Motion planning in the presence of moving obstacles
J Reif, M Sharir
Journal of the ACM (JACM) 41 (4), 764-790, 1994
A subexponential bound for linear programming
J Matoušek, M Sharir, E Welzl
Algorithmica 16 (4), 498-516, 1996
On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
K Kedem, R Livne, J Pach, M Sharir
Discrete & Computational Geometry 1 (1), 59-71, 1986
Combinatorial complexity bounds for arrangements of curves and spheres
KL Clarkson, H Edelsbrunner, LJ Guibas, M Sharir, E Welzl
Discrete & Computational Geometry 5 (2), 99-160, 1990
On the piano movers' problem: III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers
JT Schwartz, M Sharir
The International Journal of Robotics Research 2 (3), 46-75, 1983
Nonlinearity of Davenport—Schinzel sequences and of generalized path compression schemes
S Hart, M Sharir
Combinatorica 6 (2), 151-177, 1986
Identification of partially obscured objects in two and three dimensions by matching noisy characteristic curves
JT Schwartz, M Sharir
The International Journal of Robotics Research 6 (2), 29-44, 1987
Efficient algorithms for geometric optimization
PK Agarwal, M Sharir
ACM Computing Surveys (CSUR) 30 (4), 412-458, 1998
Range image segmentation based on differential geometry: A hybrid approach
N Yokoya, MD Levine
IEEE Transactions on Pattern Analysis and Machine Intelligence 11 (6), 643-649, 1989
The system can't perform the operation now. Try again later.
Articles 1–20