Folgen
Micha Sharir
Micha Sharir
Bestätigte E-Mail-Adresse bei tauex.tau.ac.il
Titel
Zitiert von
Zitiert von
Jahr
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
12331983
Davenport-Schinzel sequences and their geometric applications
M Sharir
Theoretical Foundations of Computer Graphics and CAD, 253-278, 1988
11641988
Two approaches to interprocedural data flow analysis
M Sharir, A Pnueli
New York University. Courant Institute of Mathematical Sciences …, 1978
11601978
Randomized incremental construction of Delaunay and Voronoi diagrams
LJ Guibas, DE Knuth, M Sharir
Algorithmica 7 (1-6), 381-413, 1992
9381992
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
7921986
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
7841983
On the existence and synthesis of multifinger positive grips
B Mishra, JT Schwartz, M Sharir
Algorithmica 2 (1-4), 541-558, 1987
6251987
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
5971984
On shortest paths in polyhedral spaces
M Sharir (, A Schorr
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
5631984
Motion planning in the presence of moving obstacles
J Reif, M Sharir
Journal of the ACM (JACM) 41 (4), 764-790, 1994
5101994
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
4841992
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
4531986
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
4391990
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
3941983
A strong-connectivity algorithm and its applications in data flow analysis
M Sharir
Computers & Mathematics with Applications 7 (1), 67-72, 1981
3891981
Nonlinearity of Davenport—Schinzel sequences and of generalized path compression schemes
S Hart, M Sharir
Combinatorica 6 (2), 151-177, 1986
3621986
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
3611987
Efficient algorithms for geometric optimization
PK Agarwal, M Sharir
ACM Computing Surveys (CSUR) 30 (4), 412-458, 1998
3551998
Arrangements and their applications
PK Agarwal, M Sharir
Handbook of computational geometry, 49-119, 2000
3012000
Filling gaps in the boundary of a polyhedron
G Barequet, M Sharir
Computer Aided Geometric Design 12 (2), 207-229, 1995
2901995
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20