World's Best Scientists 2026 revealed!
Award Badge
Computer Science
Israel
2026
Award Badge
Mathematics
Israel
2026

D-Index & Metrics

Computer Science

D-Index
96
Citations
36200
World Ranking
439
National Ranking
10

Mathematics

D-Index
96
Citations
36168
World Ranking
57
National Ranking
2

Research.com Recognitions

  • 2026 - Research.com Computer Science in Israel Leader Award
  • 2026 - Research.com Mathematics in Israel Leader Award
  • 2025 - Research.com Computer Science in Israel Leader Award
  • 2025 - Research.com Mathematics in Israel Leader Award
  • 2023 - Research.com Computer Science in Israel Leader Award
  • 2023 - Research.com Mathematics in Israel Leader Award
  • 2022 - Research.com Computer Science in Israel Leader Award
  • 1997 - ACM Fellow Algorithmic motion planning; properties of Davenport-Schinzel sequences and their applications in computiational geometry; arrangements of surfaces and their relevance to geometric algorithms; subexpotential randomized (combinatorial) algorithm for linear programming.

Overview

Micha Sharir is affiliated with Tel Aviv University in Israel and has contributed extensively to the field of computer science, with a primary focus on computational geometry and related areas. Their work spans over multiple subfields including computer graphics and computer-aided design, computational theory and mathematics, computer vision and pattern recognition, signal processing, and industrial and manufacturing engineering.

The scientist's research topics reflect a breadth of interests centered around computational geometry and mesh generation, data management and algorithms, and digital image processing techniques. Additional key topics include complexity and algorithms in graphs, robotic path planning algorithms, polynomial and algebraic computation, and point processes and geometric inequalities.

Micha Sharir's publication record includes papers in prominent venues such as arXiv (Cornell University), Discrete & Computational Geometry, Leibniz-Zentrum für Informatik (Schloss Dagstuhl), Computational Geometry, and Discrete Mathematics. Their notable recent papers include:

  • Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications, 2020, Refubium (Universitätsbibliothek der Freien Universität Berlin)
  • Stabbing pairwise intersecting disks by five points, 2021, Discrete Mathematics
  • Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems, 2022, Discrete & Computational Geometry
  • On Radial Isotropic Position: Theory and Algorithms, 2020, arXiv (Cornell University)
  • How to Find a Point in the Convex Hull Privately, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Micha Sharir has co-authored extensively with several researchers. The most frequent collaborators include Esther Ezra, Haim Kaplan, Pankaj K. Agarwal, Dan Halperin, and Boris Aronov. This pattern of collaboration highlights a networked research approach within computational geometry and related algorithmic fields.

The scientist's contributions have been recognized by peers, including the award of ACM Fellow in 1997. The award citation highlights work in algorithmic motion planning, properties of Davenport-Schinzel sequences and their applications in computational geometry, arrangements of surfaces relevant to geometric algorithms, and development of subexponential randomized combinatorial algorithms for linear programming.

Best Publications

  • On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds

    Jacob T Schwartz;Micha Sharir

  • Davenport-Schinzel sequences and their geometric applications

    Micha Sharir;Pankaj K. Agarwal

  • Two approaches to interprocedural data flow analysis

    Micha Sharir;A Pnueli

  • Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

    Leonidas J. Guibas;John Hershberger;Daniel Leven;Micha Sharir;Micha Sharir

  • Randomized incremental construction of Delaunay and Voronoi diagrams

    Leonidas J. Guibas;Donald E. Knuth;Micha Sharir;Micha Sharir

  • On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers

    Jacob T. Schwartz;Micha Sharir

  • On the existence and synthesis of multifinger positive grips

    Bhubaneswar Mishra;Jacob T. Schwartz;Micha Sharir;Micha Sharir

  • Linear time algorithms for visibility and shortest path problems inside simple polygons

    L Guibas;J Hershberger;D Leven;M Sharir

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

    J.E. Hopcroft;J.T. Schwartz;M. Sharir

  • On shortest paths in polyhedral spaces

    Micha Sharir;Amir Schorr

  • A subexponential bound for linear programming

    Jirí Matousek;Micha Sharir;Micha Sharir;Emo Welzl

  • Motion planning in the presence of moving obstacles

    John Reif;Micha Sharir

  • On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles

    Klara Kedem;Ron Livne;János Pach;Micha Sharir

  • Combinatorial complexity bounds for arrangements of curves and spheres

    Kenneth L. Clarkson;Herbert Edelsbrunner;Leonidas J. Guibas;Micha Sharir

  • On the piano movers' problem: III. Coordinating the motion of several independent bodies: the special case of circular bodies moving amidst polygonal barriers

    Jacob T. Schwartz;Micha Sharir

  • Efficient algorithms for geometric optimization

    Pankaj K. Agarwal;Micha Sharir

  • Identification of partially obscured objects in two and three dimensions by matching noisy characteristic

    Jacob T. Schwartz;Micha Sharir

  • Nonlinearity of Daveport:80Schinzel sequences and of generalized path compression schemes

    S Hart;M Sharir

  • Arrangements and Their Applications

    Pankaj K. Agarwal;Micha Sharir

  • Filling gaps in the boundary of a polyhedron

    Gill Barequet;Micha Sharir;Micha Sharir

  • On Shortest Paths in Polyhedral Spaces

    Micha Sharir;Amir Schorr

Frequent Co-Authors

Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
Haim Kaplan
Haim Kaplan Tel Aviv University
Boris Aronov
Boris Aronov New York University
János Pach
János Pach Alfréd Rényi Institute of Mathematics
Leonidas J. Guibas
Leonidas J. Guibas Stanford University
Herbert Edelsbrunner
Herbert Edelsbrunner Institute of Science and Technology Austria
Emo Welzl
Emo Welzl ETH Zurich
Dan Halperin
Dan Halperin Tel Aviv University
Bernard Chazelle
Bernard Chazelle Princeton University
Alon Efrat
Alon Efrat University of Arizona

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring a Mathematics degree in the USA opens doors to diverse career paths and further academic opportunities. Many students enhance their qualifications through online programs that combine analytical skills with business acumen. For instance, professionals aiming to deepen leadership capacities can consider a 1 year dba program online, designed for fast-tracking executive expertise.

Finance is another promising area closely related to Mathematics. Those interested in cost-effective options might explore the cheapest online master's in finance, which offers strong potential for lucrative careers in financial analysis and risk management.

For students focused on leadership roles in diverse industries, the fastest mba online programs provide an accelerated path to earning an MBA, allowing a quicker transition into management positions.

Marketing is yet another attractive option for math-savvy individuals seeking practical skills. The cheapest online marketing degree programs combine affordability with strong earning potential, ideal for those aiming to specialize in data-driven marketing strategies.

Best Scientists Citing Micha Sharir

Trending Scientists