M. Sharir
M. Sharir
Bookitis has not yet captured a biography for this author, but the catalog links below show the books currently associated with this profile.
Overview
Catalog identity and bibliographic footprint for this author.
Catalog identity
How this author appears inside the active Bookitis catalog.
Display name
Personal name
Source identifier
Featured books
Representative editions for works actually authored by this person.
- Image source: Open LibrarySU
Sharp upper and lower bounds on the length of general Davenport- Schinzel sequences
cover - Image source: Open LibraryCT
Computing the geodesic center of a simple polygon
cover - Image source: Open LibraryST
Separating two simple polygons by a sequence of translations
cover - Image source: Open LibraryOS
On shortest paths between two convex polyhedra
cover - Image source: Open LibrarySO
Some observations concerning formal differentiation of set-theoretic expressions
cover - SAStructural AnalysisM. Sharir
Structural Analysis
no cover - IOIdentification of Partially Obs...M. Sharir
Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy 'characteristic Curves, '
no cover - OTOn the Complexity of Motion Pla...M. Sharir
On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem
no cover - EMEfficient Motion Planning Algor...M. Sharir
Efficient Motion Planning Algorithm for a Convex Polygonal Object in 2-Dimensional Polygonal Space
no cover - GVGeneralized Voronoi Diagrams fo...M. Sharir
Generalized Voronoi Diagrams for Moving a Ladder
no cover - UEUpper Envelope of Piecewise Lin...M. Sharir
Upper Envelope of Piecewise Linear Functions
no cover
Works in catalog
Quick navigation into the work-level grouping pages behind the featured books.
- Open Work
Sharp upper and lower bounds on the length of general Davenport- Schinzel sequences
- Open Work
Computing the geodesic center of a simple polygon
- Open Work
Separating two simple polygons by a sequence of translations
- Open Work
On shortest paths between two convex polyhedra
- Open Work
Some observations concerning formal differentiation of set-theoretic expressions
- Open Work
Structural Analysis
- Open Work
Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy 'characteristic Curves, '
- Open Work
On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem
- Open Work
Efficient Motion Planning Algorithm for a Convex Polygonal Object in 2-Dimensional Polygonal Space
- Open Work
Generalized Voronoi Diagrams for Moving a Ladder
- Open Work
Upper Envelope of Piecewise Linear Functions