Micha Sharir

Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir: The 2-center problem in three dimensions. Comput. Geom. 46(6): 734-746 (2013)

Micha Sharir, Adam Sheffer, Emo Welzl: Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory, Ser. A 120(4): 777-794 (2013)

Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir: Computing the Discrete Fréchet Distance in Subquadratic Time. SODA 2013: 156-167

Dror Aiger, Haim Kaplan, Micha Sharir: Reporting neighbors in high-dimensional Euclidean spaces. SODA 2013: 784-803

Micha Sharir, Adam Sheffer: Distinct distances on two lines. CoRR abs/1302.3081 (2013)

Pankaj K. Agarwal, Esther Ezra, Micha Sharir: Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica 63(1-2): 1-25 (2012)

Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir: Unit Distances in Three Dimensions. Combinatorics, Probability & Computing 21(4): 597-610 (2012)

Haim Kaplan, Jirí Matousek, Micha Sharir: Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discrete & Computational Geometry 48(3): 499-517 (2012)

Natan Rubin, Haim Kaplan, Micha Sharir: Improved Bounds for Geometric Permutations. SIAM J. Comput. 41(2): 367-390 (2012)

Micha Sharir, Adam Sheffer, Emo Welzl: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. Symposium on Computational Geometry 2012: 189-198

Haim Kaplan, Micha Sharir: Finding the maximal empty disk containing a query point. Symposium on Computational Geometry 2012: 287-292

Pankaj K. Agarwal, Jirí Matousek, Micha Sharir: On Range Searching with Semialgebraic Sets II. FOCS 2012: 420-429

Micha Sharir, Adam Sheffer: Counting Plane Graphs: Cross-Graph Charging Schemes. Graph Drawing 2012: 19-30

Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir: Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. SODA 2012: 338-355

Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir: Computing the Discrete Fréchet Distance in Subquadratic Time. CoRR abs/1204.5333 (2012)

Micha Sharir, Adam Sheffer, Joshua Zahl: Incidences between points and non-coplanar circles. CoRR abs/1208.0053 (2012)

Pankaj K. Agarwal, Jirí Matousek, Micha Sharir: On Range Searching with Semialgebraic Sets II. CoRR abs/1208.3384 (2012)

Micha Sharir, Adam Sheffer: Counting Plane Graphs: Cross-Graph Charging Schemes. CoRR abs/1209.0194 (2012)

Micha Sharir, Adam Sheffer: Counting Triangulations of Planar Point Sets. Electr. J. Comb. 18(1) (2011)

Haim Kaplan, Natan Rubin, Micha Sharir: A kinetic triangulation scheme for moving points in the plane. Comput. Geom. 44(4): 191-205 (2011)

Micha Sharir: An Improved Bound for k-Sets in Four Dimensions. Combinatorics, Probability & Computing 20(1): 119-129 (2011)

Roel Apfelbaum, Micha Sharir: Non-Degenerate Spheres in Three Dimensions. Combinatorics, Probability & Computing 20(4): 503-512 (2011)

György Elekes, Micha Sharir: Incidences in Three Dimensions and Distinct Distances in the Plane. Combinatorics, Probability & Computing 20(4): 571-608 (2011)

Haim Kaplan, Edgar Ramos, Micha Sharir: Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Discrete & Computational Geometry 45(1): 3-33 (2011)

Haim Kaplan, Edgar Ramos, Micha Sharir: The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Discrete & Computational Geometry 45(3): 371-382 (2011)

Sariel Har-Peled, Micha Sharir: Relative (p, ε)-Approximations in Geometry. Discrete & Computational Geometry 45(3): 462-496 (2011)

György Elekes, Haim Kaplan, Micha Sharir: On lines, joints, and incidences in three dimensions. J. Comb. Theory, Ser. A 118(3): 962-977 (2011)

Micha Sharir, Adam Sheffer, Emo Welzl: On degrees in random triangulations of point sets. J. Comb. Theory, Ser. A 118(7): 1979-1999 (2011)

Micha Sharir, Hayim Shaul: Semialgebraic Range Reporting and Emptiness Searching with Applications. SIAM J. Comput. 40(4): 1045-1074 (2011)

Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir: Optimal Cover of Points by Disks in a Simple Polygon. SIAM J. Comput. 40(6): 1647-1661 (2011)

Esther Ezra, Boris Aronov, Micha Sharir: Improved Bound for the Union of Fat Triangles. SODA 2011: 1778-1785

Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl: Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535

Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir: Kinetic Stable Delaunay Graphs. CoRR abs/1104.0622 (2011)

Haim Kaplan, Micha Sharir: Finding the Maximal Empty Rectangle Containing a Query Point. CoRR abs/1106.3628 (2011)

Micha Sharir, Adam Sheffer, Emo Welzl: Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique. CoRR abs/1109.5596 (2011)

Kenneth L. Clarkson, Micha Sharir: Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint). General Books 2010, isbn 978-1-153-46242-6, pp. 1-49

Micha Sharir: Algorithm Derivation by Transformations (reprint). General Books 2010, isbn 978-1-154-60684-3, pp. 1-21

Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu: Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010)

