Sharir, Micha.
Sharir, Micha, 1950-....
Å Ärîr, MîkÄ 1950-
×××× ×©×¨×ר פר×פס×ר ××××¢× ××××©× ×××× ××רס××ת ×ª× ××××
שר×ר, ××××
VIAF ID: 48250087 (Personal)
Permalink: http://viaf.org/viaf/48250087
Preferred Forms
-
200 _ | ââ¡a Sharirâ ââ¡b Michaâ ââ¡f 1950-....â
-
-
-
-
-
-
100 1 _ ââ¡a Sharir, Michaâ
-
100 1 0 ââ¡a Sharir, Michaâ
-
-
100 | _ ââ¡a Sharir, Micha,â ââ¡d 1950-....â
-
-
100 1 _ ââ¡a SÌaÌriÌr, MiÌkaÌâ ââ¡d 1950-â
-
100 1 _ ââ¡a ŠÄrîr, MîkÄâ ââ¡d 1950-â
-
100 0 _ ââ¡a ×××× ×©×¨×רâ ââ¡c פר×פס×ר ××××¢× ××××©× ×××× ××רס××ת ×ª× ××××â
-
Â
Â
Â
Â
4xx's: Alternate Name Forms (14)
Works
Title | Sources |
---|---|
Algorithmic motion planning in robotics |
![]() |
Algorithms for center and Tverberg points |
![]() |
Applications of a New Space-Partitioning Technique |
![]() |
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres |
![]() |
Combinatorial geometry and its algorithmic applications : The Alcalá lectures |
![]() ![]() ![]() ![]() ![]() ![]() |
The complexity of many faces in arrangements of lines and segments |
![]() ![]() ![]() |
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique |
![]() |
Davenport-Schinzel sequences and their geometric applications |
![]() ![]() ![]() ![]() ![]() |
A design for optimizations ... 1979(hdg. on InU rept.: Sharir, M.; usage: M. Sharir) |
![]() ![]() |
The Discrete 2-Center Problem |
![]() |
Discrete and Computational Geometry : The Goodman-Pollack Festschrift |
![]() |
Efficient hidden surface removal for objects with small union size |
![]() |
Efficient motion planning for an L-shaped object |
![]() |
Extreme operators between Banach spaces. |
![]() |
Fat Triangles Determine Linearly Many Holes |
![]() |
Improved Bounds on Weak epsilon-Nets for Convex Sets |
![]() |
An improved technique for output-sensitive hidden surface removal |
![]() |
Merging visibility maps |
![]() |
On degrees in random triangulations of point sets |
![]() |
On the Number of Crossing-Free Matchings, Cycles, and Partitions |
![]() |
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles |
![]() |
Online Conflict-Free Coloring for Intervals |
![]() |
The overlay of lower envelopes and its applications |
![]() |
Planning, geometry, and complexity of robot motion, 1986: |
![]() ![]() |
Point-Line Incidences in Space |
![]() |
Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems |
![]() |
Ray shooting, implicit point location, and related queries in arrangements of segments |
![]() |
Storing line segments in partition trees |
![]() |
subexponential bound for linear programming |
![]() ![]() |
Tail estimates for the space complexity of randomized incremental algorithms |
![]() ![]() |
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions |
![]() |
website, viewed October 26, 2017 |
![]() |
××פר××ר×× ×§×צ×× ××× ××× ×ר××× ×× × |
![]() |