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
12501983
Davenport-Schinzel sequences and their geometric applications
M Sharir
Theoretical Foundations of Computer Graphics and CAD, 253-278, 1995
12011995
Two approaches to interprocedural data flow analysis
M Pnueli, M Sharir
Program flow analysis: theory and applications, 189-234, 1981
11571981
Randomized incremental construction of Delaunay and Voronoi diagrams
LJ Guibas, DE Knuth, M Sharir
Algorithmica 7 (1), 381-413, 1992
9521992
Linear time algorithms for visibility and shortest path problems inside simple polygons
L Guibas, J Hershberger, D Leven, M Sharir, R Tarjan
Proceedings of the second annual symposium on computational geometry, 1-13, 1986
8051986
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
7911983
On the existence and synthesis of multifinger positive grips
B Mishra, JT Schwartz, M Sharir
Algorithmica 2 (1), 541-558, 1987
6271987
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
6071984
On shortest paths in polyhedral spaces
M Sharir (, A Schorr
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
5671984
Motion planning in the presence of moving obstacles
J Reif, M Sharir
Journal of the ACM (JACM) 41 (4), 764-790, 1994
5191994
A subexponential bound for linear programming
J Matoušek, M Sharir, E Welzl
Proceedings of the eighth annual symposium on Computational geometry, 1-8, 1992
4981992
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, 59-71, 1986
4671986
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
4441990
A strong-connectivity algorithm and its applications in data flow analysis
M Sharir
Computers & Mathematics with Applications 7 (1), 67-72, 1981
4171981
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
4001983
Nonlinearity of Davenport—Schinzel sequences and of generalized path compression schemes
S Hart, M Sharir
Combinatorica 6 (2), 151-177, 1986
3741986
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
3681987
Efficient algorithms for geometric optimization
PK Agarwal, M Sharir
ACM Computing Surveys (CSUR) 30 (4), 412-458, 1998
3651998
Arrangements and their applications
PK Agarwal, M Sharir
Handbook of computational geometry, 49-119, 2000
3032000
Arrangements
D Halperin, M Sharir
Handbook of discrete and computational geometry, 723-762, 2017
2932017
The system can't perform the operation now. Try again later.
Articles 1–20