Roel Apfelbaum, Micha Sharir: An Improved Bound on the Number of Unit Area Triangles. Discrete & Computational Geometry 44(4): 753-761 (2010)

Haim Kaplan, Micha Sharir, Eugenii Shustin: On Lines and Joints. Discrete & Computational Geometry 44(4): 838-843 (2010)

Boris Aronov, Micha Sharir: Approximate Halfspace Range Counting. SIAM J. Comput. 39(7): 2704-2725 (2010)

Boris Aronov, Esther Ezra, Micha Sharir: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39(7): 3248-3282 (2010)

Haim Kaplan, Natan Rubin, Micha Sharir: Line Transversals of Convex Polyhedra in R³. SIAM J. Comput. 39(7): 3283-3310 (2010)

Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang: Hausdorff distance under translation for points and balls. ACM Transactions on Algorithms 6(4) (2010)

Ophir Setter, Micha Sharir, Dan Halperin: Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. Transactions on Computational Science 9: 1-27 (2010)

Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir: The 2-center problem in three dimensions. Symposium on Computational Geometry 2010: 87-96

Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir: Kinetic stable Delaunay graphs. Symposium on Computational Geometry 2010: 127-136

Haim Kaplan, Natan Rubin, Micha Sharir: A kinetic triangulation scheme for moving points in the plane. Symposium on Computational Geometry 2010: 137-146

Micha Sharir, Adam Sheffer, Emo Welzl: On degrees in random triangulations of point sets. Symposium on Computational Geometry 2010: 297-306

György Elekes, Micha Sharir: Incidences in three dimensions and distinct distances in the plane. Symposium on Computational Geometry 2010: 413-422

Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir: Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) 2010: 475-486

Natan Rubin, Haim Kaplan, Micha Sharir: Improved Bounds for Geometric Permutations. FOCS 2010: 355-364

Roel Apfelbaum, Micha Sharir: An Improved Bound on the Number of Unit Area Triangles. CoRR abs/1001.4764 (2010)

Haim Kaplan, Natan Rubin, Micha Sharir: A Kinetic Triangulation Scheme for Moving Points in The Plane. CoRR abs/1005.0912 (2010)

György Elekes, Micha Sharir: Incidences in Three Dimensions and Distinct Distances in the Plane. CoRR abs/1005.0982 (2010)

Natan Rubin, Haim Kaplan, Micha Sharir: Improved Bounds for Geometric Permutations. CoRR abs/1007.3244 (2010)

Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl: Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010)

Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir: The 2-Center Problem in Three Dimensions. CoRR abs/1012.2694 (2010)

Haim Kaplan, Natan Rubin, Micha Sharir: Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica 55(2): 283-310 (2009)

Esther Ezra, János Pach, Micha Sharir: On Regular Vertices of the Union of Planar Convex Objects. Discrete & Computational Geometry 41(2): 216-231 (2009)

Vladlen Koltun, Micha Sharir: On Overlays and Minimization Diagrams. Discrete & Computational Geometry 41(3): 385-397 (2009)

Esther Ezra, Micha Sharir: On the union of fat tetrahedra in three dimensions. J. ACM 57(1) (2009)

Gabriel Nivasch, Micha Sharir: Eppstein's bound on intersecting triangles revisited. J. Comb. Theory, Ser. A 116(2): 494-497 (2009)

Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth: Extremal problems on triangle areas in two and three dimensions. J. Comb. Theory, Ser. A 116(7): 1177-1198 (2009)

Ke Chen, Haim Kaplan, Micha Sharir: Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Transactions on Algorithms 5(2) (2009)

Pankaj K. Agarwal, Esther Ezra, Micha Sharir: Near-linear approximation algorithms for geometric hitting sets. Symposium on Computational Geometry 2009: 23-32

Roel Apfelbaum, Micha Sharir: An improved bound on the number of unit area triangles. Symposium on Computational Geometry 2009: 135-140

Ophir Setter, Micha Sharir, Dan Halperin: Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. ISVD 2009: 43-52

Haim Kaplan, Natan Rubin, Micha Sharir: Line transversals of convex polyhedra in R³. SODA 2009: 170-179

Boris Aronov, Esther Ezra, Micha Sharir: Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648

György Elekes, Haim Kaplan, Micha Sharir: On Lines, Joints, and Incidences in Three Dimensions. CoRR abs/0905.1583 (2009)

Haim Kaplan, Micha Sharir, Eugenii Shustin: On lines and Joints. CoRR abs/0906.0558 (2009)

Micha Sharir, Hayim Shaul: Semi-algebraic Range Reporting and Emptiness Searching with Applications. CoRR abs/0908.4061 (2009)

Sariel Har-Peled, Micha Sharir: Relative (p,epsilon)-Approximations in Geometry. CoRR abs/0909.0717 (2009)

Micha Sharir, Adam Sheffer, Emo Welzl: Counting Triangulations of Planar Point Sets. CoRR abs/0911.3352 (2009)

