( en | de | ru )

 

Disambiguation of "Sharir, Micha"

Author of the publication

copydeleteadd this publication to your clipboard
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.

, , and . Algorithmica, (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Micha Mleczko

Micha Hoffmann

Micha Mleczko

Micha Deja

Micha Brumlik

 

Other publications of authors with the same name

Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy., and . ESA, volume 87 of LIPIcs, page 42:1-42:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points., , and . ESA, volume 87 of LIPIcs, page 52:1-52:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)An Invariant Property of Balls in Arrangements of Hyperplanes., , , and . Discret. Comput. Geom., (1993)Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions., and . Discret. Comput. Geom., 14 (4): 385-410 (1995)On the Number of Views of Polyhedral Terrains., and . Discret. Comput. Geom., (1994)Finding the largest disk containing a query point in logarithmic time with linear storage., and . J. Comput. Geom., 6 (2): 3-18 (2015)Arrangements of Curves and Surfaces in Computational Geometry.. ISTCS, page 44-50. IEEE Computer Society, (1996)Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions., , , , and . SODA, page 197-204. ACM/SIAM, (1995)Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions., and . CoRR, (2015)Counting Plane Graphs: Flippability and Its Applications., , , , and . WADS, volume 6844 of Lecture Notes in Computer Science, page 524-535. Springer, (2011)