Voronoi Diagrams on Planar Graphs and Computing the Diameter in Deterministic Õ(n5/3) time Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir and Oren Weimann

Source URL: www.cs.haifa.ac.il

Point-Line Incidences in Space ∗ Micha Sharir†

Source URL: www.math.tau.ac.il

Polygonal Approximation of a Jordan Curve Micha Sharir and... May 19, 2002

Source URL: www.math.tau.ac.il

Efficient Algorithms for Geometric Optimization∗† Pankaj K. Agarwal ‡ Micha Sharir

Source URL: www.math.tau.ac.il

Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem Micha Sharir∗ Emo Welzl†

Source URL: www.math.tau.ac.il

• Geometry
• Triangle geometry
• Triangle
• Mathematics
• Elementary mathematics
• Triangles
• Area
• Circles

The Partition Technique for Overlays of Envelopes∗ Vladlen Koltun† Micha Sharir‡ Abstract

Source URL: www.math.tau.ac.il

• Mathematics
• Analysis of algorithms
• Discrete mathematics
• Number theory
• Mathematical analysis
• Combinatorics
• Partition
• Time complexity
• E-function
• Big O notation

Cutting Triangular Cycles of Lines in Space∗ Boris Aronov† Vladlen Koltun‡ Micha Sharir§

Source URL: www.math.tau.ac.il

• Permutation
• G-code

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Source URL: www.math.tau.ac.il

• Computational complexity theory
• Theory of computation
• Analysis of algorithms
• NP-complete problems
• Set cover problem
• Randomized algorithm
• Time complexity
• Minimum spanning tree
• Point location