Esther Ezra, Micha Sharir, Alon Efrat: On the performance of the ICP algorithm. Comput. Geom. 41(1-2): 77-93 (2008)

Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss: Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Discrete & Computational Geometry 39(1-3): 17-37 (2008)

Yevgeny Schreiber, Micha Sharir: An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. Discrete & Computational Geometry 39(1-3): 500-579 (2008)

Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Discrete & Computational Geometry 39(4): 656-677 (2008)

Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak &epsis;-nets and interval chains. J. ACM 55(6) (2008)

János Pach, Micha Sharir: On planar intersection graphs with forbidden subgraphs. Journal of Graph Theory 59(3): 205-214 (2008)

Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008)

Pankaj K. Agarwal, Haim Kaplan, Micha Sharir: Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Transactions on Algorithms 5(1) (2008)

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. ACM Transactions on Algorithms 5(1) (2008)

Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir: The complexity of the outer face in arrangements of random segments. Symposium on Computational Geometry 2008: 69-78

Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth: Extremal problems on triangle areas in two and three dimensions. Symposium on Computational Geometry 2008: 208-217

Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang: Stabbing Convex Polygons with a Segment or a Polygon. ESA 2008: 52-63

Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky: Weak ε-nets and interval chains. SODA 2008: 1194-1203

Gabriel Nivasch, Micha Sharir: Eppstein's bound on intersecting triangles revisited. CoRR abs/0804.4415 (2008)

Haim Kaplan, Natan Rubin, Micha Sharir: Line Transversals of Convex Polyhedra in R³. CoRR abs/0807.1221 (2008)

Giora Alexandron, Haim Kaplan, Micha Sharir: Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. 36(2): 144-158 (2007)

Esther Ezra, Micha Sharir: A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R³. Discrete & Computational Geometry 37(1): 21-41 (2007)

János Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. Discrete & Computational Geometry 38(2): 399-441 (2007)

Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl: Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36(5): 1342-1359 (2007)

Roel Apfelbaum, Micha Sharir: Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. SIAM J. Discrete Math. 21(3): 707-725 (2007)

Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev: Bi-criteria linear-time approximations for generalized k-mean/median/center. Symposium on Computational Geometry 2007: 19-26

Esther Ezra, János Pach, Micha Sharir: On regular vertices on the union of planar objects. Symposium on Computational Geometry 2007: 220-226

Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir: Similar simplices in a d-dimensional point set. Symposium on Computational Geometry 2007: 232-238

Pankaj K. Agarwal, Haim Kaplan, Micha Sharir: Computing the volume of the union of cubes. Symposium on Computational Geometry 2007: 294-301

Boris Aronov, Sariel Har-Peled, Micha Sharir: On approximate halfspace range counting and relative epsilon-approximations. Symposium on Computational Geometry 2007: 327-336

Micha Sharir: Arrangements in Geometry: Recent Advances and Challenges. ESA 2007: 12-16

Haim Kaplan, Natan Rubin, Micha Sharir: Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA 2007: 287-298

Esther Ezra, Micha Sharir: Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. FOCS 2007: 525-535

Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin: Counting colors in boxes. SODA 2007: 785-794

Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner: k-Sets in Four Dimensions. Discrete & Computational Geometry 35(2): 177-191 (2006)

Eduard Oks, Micha Sharir: Minkowski Sums of Monotone and General Simple Polygons. Discrete & Computational Geometry 35(2): 223-240 (2006)

Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the Union of kappa-Round Objects in Three and Four Dimensions. Discrete & Computational Geometry 36(4): 511-526 (2006)

Rom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113(3): 385-419 (2006)

Micha Sharir, Emo Welzl: On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006)

Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir: Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006)

Yevgeny Schreiber, Micha Sharir: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. Symposium on Computational Geometry 2006: 30-39

Haim Kaplan, Micha Sharir, Elad Verbin: Colored intersection searching via sparse rectangular matrix multiplication. Symposium on Computational Geometry 2006: 52-60

Esther Ezra, Micha Sharir, Alon Efrat: On the ICP algorithm. Symposium on Computational Geometry 2006: 95-104

Micha Sharir, Emo Welzl: Random triangulations of planar point sets. Symposium on Computational Geometry 2006: 273-281

Vladlen Koltun, Micha Sharir: On overlays and minimization diagrams. Symposium on Computational Geometry 2006: 395-401

Dan Feldman, Amos Fiat, Micha Sharir: Coresets forWeighted Facilities and Their Applications. FOCS 2006: 315-324

Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir: Computing a Center-Transversal Line. FSTTCS 2006: 93-104

Haim Kaplan, Micha Sharir: Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA 2006: 484-493

Micha Sharir, Emo Welzl: On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869

Rom Pinchasi, Micha Sharir: On Graphs That Do Not Contain The Cube And Related Problems. Combinatorica 25(5): 615-623 (2005)

Micha Sharir, Hayim Shaul: Ray shooting and stone throwing with near-linear storage. Comput. Geom. 30(3): 239-252 (2005)

Esther Ezra, Micha Sharir: Counting and representing intersections among triangles in three dimensions. Comput. Geom. 32(3): 196-215 (2005)

