What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Algorithm
Micha Sharir spends much of his time researching Combinatorics, Discrete mathematics, Computational geometry, Upper and lower bounds and Plane.
Specifically, his work in Combinatorics is concerned with the study of Randomized algorithm.
His research integrates issues of Range searching, Voronoi diagram, Inverse and Hidden surface determination in his study of Discrete mathematics.
His work carried out in the field of Computational geometry brings together such families of science as Polyhedron, Closest pair of points problem, Face, Simple and Theory of computation.
The concepts of his Upper and lower bounds study are interwoven with issues in Ackermann function, Degree and Regular polygon.
Micha Sharir interconnects Binary logarithm, Family of curves and Time complexity in the investigation of issues within Plane.
His most cited work include:
- Davenport–Schinzel Sequences and their Geometric Applications (869 citations)
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds (731 citations)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (465 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Combinatorics, Discrete mathematics, Plane, Set and Upper and lower bounds.
His Combinatorics research focuses on Regular polygon and how it relates to Disjoint sets and Boundary.
His work deals with themes such as Simple, Hyperplane and Algebraic number, which intersect with Discrete mathematics.
His Plane research integrates issues from Time complexity, Line, Binary logarithm and Unit.
His Computational geometry study improves the overall literature in Algorithm.
Micha Sharir works mostly in the field of Algorithm, limiting it down to concerns involving Motion planning and, occasionally, Motion.
He most often published in these fields:
- Combinatorics (92.36%)
- Discrete mathematics (42.16%)
- Plane (26.61%)
What were the highlights of his more recent work (between 2013-2021)?
- Combinatorics (92.36%)
- Discrete mathematics (42.16%)
- Plane (26.61%)
In recent papers he was focusing on the following fields of study:
Micha Sharir mostly deals with Combinatorics, Discrete mathematics, Plane, Set and Degree.
Micha Sharir is studying Discrete geometry, which is a component of Combinatorics.
The various areas that Micha Sharir examines in his Discrete mathematics study include Quadratic equation and Constant.
His Plane study integrates concerns from other disciplines, such as Structure, Point, Unit and Line.
His research in Degree intersects with topics in Kinetic data structure, Delaunay triangulation, Algebraic variety, Surface and Variety.
His study in Algebraic number is interdisciplinary in nature, drawing from both Simple, Computational geometry and Bounded function.
Between 2013 and 2021, his most popular works were:
- Visibility Problems for Polyhedral Terrains (161 citations)
- Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences (154 citations)
- Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences (154 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Algorithm
His primary areas of investigation include Combinatorics, Discrete mathematics, Plane, Polynomial and Computational geometry.
His study in Combinatorics focuses on Discrete geometry in particular.
His Discrete mathematics research incorporates themes from Intersection, Algebraic geometry, Family of curves, Rectangle and Data structure.
His studies examine the connections between Plane and genetics, as well as such issues in Unit, with regards to Conjecture, Combinatorial mathematics and Computational complexity theory.
His Computational geometry research includes elements of Disjoint sets, Motion, Ackermann function and Regular polygon.
His work on Edit distance as part of general Algorithm study is frequently linked to Vertical segment, therefore connecting diverse disciplines of science.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
