M Sharir

18 books

Aug 6, 2018
Cover of A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications (Classic Reprint)

A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis Applications (Classic Reprint)

Feb 14, 2015
Cover of Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy 'Characteristic Curves, ' - Scholar's Choice Edition

Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy 'Characteristic Curves, ' - Scholar's Choice Edition

Jan 5, 2014
Cover of On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem - Primary Source Edition

On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem - Primary Source Edition

Sep 11, 2011
Cover of Structural Analysis

Structural Analysis

Sep 11, 2011
Cover of Precise Implementation of CAD Primitives Using Rational Parametrizations of Standard Surfaces

Precise Implementation of CAD Primitives Using Rational Parametrizations of Standard Surfaces

Sep 11, 2011
Cover of A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis

A Strong-Connectivity Algorithm and Its Applications in Data Flow Analysis

Sep 8, 2011
Cover of On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in 2-D Polygonal Space

On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in 2-D Polygonal Space

Sep 8, 2011
Cover of On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem

On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem

Sep 8, 2011
Cover of On the Existence and Synthesis of Multifinger Positive Grips

On the Existence and Synthesis of Multifinger Positive Grips

Sep 8, 2011
Cover of On Shortest Paths Between Two Convex Polyhedra

On Shortest Paths Between Two Convex Polyhedra

Sep 5, 2011
Cover of Motion Planning and Related Geometric Algorithms in Robotics

Motion Planning and Related Geometric Algorithms in Robotics

Sep 5, 2011
Cover of Separating Two Simple Polygons by a Sequence of Translations

Separating Two Simple Polygons by a Sequence of Translations

Sep 3, 2011
Cover of Some Observations Concerning Formal Differentiation of Set-Theoretic Expressions

Some Observations Concerning Formal Differentiation of Set-Theoretic Expressions

Aug 30, 2011
Cover of Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons

Aug 25, 2011
Cover of An Efficient Motion Planning Algorithm for a Convex Polygonal Object in 2-Dimensional Polygonal Space

An Efficient Motion Planning Algorithm for a Convex Polygonal Object in 2-Dimensional Polygonal Space

Aug 25, 2011
Cover of Efficient Motion Planning for an L-Shaped Object

Efficient Motion Planning for an L-Shaped Object

Aug 21, 2011
Cover of Computing the Geodesic Center of a Simple Polygon

Computing the Geodesic Center of a Simple Polygon

Aug 19, 2011
Cover of Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy 'characteristic Curves, '

Identification of Partially Obscured Objects in Two Dimensions by Matching of Noisy 'characteristic Curves, '