Boris Aronov, Vladlen Koltun, Micha Sharir: Incidences between Points and Circles in Three and Higher Dimensions. Discrete & Computational Geometry 33(2): 185-206 (2005)

Boris Aronov, Vladlen Koltun, Micha Sharir: Cutting Triangular Cycles of Lines in Space. Discrete & Computational Geometry 33(2): 231-247 (2005)

Sharona Feldman, Micha Sharir: An Improved Bound for Joints in Arrangements of Lines in Space. Discrete & Computational Geometry 33(2): 307-320 (2005)

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir: Lines Avoiding Unit Balls in Three Dimensions. Discrete & Computational Geometry 34(2): 231-250 (2005)

János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth: Topological Graphs with No Large Grids. Graphs and Combinatorics 21(3): 355-364 (2005)

Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir: Crossing patterns of semi-algebraic sets. J. Comb. Theory, Ser. A 111(2): 310-326 (2005)

Raimund Seidel, Micha Sharir: Top-Down Analysis of Path Compression. SIAM J. Comput. 34(3): 515-525 (2005)

Pankaj K. Agarwal, Micha Sharir: Pseudo-Line Arrangements: Duality, Algorithms, and Applications. SIAM J. Comput. 34(3): 526-552 (2005)

Vladlen Koltun, Micha Sharir: Curve-Sensitive Cuttings. SIAM J. Comput. 34(4): 863-878 (2005)

Esther Ezra, Micha Sharir: Output-Sensitive Construction of the Union of Triangles. SIAM J. Comput. 34(6): 1331-1351 (2005)

Roel Apfelbaum, Micha Sharir: Repeated Angles in Three and Four Dimensions. SIAM J. Discrete Math. 19(2): 294-300 (2005)

Micha Sharir: The interface between computational and combinatorial geometry. SODA 2005: 137-145

Micha Sharir, Hayim Shaul: Ray shooting amid balls, farthest point from a line, and range emptiness searching. SODA 2005: 525-534

Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl: Online conflict-free coloring for intervals. SODA 2005: 545-554

Giora Alexandron, Haim Kaplan, Micha Sharir: Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS 2005: 269-281

Eti Ezra, Dan Halperin, Micha Sharir: Speeding up the incremental construction of the union of geometric objects in practice. Comput. Geom. 27(1): 63-85 (2004)

Boris Aronov, Robert Schiffenbauer, Micha Sharir: On the number of views of translates of a cube and related problems. Comput. Geom. 27(2): 179-192 (2004)

Micha Sharir, Emo Welzl: Point-Line Incidences in Space. Combinatorics, Probability & Computing 13(2): 203-220 (2004)

Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct Distances in Three and Higher Dimensions. Combinatorics, Probability & Computing 13(3): 283-293 (2004)

Shakhar Smorodinsky, Micha Sharir: Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Combinatorics, Probability & Computing 13(3): 389-411 (2004)

Vladlen Koltun, Micha Sharir: Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. Discrete & Computational Geometry 31(1): 83-124 (2004)

Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discrete & Computational Geometry 31(2): 207-227 (2004)

Boris Aronov, Micha Sharir: Cell Complexities in Hyperplane Arrangements. Discrete & Computational Geometry 32(1): 107-115 (2004)

Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. J. ACM 51(2): 139-186 (2004)

János Pach, Rom Pinchasi, Micha Sharir: On the number of directions determined by a three-dimensional points set. J. Comb. Theory, Ser. A 108(1): 1-16 (2004)

Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler: The Simplex Algorithm in Dimension Three. SIAM J. Comput. 34(2): 475-497 (2004)

Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir: On lines avoiding unit balls in three dimensions. Symposium on Computational Geometry 2004: 36-45

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. Symposium on Computational Geometry 2004: 61-67

János Pach, Rom Pinchasi, Micha Sharir: Solution of Scott's problem on the number of directions determined by a point set in 3-space. Symposium on Computational Geometry 2004: 76-85

Joseph S. B. Mitchell, Micha Sharir: New results on shortest paths in three dimensions. Symposium on Computational Geometry 2004: 124-133

Esther Ezra, Micha Sharir: Counting and representing intersections among triangles in three dimensions. Symposium on Computational Geometry 2004: 210-219

Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir: On the union of kapa-round objects. Symposium on Computational Geometry 2004: 383-390

Rom Pinchasi, Rados Radoicic, Micha Sharir: On empty convex polygons in a planar point set. Symposium on Computational Geometry 2004: 391-400

Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp: Geometrically aware communication in random wireless networks. PODC 2004: 310-319

Eti Ezra, Micha Sharir: Output-sensitive construction of the union of triangles. SODA 2004: 420-429

Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. SODA 2004: 516-525

Micha Sharir: The Clarkson-Shor Technique Revisited And Extended. Combinatorics, Probability & Computing 12(2): 191-201 (2003)

János Pach, Ido Safruti, Micha Sharir: The Union of Congruent Cubes in Three Dimensions. Discrete & Computational Geometry 30(1): 133-160 (2003)

Micha Sharir, Shakhar Smorodinsky: On neighbors in geometric permutations. Discrete Mathematics 268(1-3): 327-335 (2003)

