Follow
Micha Sharir
Micha Sharir
Verified email at tauex.tau.ac.il
Title
Cited by
Cited by
Year
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
11381983
Davenport-Schinzel sequences and their geometric applications
M Sharir, M ŠārÓr, PK Agarwal
Cambridge university press, 1995
10961995
Two approaches to interprocedural data flow analysis
M Sharir, A Pnueli
New York University. Courant Institute of Mathematical Sciences†…, 1978
10831978
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
7491987
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
7381983
Randomized incremental construction of Delaunay and Voronoi diagrams
LJ Guibas, DE Knuth, M Sharir
Algorithmica 7 (1), 381-413, 1992
7351992
On the existence and synthesis of multifinger positive grips
B Mishra, JT Schwartz, M Sharir
Algorithmica 2 (1), 541-558, 1987
6151987
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
5641984
On shortest paths in polyhedral spaces
M Sharir, A Schorr
SIAM Journal on Computing 15 (1), 193-215, 1986
5291986
Motion planning in the presence of moving obstacles
J Reif, M Sharir
Journal of the ACM (JACM) 41 (4), 764-790, 1994
4751994
A subexponential bound for linear programming
J Matoušek, M Sharir, E Welzl
Algorithmica 16 (4), 498-516, 1996
4601996
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
4451986
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
4231990
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
3761983
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
3551987
Nonlinearity of Davenport—Schinzel sequences and of generalized path compression schemes
S Hart, M Sharir
Combinatorica 6 (2), 151-177, 1986
3551986
Efficient algorithms for geometric optimization
PK Agarwal, M Sharir
ACM Computing Surveys (CSUR) 30 (4), 412-458, 1998
3441998
A strong-connectivity algorithm and its applications in data flow analysis
M Sharir
Computers & Mathematics with Applications 7 (1), 67-72, 1981
3411981
Arrangements and their applications
PK Agarwal, M Sharir
Handbook of computational geometry, 49-119, 2000
2962000
Filling gaps in the boundary of a polyhedron
G Barequet, M Sharir
Computer Aided Geometric Design 12 (2), 207-229, 1995
2741995
The system can't perform the operation now. Try again later.
Articles 1–20