Gennady Pustylnik, Micha Sharir: The Minkowski sum of a simple polygon and a segment. Inf. Process. Lett. 85(4): 179-184 (2003)

Vladlen Koltun, Micha Sharir: 3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. SIAM J. Comput. 32(3): 616-642 (2003)

Vladlen Koltun, Micha Sharir: The Partition Technique for Overlays of Envelopes. SIAM J. Comput. 32(4): 841-863 (2003)

János Pach, Rom Pinchasi, Micha Sharir: A tight bound for the number of different directions in three dimensions. Symposium on Computational Geometry 2003: 106-113

Vladlen Koltun, Micha Sharir: Curve-sensitive cuttings. Symposium on Computational Geometry 2003: 136-143

Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang: Hausdorff distance under translation for points and balls. Symposium on Computational Geometry 2003: 282-291

Micha Sharir, Hayim Shaul: Ray Shooting and Stone Throwing. ESA 2003: 470-481

Boris Aronov, János Pach, Micha Sharir, Gábor Tardos: Distinct distances in three and higher dimensions. STOC 2003: 541-546

Boris Aronov, Vladlen Koltun, Micha Sharir: Cutting triangular cycles of lines in space. STOC 2003: 547-555

Micha Sharir, Shakhar Smorodinsky: Extremal Configurations and Levels in Pseudoline Arrangements. WADS 2003: 127-139

Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting intersecting pairs of convex polytopes in two and three dimensions. Comput. Geom. 23(2): 195-207 (2002)

Boris Aronov, Micha Sharir: Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. Discrete & Computational Geometry 28(4): 475-490 (2002)

Dan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002)

Micha Sharir, Emo Welzl: Point-line incidences in space. Symposium on Computational Geometry 2002: 107-115

Boris Aronov, Vladlen Koltun, Micha Sharir: Incidences between points and circles in three and higher dimensions. Symposium on Computational Geometry 2002: 116-122

Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky: Lenses in arrangements of pseudo-circles and their applications. Symposium on Computational Geometry 2002: 123-132

Vladlen Koltun, Micha Sharir: Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. Symposium on Computational Geometry 2002: 217-226

Vladlen Koltun, Micha Sharir: Polyhedral Voronoi diagrams of polyhedra in three dimensions. Symposium on Computational Geometry 2002: 227-236

Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl: Translating a Planar Object to Maximize Point Containment. ESA 2002: 42-53

Eti Ezra, Dan Halperin, Micha Sharir: Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484

Vladlen Koltun, Micha Sharir: The Partition Technique for Overlays of Envelopes. FOCS 2002: 637-

Pankaj K. Agarwal, Micha Sharir: Pseudo-line arrangements: duality, algorithms, and applications. SODA 2002: 800-809

Vladlen Koltun, Micha Sharir: On the overlay of envelopes in four dimensions. SODA 2002: 810-819

Micha Sharir, Shakhar Smorodinsky: On Neighbors in Geometric Permutations. SWAT 2002: 131-139

Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. Discrete & Computational Geometry 25(2): 203-220 (2001)

Sariel Har-Peled, Micha Sharir: Online Point Location in Planar Arrangements and Its Applications. Discrete & Computational Geometry 26(1): 19-40 (2001)

Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An Improved Bound for k-Sets in Three Dimensions. Discrete & Computational Geometry 26(2): 195-204 (2001)

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discrete & Computational Geometry 26(3): 307-320 (2001)

Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir: On the Complexity of Arrangements of Circles in the Plane. Discrete & Computational Geometry 26(4): 465-492 (2001)

János Pach, Micha Sharir: Radial Points in the Plane. Eur. J. Comb. 22(6): 855-863 (2001)

Pankaj K. Agarwal, Micha Sharir: On the number of congruent simplices in a point. Symposium on Computational Geometry 2001: 1-9

János Pach, Ido Safruti, Micha Sharir: The union of congruent cubes in three dimensions. Symposium on Computational Geometry 2001: 19-28

Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir: Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. Symposium on Computational Geometry 2001: 141-150

Micha Sharir: The Clarkson-Shor technique revisited and extended. Symposium on Computational Geometry 2001: 252-256

Micha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem. Symposium on Computational Geometry 2001: 315-318

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On the Complexity of Many Faces in Arrangements of Circles. FOCS 2001: 74-83

Sariel Har-Peled, Micha Sharir: Online point location in planar arrangements and its applications. SODA 2001: 57-66

Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold: Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. WADS 2001: 122-134

Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic data structures for fat objects and their applications. Comput. Geom. 15(4): 215-227 (2000)

Alon Efrat, Micha Sharir: On the Complexity of the Union of Fat Convex Objects in the Plane. Discrete & Computational Geometry 23(2): 171-189 (2000)

Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir: Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discrete & Computational Geometry 23(2): 247-259 (2000)

Pankaj K. Agarwal, Micha Sharir: Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Discrete & Computational Geometry 24(4): 645-657 (2000)

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation Algorithms for Minimum-Width Annuli and Shells. Discrete & Computational Geometry 24(4): 687-705 (2000)

Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir: Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. 7(3): 227-240 (2000)

Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An improved bound for k-sets in three dimensions. Symposium on Computational Geometry 2000: 43-49

Dan Halperin, Micha Sharir, Kenneth Y. Goldberg: The 2-center problem with obstacles. Symposium on Computational Geometry 2000: 80-90

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000: 510-517

Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir: Computing the Penetration Depth of Two Convex Polytopes in 3D. SWAT 2000: 328-338

Micha Sharir, Shakhar Smorodinsky, Gábor Tardos: An Improved Bound for k-Sets in Three Dimensions. EuroCG 2000: 132-135

Gill Barequet, Micha Sharir: Partial surface matching by using directed footprints. Comput. Geom. 12(1-2): 45-62 (1999)

János Pach, Micha Sharir: On the Boundary of the Union of Planar Convex Sets. Discrete & Computational Geometry 21(3): 321-328 (1999)

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discrete & Computational Geometry 21(3): 373-388 (1999)

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Motion Planning for a Convex Polygon in a Polygonal Environment. Discrete & Computational Geometry 22(2): 201-221 (1999)

Pankaj K. Agarwal, Alon Efrat, Micha Sharir: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SIAM J. Comput. 29(3): 912-953 (1999)

Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann: Efficient Algorithms for Maximum Regression Depth. Symposium on Computational Geometry 1999: 31-40

Pankaj K. Agarwal, Micha Sharir: Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. Symposium on Computational Geometry 1999: 143-153

Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir: Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Symposium on Computational Geometry 1999: 380-389

Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir: Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inR^d. Symposium on Computational Geometry 1999: 400-406

Micha Sharir: Recent Developments in the Theory of Arrangements of Surfaces. FSTTCS 1999: 1-20

Pankaj K. Agarwal, Micha Sharir: Motion Planning of a Ball Amid Segments in Three Dimensions. SODA 1999: 21-30

János Pach, Micha Sharir: On the Number of Incidences Between Points and Curves. Combinatorics, Probability & Computing 7(1): 121-127 (1998)

Pankaj K. Agarwal, Micha Sharir: Efficient Algorithms for Geometric Optimization. ACM Comput. Surv. 30(4): 412-458 (1998)

Pankaj K. Agarwal, Nina Amenta, Micha Sharir: Largest Placement of One Convex Polygon Inside Another. Discrete & Computational Geometry 19(1): 95-104 (1998)

Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discrete & Computational Geometry 19(3): 315-331 (1998)

Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec: Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. Discrete & Computational Geometry 19(4): 485-519 (1998)

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Discrete & Computational Geometry 20(3): 287-305 (1998)

L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms 29(2): 238-255 (1998)

Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir: On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334

Micha Sharir: Optimized-motion planning - theory and implementation by Cherif Ahrikencheikh and Ali Seireg : John Wiley & Sons Inc., Chichester (1994) 366 pp, ISBN 0-471-01903-8. Computer-Aided Design 29(9): 672 (1997)

Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir: Quasi-Planar Graphs Have a Linear Number of Edges. Combinatorica 17(1): 1-9 (1997)

Boris Aronov, Micha Sharir: The Common Exterior of Convex Polygons in the Plane. Comput. Geom. 8: 139-149 (1997)

Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discrete & Computational Geometry 17(2): 227-239 (1997)

Micha Sharir: A Near-Linear Algorithm for the Planar 2-Center Problem. Discrete & Computational Geometry 18(2): 125-134 (1997)

Otfried Schwarzkopf, Micha Sharir: Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. Discrete & Computational Geometry 18(3): 269-288 (1997)

Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44(4): 567-584 (1997)

Shai Mohaban, Micha Sharir: Ray Shooting Amidst Spheres in Three Dimensions and Related Problems. SIAM J. Comput. 26(3): 654-674 (1997)

Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. 26(5): 1384-1408 (1997)

Boris Aronov, Micha Sharir, Boaz Tagansky: The Union of Convex Polyhedra in Three Dimensions. SIAM J. Comput. 26(6): 1670-1688 (1997)

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26(6): 1714-1732 (1997)

Boris Aronov, Micha Sharir: On Translational Motion Planning of a Convex Polyhedron in 3-Space. SIAM J. Comput. 26(6): 1785-1803 (1997)

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Symposium on Computational Geometry 1997: 30-38

Alon Efrat, Micha Sharir: On the Complexity of the Union of Fat Objects in the Plane. Symposium on Computational Geometry 1997: 104-112

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Symposium on Computational Geometry 1997: 147-155

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997: 483-492

Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir: Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi: Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996)

Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996)

Gill Barequet, Micha Sharir: Piecewise-Linear Interpolation between Polygonal Slices. Computer Vision and Image Understanding 63(2): 251-272 (1996)

Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir: The Overlay of Lower Envelopes and Its Applications. Discrete & Computational Geometry 15(1): 1-13 (1996)

Dan Halperin, Micha Sharir: A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discrete & Computational Geometry 16(2): 121-134 (1996)

Alon Efrat, Micha Sharir: A Near-Linear Algorithm for the Planar Segment-Center Problem. Discrete & Computational Geometry 16(3): 239-257 (1996)

Pankaj K. Agarwal, Micha Sharir: Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Discrete & Computational Geometry 16(4): 317-337 (1996)

Micha Sharir: Excess in Arrangements of Segments. Inf. Process. Lett. 58(5): 245-247 (1996)

Pankaj K. Agarwal, Micha Sharir: Ray Shooting Amidst Convex Polygons in 2D. J. Algorithms 21(3): 508-519 (1996)

Pankaj K. Agarwal, Micha Sharir: Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. SIAM J. Comput. 25(1): 100-116 (1996)

Otfried Schwarzkopf, Micha Sharir: Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. Symposium on Computational Geometry 1996: 20-29

Micha Sharir: A Near-Linear Algorithm for the Planar 2-Center Problem. Symposium on Computational Geometry 1996: 106-112

Micha Sharir, Emo Welzl: Rectilinear and Polygonal p-Piercing and p-Center Problems. Symposium on Computational Geometry 1996: 122-132

Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan: Approximating Shortest Paths on a Convex Polytope in Three Dimensions. Symposium on Computational Geometry 1996: 329-338

Gill Barequet, Micha Sharir: Partial Surface Matching by Using Directed Footprints. Symposium on Computational Geometry 1996: C-9-C-10

Micha Sharir: Arrangements of Curves and Surfaces in Computational Geometry. ISTCS 1996: 44-50

Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir: Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131

Micha Sharir, Pankaj K. Agarwal: Davenport-Schinzel sequences and their geometric applications. Cambridge University Press 1995, isbn 978-0-521-47025-4, pp. I-XII, 1-372

Gill Barequet, Micha Sharir: Filling gaps in the boundary of a polyhedron. Computer Aided Geometric Design 12(2): 207-229 (1995)

Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5: 187-206 (1995)

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved Bounds on Weak epsilon-Nets for Convex Sets. Discrete & Computational Geometry 13: 1-15 (1995)

Bernard Chazelle, Jirí Matousek, Micha Sharir: An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discrete & Computational Geometry 13: 363-381 (1995)

Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discrete & Computational Geometry 14(2): 113-122 (1995)

Dan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discrete & Computational Geometry 14(4): 385-410 (1995)

Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud: Reaching a Goal with Directional Uncertainty. Theor. Comput. Sci. 140(2): 301-317 (1995)

Pankaj K. Agarwal, Alon Efrat, Micha Sharir: Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Symposium on Computational Geometry 1995: 39-50

Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec: Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. Symposium on Computational Geometry 1995: 79-88

Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir: The Overlay of Lower Envelopes in Three Dimensions and Its Applications. Symposium on Computational Geometry 1995: 182-189

Pankaj K. Agarwal, Micha Sharir: Efficient Randomized Algorithms for Some Geometric Optimization Problems. Symposium on Computational Geometry 1995: 326-335

Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir: Quasi-Planar Graphs Have a Linear Number of Edges. Graph Drawing 1995: 1-7

L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA 1995: 197-204

Micha Sharir: Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. WADS 1995: 109-121

Pankaj K. Agarwal, Micha Sharir: Algorithmic Techniques for Geometric Optimization. Computer Science Today 1995: 234-253

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994)

Pankaj K. Agarwal, Micha Sharir: Planar Geometric Location Problems. Algorithmica 11(2): 185-195 (1994)

Mark H. Overmars, Micha Sharir: An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica 11(5): 469-484 (1994)

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994)

Micha Sharir, Sivan Toledo: External Polygon Containment Problems. Comput. Geom. 4: 99-118 (1994)

Alon Efrat, Micha Sharir, Alon Ziv: Computing the Smallest K-enclosing Circle and Related Problems. Comput. Geom. 4: 119-136 (1994)

Boris Aronov, Micha Sharir: Castles in the Air Revisited. Discrete & Computational Geometry 12: 119-150 (1994)

Pankaj K. Agarwal, Micha Sharir: On the Number of Views of Polyhedral Terrains. Discrete & Computational Geometry 12: 177-182 (1994)

Dan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discrete & Computational Geometry 12: 313-326 (1994)

Micha Sharir: Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. Discrete & Computational Geometry 12: 327-345 (1994)

Dan Halperin, Micha Sharir: On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994)

John H. Reif, Micha Sharir: Motion Planning in the Presence of Moving Obstacles. J. ACM 41(4): 764-790 (1994)

Pankaj K. Agarwal, Micha Sharir, Sivan Toledo: Applications of Parametric Searching in Geometric Optimization. J. Algorithms 17(3): 292-318 (1994)

Boris Aronov, Jirí Matousek, Micha Sharir: On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory, Ser. A 65(2): 311-321 (1994)

Micha Sharir: On Joints in Arrangements of Lines in Space and Related Problems. J. Comb. Theory, Ser. A 67(1): 89-99 (1994)

Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. 23(1): 154-169 (1994)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994)

Dan Halperin, Micha Sharir: Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Symposium on Computational Geometry 1994: 11-20

Boris Aronov, Micha Sharir: On Translational Motion Planning in 3-Space. Symposium on Computational Geometry 1994: 21-30

Gill Barequet, Micha Sharir: Piecewise-Linear Interpolation Between Polygonal Slices. Symposium on Computational Geometry 1994: 93-102

Pankaj K. Agarwal, Boris Aronov, Micha Sharir: Computing Envelopes in Four Dimensions with Applications. Symposium on Computational Geometry 1994: 348-358

Alon Efrat, Micha Sharir: A Near-Linear Algorithm for the Planar Segment Center Problem. SODA 1994: 87-97

Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir: Computing Depth Orders and Related Problems. SWAT 1994: 1-12

Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri: Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993)

Micha Sharir: k-sets and random hulls. Combinatorica 13(4): 483-496 (1993)

Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. 3: 235-246 (1993)

Alon Efrat, Günter Rote, Micha Sharir: On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Comput. Geom. 3: 277-288 (1993)

Pankaj K. Agarwal, Micha Sharir: Applications of a New Space-Partitioning Technique. Discrete & Computational Geometry 9: 11-38 (1993)

Boris Aronov, Marco Pellegrini, Micha Sharir: On the Zone of a Surface in a Hyperplane Arrangement. Discrete & Computational Geometry 9: 177-186 (1993)

Daniel P. Huttenlocher, Klara Kedem, Micha Sharir: The Upper Envelope of voronoi Surfaces and Its Applications. Discrete & Computational Geometry 9: 267-291 (1993)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Discrete & Computational Geometry 10: 183-196 (1993)

Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir: An Invariant Property of Balls in Arrangements of Hyperplanes. Discrete & Computational Geometry 10: 421-425 (1993)

Pankaj K. Agarwal, Micha Sharir: Circular visibility of a simple polygon from a fixed point. Int. J. Comput. Geometry Appl. 3(1): 1-25 (1993)

Matthew J. Katz, Micha Sharir: Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993)

Pankaj K. Agarwal, Micha Sharir: Circle Shooting in a Simple Polygon. J. Algorithms 14(1): 69-87 (1993)

Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo: Computing a Segment Center for a Planar Point Set. J. Algorithms 15(2): 314-323 (1993)

Herbert Edelsbrunner, Raimund Seidel, Micha Sharir: On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993)

Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir: Counting Circular Arc Intersections. SIAM J. Comput. 22(4): 778-793 (1993)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. 22(6): 1286-1302 (1993)

Pankaj K. Agarwal, Micha Sharir: On the Number of Views of Polyhedral Terrains. CCCG 1993: 55-60

Alon Efrat, Günter Rote, Micha Sharir: On the Union of Fat Wedges and Separating a Collection of Segments By a Line. CCCG 1993: 115-120

Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir: On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132

Matthew J. Katz, Micha Sharir: Optimal Slope Selection Via Expanders. CCCG 1993: 139-144

Micha Sharir: Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. CCCG 1993: 181-186

Klara Kedem, Micha Sharir, Sivan Toledo: On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. CCCG 1993: 204-209

Alon Efrat, Micha Lindenbaum, Micha Sharir: Finding Maximally Consistent Sets of Halfspaces. CCCG 1993: 432-436

Dan Halperin, Micha Sharir: New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. Symposium on Computational Geometry 1993: 11-18

Matthew J. Katz, Micha Sharir: An Expander-Based Approach to Geometric Optimization. Symposium on Computational Geometry 1993: 198-207

Y. B. Karasik, Micha Sharir: The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. Symposium on Computational Geometry 1993: 379-388

Estarose Wolfson, Micha Sharir: Implementation of a Motion Planning System in Three Dimensions. Symposium on Computational Geometry 1993: 399-400

Dan Halperin, Micha Sharir: Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment. FOCS 1993: 382-391

Micha Sharir: Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. FOCS 1993: 498-507

Boris Aronov, Micha Sharir: The Union of Convex Polyhedra in Three Dimensions. FOCS 1993: 518-527

Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir: Reaching a Goal with Directional Uncertainty. ISAAC 1993: 1-10

Pankaj K. Agarwal, Micha Sharir: Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA 1993: 260-270

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504

Alon Efrat, Micha Sharir, Alon Ziv: Computing the Smallest k-Enclosing Circle and Related Problems. WADS 1993: 325-336

Leonidas J. Guibas, Donald E. Knuth, Micha Sharir: Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica 7(4): 381-413 (1992)

Jacob T. Schwartz, Micha Sharir: Finding Effective "Force Targets" for Two-Dimensional Multifinger Frictional Grips. Algorithmica 8(1): 1-20 (1992)

Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica 8(5&6): 407-429 (1992)

Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: The number of edges of many faces in a line segment arrangement. Combinatorica 12(3): 261-274 (1992)

Matthew J. Katz, Mark H. Overmars, Micha Sharir: Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992)

János Pach, Micha Sharir: Repeated Angles in the Plane and Related Problems. J. Comb. Theory, Ser. A 59(1): 12-22 (1992)

Dan Halperin, Mark H. Overmars, Micha Sharir: Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992)

Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir: Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. Theor. Comput. Sci. 92(2): 319-336 (1992)