The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Micha Sharir: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edmond Schonberg, Jacob T. Schwartz, Micha Sharir
    An Automatic Technique for Selection of Data Structures in SETL Programs. [Citation Graph (2, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1981, v:3, n:2, pp:126-143 [Journal]
  2. Robert B. K. Dewar, Micha Sharir, Elia Weixelbaum
    Transformational Derivation of a Garbage Collection Algorithm. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1982, v:4, n:4, pp:650-667 [Journal]
  3. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
    On the Zone Theorem for Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    New Results and New Trends in Computer Science, 1991, pp:108-123 [Conf]
  4. Pankaj K. Agarwal, Micha Sharir
    On the Number of Views of Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:55-60 [Conf]
  5. Alon Efrat, Micha Lindenbaum, Micha Sharir
    Finding Maximally Consistent Sets of Halfspaces. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:432-436 [Conf]
  6. Alon Efrat, Günter Rote, Micha Sharir
    On the Union of Fat Wedges and Separating a Collection of Segments By a Line. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:115-120 [Conf]
  7. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
    On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:127-132 [Conf]
  8. Matthew J. Katz, Micha Sharir
    Optimal Slope Selection Via Expanders. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:139-144 [Conf]
  9. Klara Kedem, Micha Sharir, Sivan Toledo
    On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm for a Convex Polygon in the Plane. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:204-209 [Conf]
  10. Micha Sharir
    Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:181-186 [Conf]
  11. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:380-389 [Conf]
  12. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    On lines avoiding unit balls in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:36-45 [Conf]
  13. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:348-358 [Conf]
  14. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    On Levels in Arrangements of Lines, Segments, Planes, and Triangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:30-38 [Conf]
  15. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:321-331 [Conf]
  16. Pankaj K. Agarwal, Alon Efrat, Micha Sharir
    Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:39-50 [Conf]
  17. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang
    Hausdorff distance under translation for points and balls. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:282-291 [Conf]
  18. Pankaj K. Agarwal, Micha Sharir
    On the number of congruent simplices in a point. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:1-9 [Conf]
  19. Pankaj K. Agarwal, Micha Sharir
    Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:70-80 [Conf]
  20. Pankaj K. Agarwal, Micha Sharir
    Counting Circular Arc Intersections. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:10-20 [Conf]
  21. Pankaj K. Agarwal, Micha Sharir
    Efficient Randomized Algorithms for Some Geometric Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:326-335 [Conf]
  22. Pankaj K. Agarwal, Micha Sharir
    Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:143-153 [Conf]
  23. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
    The Overlay of Lower Envelopes in Three Dimensions and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:182-189 [Conf]
  24. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    Algorithms for center and Tverberg points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:61-67 [Conf]
  25. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    The Discrete 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:147-155 [Conf]
  26. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
    Points and Triangles in the Plane and Halving Planes in Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:112-115 [Conf]
  27. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
    On the union of kapa-round objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:383-390 [Conf]
  28. Boris Aronov, Vladlen Koltun, Micha Sharir
    Incidences between points and circles in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:116-122 [Conf]
  29. Boris Aronov, Jirí Matousek, Micha Sharir
    On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:307-313 [Conf]
  30. Boris Aronov, Micha Sharir
    Triangles in Space or Building (and Analyzing) Castles in the Air. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:381-391 [Conf]
  31. Boris Aronov, Micha Sharir
    Castles in the Air Revisited. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:146-156 [Conf]
  32. Boris Aronov, Micha Sharir
    On Translational Motion Planning in 3-Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:21-30 [Conf]
  33. Gill Barequet, Micha Sharir
    Piecewise-Linear Interpolation Between Polygonal Slices. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:93-102 [Conf]
  34. Gill Barequet, Micha Sharir
    Partial Surface Matching by Using Directed Footprints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:0-9 [Conf]
  35. Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec
    Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:79-88 [Conf]
  36. Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger
    The Combinatorial Complexity of Hyperplane Transversals. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:83-91 [Conf]
  37. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Slimming Down by Adding: Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:116-127 [Conf]
  38. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Diameter, Width, Closest Line Pair, and Parametric Searching. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:120-129 [Conf]
  39. Bernard Chazelle, Micha Sharir, Emo Welzl
    Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:23-33 [Conf]
  40. Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
    Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:141-150 [Conf]
  41. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangements of Jordan Arcs with Three Intersections per Pair. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:258-265 [Conf]
  42. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:56-69 [Conf]
  43. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity of Many Faces in Arrangements of Lines of Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:44-55 [Conf]
  44. Alon Efrat, Micha Sharir
    On the Complexity of the Union of Fat Objects in the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:104-112 [Conf]
  45. Esther Ezra, Micha Sharir
    Counting and representing intersections among triangles in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:210-219 [Conf]
  46. Esther Ezra, Micha Sharir, Alon Efrat
    On the ICP algorithm. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:95-104 [Conf]
  47. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
    Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:1-13 [Conf]
  48. Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony
    On the General Motion Planning Problem with Two Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:289-298 [Conf]
  49. Dan Halperin, Micha Sharir
    New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:11-18 [Conf]
  50. Dan Halperin, Micha Sharir
    Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:11-20 [Conf]
  51. Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
    The 2-center problem with obstacles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:80-90 [Conf]
  52. Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
    Approximating Shortest Paths on a Convex Polytope in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:329-338 [Conf]
  53. Daniel P. Huttenlocher, Klara Kedem, Micha Sharir
    The Upper Envelope of Voronoi Surfaces and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:194-203 [Conf]
  54. Haim Kaplan, Micha Sharir, Elad Verbin
    Colored intersection searching via sparse rectangular matrix multiplication. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:52-60 [Conf]
  55. Y. B. Karasik, Micha Sharir
    Optical Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:232-241 [Conf]
  56. Y. B. Karasik, Micha Sharir
    The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:379-388 [Conf]
  57. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with small Union Size. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:31-40 [Conf]
  58. Matthew J. Katz, Micha Sharir
    An Expander-Based Approach to Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:198-207 [Conf]
  59. Klara Kedem, Micha Sharir
    An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:329-340 [Conf]
  60. Vladlen Koltun, Micha Sharir
    Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:217-226 [Conf]
  61. Vladlen Koltun, Micha Sharir
    Polyhedral Voronoi diagrams of polyhedra in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:227-236 [Conf]
  62. Vladlen Koltun, Micha Sharir
    Curve-sensitive cuttings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:136-143 [Conf]
  63. Vladlen Koltun, Micha Sharir
    On overlays and minimization diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:395-401 [Conf]
  64. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann
    Efficient Algorithms for Maximum Regression Depth. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:31-40 [Conf]
  65. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
    Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:1-10 [Conf]
  66. Jirí Matousek, Micha Sharir, Emo Welzl
    A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:1-8 [Conf]
  67. Joseph S. B. Mitchell, Micha Sharir
    New results on shortest paths in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:124-133 [Conf]
  68. Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:123-132 [Conf]
  69. Mark H. Overmars, Micha Sharir
    Merging Visibility Maps. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:168-176 [Conf]
  70. János Pach, Rom Pinchasi, Micha Sharir
    A tight bound for the number of different directions in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:106-113 [Conf]
  71. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:76-85 [Conf]
  72. János Pach, Ido Safruti, Micha Sharir
    The union of congruent cubes in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:19-28 [Conf]
  73. Rom Pinchasi, Rados Radoicic, Micha Sharir
    On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:391-400 [Conf]
  74. Yevgeny Schreiber, Micha Sharir
    An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:30-39 [Conf]
  75. Otfried Schwarzkopf, Micha Sharir
    Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:20-29 [Conf]
  76. Micha Sharir
    The Clarkson-Shor technique revisited and extended. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:252-256 [Conf]
  77. Micha Sharir
    A Near-Linear Algorithm for the Planar 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:106-112 [Conf]
  78. Micha Sharir, Avikam Baltsan
    On Shortest Paths Amidst Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:193-206 [Conf]
  79. Micha Sharir, Shmuel Sifrony
    Coordinated Motion Planning for Two Independent Robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:319-328 [Conf]
  80. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An improved bound for k-sets in three dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:43-49 [Conf]
  81. Micha Sharir, Emo Welzl
    Balanced lines, halving triangles, and the generalized lower bound theorem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:315-318 [Conf]
  82. Micha Sharir, Emo Welzl
    Point-line incidences in space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:107-115 [Conf]
  83. Micha Sharir, Emo Welzl
    Random triangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:273-281 [Conf]
  84. Micha Sharir, Emo Welzl
    Rectilinear and Polygonal p-Piercing and p-Center Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:122-132 [Conf]
  85. Shmuel Sifrony, Micha Sharir
    A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:178-186 [Conf]
  86. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:400-406 [Conf]
  87. Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir
    Similar simplices in a d-dimensional point set. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:232-238 [Conf]
  88. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
    Computing the volume of the union of cubes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:294-301 [Conf]
  89. Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev
    Bi-criteria linear-time approximations for generalized k-mean/median/center. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:19-26 [Conf]
  90. Esther Ezra, János Pach, Micha Sharir
    On regular vertices on the union of planar objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:220-226 [Conf]
  91. Estarose Wolfson, Micha Sharir
    Implementation of a Motion Planning System in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:399-400 [Conf]
  92. Boris Aronov, Sariel Har-Peled, Micha Sharir
    On approximate halfspace range counting and relative epsilon-approximations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:327-336 [Conf]
  93. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
    Translating a Planar Object to Maximize Point Containment. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:42-53 [Conf]
  94. Eti Ezra, Dan Halperin, Micha Sharir
    Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:473-484 [Conf]
  95. Micha Sharir, Hayim Shaul
    Ray Shooting and Stone Throwing. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:470-481 [Conf]
  96. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An Improved Bound for k-Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:132-135 [Conf]
  97. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    On the Complexity of Many Faces in Arrangements of Circles. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:74-83 [Conf]
  98. Boris Aronov, Micha Sharir
    The Union of Convex Polyhedra in Three Dimensions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:518-527 [Conf]
  99. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:242-251 [Conf]
  100. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:568-579 [Conf]
  101. Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir
    On the Lower Envelope of Bivariate Functions and its Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:27-37 [Conf]
  102. Dan Halperin, Micha Sharir
    Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:382-391 [Conf]
  103. Sergiu Hart, Micha Sharir
    Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:313-319 [Conf]
  104. Vladlen Koltun, Micha Sharir
    The Partition Technique for Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:637-0 [Conf]
  105. Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:49-58 [Conf]
  106. Mark H. Overmars, Micha Sharir
    Output-Sensitive Hidden Surface Removal [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:598-603 [Conf]
  107. John H. Reif, Micha Sharir
    Motion Planning in the Presence of Moving Obstacles [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:144-154 [Conf]
  108. Micha Sharir
    Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:498-507 [Conf]
  109. Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
    Geometric Applications of Davenport-Schinzel Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:77-86 [Conf]
  110. Micha Sharir, Ron Livne
    On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:312-320 [Conf]
  111. Dan Feldman, Amos Fiat, Micha Sharir
    Coresets forWeighted Facilities and Their Applications. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:315-324 [Conf]
  112. Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir
    Computing a Center-Transversal Line. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:93-104 [Conf]
  113. Micha Sharir
    Recent Developments in the Theory of Arrangements of Surfaces. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1999, pp:1-20 [Conf]
  114. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:1-7 [Conf]
  115. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:661-646 [Conf]
  116. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:179-193 [Conf]
  117. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:214-229 [Conf]
  118. Leonidas J. Guibas, Donald E. Knuth, Micha Sharir
    Randomized Incremental Construction of Delaunay and Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:414-431 [Conf]
  119. Sergiu Hart, Micha Sharir
    Concurrent Probabilistic Program, or: How to Schedule if You Must. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:304-318 [Conf]
  120. Jacob T. Schwartz, Micha Sharir
    On the Bivariate Function Minimization Problem And Its Applications to Motion Planning. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:357-363 [Conf]
  121. Micha Sharir
    Data Flow Analysis of Applicative Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:98-113 [Conf]
  122. Mark de Berg, Mark H. Overmars, Leonidas J. Guibas, Otfried Schwarzkopf, Monique Teillaud, Dan Halperin, Micha Sharir
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:1-10 [Conf]
  123. Micha Sharir
    Arrangements of Curves and Surfaces in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:44-50 [Conf]
  124. Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp
    Geometrically aware communication in random wireless networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:310-319 [Conf]
  125. Sergiu Hart, Micha Sharir, Amir Pnueli
    Termination of Probabilistic Concurrent Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1982, pp:1-6 [Conf]
  126. Edmond Schonberg, Jacob T. Schwartz, Micha Sharir
    Automatic Data Structure Selection in SETL. [Citation Graph (0, 0)][DBLP]
    POPL, 1979, pp:197-210 [Conf]
  127. Herbert Edelsbrunner, Micha Sharir
    A Hyperplane Incidence Problem with Applications to Counting Distances. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:419-428 [Conf]
  128. Ronald J. Mintz, Gerald A. Fisher, Micha Sharir
    The design of a global optimizer. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Symposium on Compiler Construction, 1979, pp:226-234 [Conf]
  129. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Exact and approximation algorithms for minimum-width cylindrical shells. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:510-517 [Conf]
  130. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:483-492 [Conf]
  131. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
    Efficient Generation of k-Directional Assembly Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:122-131 [Conf]
  132. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:516-525 [Conf]
  133. Pankaj K. Agarwal, Micha Sharir
    Pseudo-line arrangements: duality, algorithms, and applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:800-809 [Conf]
  134. Pankaj K. Agarwal, Micha Sharir
    Planar Geometric Location Problems and Maintaining the Width of a Planar Set. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:449-458 [Conf]
  135. Pankaj K. Agarwal, Micha Sharir
    Ray Shooting Amidst Convex Polytopes in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:260-270 [Conf]
  136. Pankaj K. Agarwal, Micha Sharir
    Motion Planning of a Ball Amid Segments in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:21-30 [Conf]
  137. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
    Applications of Parametric Searching in Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:72-82 [Conf]
  138. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:441-448 [Conf]
  139. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:197-204 [Conf]
  140. Alon Efrat, Micha Sharir
    A Near-Linear Algorithm for the Planar Segment Center Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:87-97 [Conf]
  141. Eti Ezra, Micha Sharir
    Output-sensitive construction of the union of triangles. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:420-429 [Conf]
  142. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  143. Sariel Har-Peled, Micha Sharir
    Online point location in planar arrangements and its applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:57-66 [Conf]
  144. Haim Kaplan, Micha Sharir
    Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:484-493 [Conf]
  145. Vladlen Koltun, Micha Sharir
    On the overlay of envelopes in four dimensions. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:810-819 [Conf]
  146. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:89-93 [Conf]
  147. Micha Sharir
    The interface between computational and combinatorial geometry. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:137-145 [Conf]
  148. Micha Sharir, Hayim Shaul
    Ray shooting amid balls, farthest point from a line, and range emptiness searching. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:525-534 [Conf]
  149. Micha Sharir, Emo Welzl
    On the number of crossing-free matchings, (cycles, and partitions). [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:860-869 [Conf]
  150. Micha Sharir, Emo Welzl
    A Combinatorial Bound for Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:569-579 [Conf]
  151. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting triangular cycles of lines in space. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:547-555 [Conf]
  152. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct distances in three and higher dimensions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:541-546 [Conf]
  153. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Improved bounds on weak epsilon-nets for convex sets. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:495-504 [Conf]
  154. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Lines in Space-Combinatorics, Algorithms and Applications [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:382-393 [Conf]
  155. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-hulls and Related Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:154-166 [Conf]
  156. Sergiu Hart, Micha Sharir
    Probabilistic Temporal Logics for Finite and Bounded Models [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:1-13 [Conf]
  157. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Retraction: A New Approach to Motion-Planning (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:207-220 [Conf]
  158. Micha Sharir, Amir Schorr
    On Shortest Paths in Polyhedral Spaces [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:144-153 [Conf]
  159. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
    Computing the Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:328-338 [Conf]
  160. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
    Computing Depth Orders and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:1-12 [Conf]
  161. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
    On the Number of Regular Vertices of the Union of Jordan Regions. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:322-334 [Conf]
  162. Leonidas J. Guibas, Mark H. Overmars, Micha Sharir
    Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:64-73 [Conf]
  163. Micha Sharir, Shakhar Smorodinsky
    On Neighbors in Geometric Permutations. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:131-139 [Conf]
  164. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:122-134 [Conf]
  165. Pankaj K. Agarwal, Micha Sharir
    Applications of a New Space Partitioning Technique. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:379-391 [Conf]
  166. Giora Alexandron, Haim Kaplan, Micha Sharir
    Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:269-281 [Conf]
  167. Boris Aronov, Micha Sharir
    On the Zone of a Surface in a Hyperplane Arrangement. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:13-19 [Conf]
  168. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
    Dynamic Data Structures for Fat Objects and Their Applications. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:297-306 [Conf]
  169. Alon Efrat, Micha Sharir, Alon Ziv
    Computing the Smallest k-Enclosing Circle and Related Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:325-336 [Conf]
  170. Micha Sharir
    Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:109-121 [Conf]
  171. Micha Sharir, Shakhar Smorodinsky
    Extremal Configurations and Levels in Pseudoline Arrangements. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:127-139 [Conf]
  172. Robert B. K. Dewar, Susan M. Merritt, Micha Sharir
    Some Modified Algorithms for Dijkstra's Longest Upsequence Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:1-15 [Journal]
  173. Jacob T. Schwartz, Micha Sharir
    A Survey of Motion Planning and Related Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:157-169 [Journal]
  174. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri
    Selecting Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:5, pp:495-514 [Journal]
  175. Pankaj K. Agarwal, Micha Sharir
    Planar Geometric Location Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:2, pp:185-195 [Journal]
  176. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
    Ray Shooting in Polygons Using Geodesic Triangulations. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:1, pp:54-68 [Journal]
  177. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:2, pp:116-132 [Journal]
  178. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi
    Lines in Space: Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:15, n:5, pp:428-447 [Journal]
  179. Bernard Chazelle, Micha Sharir, Emo Welzl
    Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:407-429 [Journal]
  180. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan
    Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:209-233 [Journal]
  181. Leonidas J. Guibas, Donald E. Knuth, Micha Sharir
    Randomized Incremental Construction of Delaunay and Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:4, pp:381-413 [Journal]
  182. Jirí Matousek, Micha Sharir, Emo Welzl
    A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:498-516 [Journal]
  183. Bhubaneswar Mishra, Jacob T. Schwartz, Micha Sharir
    On the Existence and Synthesis of Multifinger Positive Grips. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:541-558 [Journal]
  184. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:27-59 [Journal]
  185. Mark H. Overmars, Micha Sharir
    An Improved Technique for Output-Sensitive Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:11, n:5, pp:469-484 [Journal]
  186. Jacob T. Schwartz, Micha Sharir
    Finding Effective ``Force Targets'' for Two-Dimensional Multifinger Frictional Grips. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:1, pp:1-20 [Journal]
  187. Shmuel Sifrony, Micha Sharir
    A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1987, v:2, n:, pp:367-402 [Journal]
  188. Micha Sharir, Shmuel Sifrony
    Coordinated Motion Planning for Two Independent Robots. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:1, pp:107-130 [Journal]
  189. Mark H. Overmars, Haijo Schipper, Micha Sharir
    Storing Line Segments in Partition Trees. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:3, pp:385-403 [Journal]
  190. 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. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1997, v:29, n:9, pp:672- [Journal]
  191. Gill Barequet, Micha Sharir
    Filling gaps in the boundary of a polyhedron. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1995, v:12, n:2, pp:207-229 [Journal]
  192. Micha Sharir
    Structural Analysis: A New Approch to Flow Analysis in Optimizing Compilers. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1980, v:5, n:3, pp:141-153 [Journal]
  193. Micha Sharir
    Formal Integration: A Program Transformation Technique. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1981, v:6, n:1, pp:35-46 [Journal]
  194. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir
    Quasi-Planar Graphs Have a Linear Number of Edges. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:1, pp:1-9 [Journal]
  195. Imre Bárány, Micha Sharir
    The Caratheodory number for the k-core. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:185-194 [Journal]
  196. Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The number of edges of many faces in a line segment arrangement. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:261-274 [Journal]
  197. Boris Aronov, Micha Sharir
    Triangles in space or building (and analyzing) castles in the air. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:137-173 [Journal]
  198. Sergiu Hart, Micha Sharir
    Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:2, pp:151-178 [Journal]
  199. Rom Pinchasi, Micha Sharir
    On Graphs That Do Not Contain The Cube And Related Problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2005, v:25, n:5, pp:615-623 [Journal]
  200. Micha Sharir
    Almost linear upper bounds on the length of general Davenport-Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:1, pp:131-143 [Journal]
  201. Micha Sharir
    Improved lower bounds on the length of Davenport - Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:117-124 [Journal]
  202. Micha Sharir
    k-sets and random hulls. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:483-496 [Journal]
  203. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:2, pp:195-207 [Journal]
  204. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir
    Computing Depth Orders for Fat Objects and Related Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1995, v:5, n:, pp:187-206 [Journal]
  205. Pankaj K. Agarwal, Micha Sharir
    Off-line Dynamic Maintenance of the Width of a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:65-78 [Journal]
  206. Boris Aronov, Micha Sharir
    The Common Exterior of Convex Polygons in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:139-149 [Journal]
  207. Boris Aronov, Robert Schiffenbauer, Micha Sharir
    On the number of views of translates of a cube and related problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:2, pp:179-192 [Journal]
  208. Gill Barequet, Micha Sharir
    Partial surface matching by using directed footprints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:12, n:1-2, pp:45-62 [Journal]
  209. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:305-323 [Journal]
  210. Eti Ezra, Dan Halperin, Micha Sharir
    Speeding up the incremental construction of the union of geometric objects in practice. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:63-85 [Journal]
  211. Esther Ezra, Micha Sharir
    Counting and representing intersections among triangles in three dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:32, n:3, pp:196-215 [Journal]
  212. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir
    Dynamic data structures for fat objects and their applications. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:15, n:4, pp:215-227 [Journal]
  213. Alon Efrat, Günter Rote, Micha Sharir
    On the Union of Fat Wedges and Separating a Collection of Segments By a Line. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:277-288 [Journal]
  214. Alon Efrat, Micha Sharir, Alon Ziv
    Computing the Smallest K-enclosing Circle and Related Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:119-136 [Journal]
  215. Dan Halperin, Micha Sharir
    Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:269-303 [Journal]
  216. Matthew J. Katz, Mark H. Overmars, Micha Sharir
    Efficient Hidden Surface Removal for Objects with Small Union Size. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1992, v:2, n:, pp:223-234 [Journal]
  217. Micha Sharir, Hayim Shaul
    Ray shooting and stone throwing with near-linear storage. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:3, pp:239-252 [Journal]
  218. Micha Sharir, Sivan Toledo
    External Polygon Containment Problems. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1994, v:4, n:, pp:99-118 [Journal]
  219. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:235-246 [Journal]
  220. Mark H. Overmars, Micha Sharir
    Merging Visibility Maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:35-49 [Journal]
  221. Giora Alexandron, Haim Kaplan, Micha Sharir
    Kinetic and dynamic data structures for convex hulls and upper envelopes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:2, pp:144-158 [Journal]
  222. Micha Sharir
    Algorithmic Motion Planning in Robotics. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1989, v:22, n:3, pp:9-20 [Journal]
  223. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos
    Distinct Distances in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:283-293 [Journal]
  224. János Pach, Micha Sharir
    On the Number of Incidences Between Points and Curves. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:121-127 [Journal]
  225. Micha Sharir
    The Clarkson-Shor Technique Revisited And Extended. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:2, pp:- [Journal]
  226. Micha Sharir, Emo Welzl
    Point-Line Incidences in Space. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:2, pp:203-220 [Journal]
  227. Shakhar Smorodinsky, Micha Sharir
    Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:389-411 [Journal]
  228. Pankaj K. Agarwal, Micha Sharir
    Efficient Algorithms for Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1998, v:30, n:4, pp:412-458 [Journal]
  229. Gill Barequet, Micha Sharir
    Piecewise-Linear Interpolation between Polygonal Slices. [Citation Graph (0, 0)][DBLP]
    Computer Vision and Image Understanding, 1996, v:63, n:2, pp:251-272 [Journal]
  230. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir
    On the Number of Regular Vertices of the Union of Jordan Regions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:2, pp:203-220 [Journal]
  231. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir
    On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:3, pp:315-331 [Journal]
  232. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir
    Approximation Algorithms for Minimum-Width Annuli and Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:687-705 [Journal]
  233. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir
    Lines Avoiding Unit Balls in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:2, pp:231-250 [Journal]
  234. Boris Aronov, Vladlen Koltun, Micha Sharir
    Incidences between Points and Circles in Three and Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:185-206 [Journal]
  235. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:3, pp:307-320 [Journal]
  236. Boris Aronov, Vladlen Koltun, Micha Sharir
    Cutting Triangular Cycles of Lines in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:231-247 [Journal]
  237. Pankaj K. Agarwal, Nina Amenta, Micha Sharir
    Largest Placement of One Convex Polygon Inside Another. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:1, pp:95-104 [Journal]
  238. Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir
    An Invariant Property of Balls in Arrangements of Hyperplanes. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:421-425 [Journal]
  239. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Motion Planning for a Convex Polygon in a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:2, pp:201-221 [Journal]
  240. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:3, pp:373-388 [Journal]
  241. Boris Aronov, Marco Pellegrini, Micha Sharir
    On the Zone of a Surface in a Hyperplane Arrangement. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:177-186 [Journal]
  242. Boris Aronov, Micha Sharir
    Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:4, pp:475-490 [Journal]
  243. Boris Aronov, Micha Sharir
    Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:1, pp:107-115 [Journal]
  244. Boris Aronov, Micha Sharir
    Castles in the Air Revisited. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:119-150 [Journal]
  245. Pankaj K. Agarwal, Micha Sharir
    Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:4, pp:645-657 [Journal]
  246. Pankaj K. Agarwal, Micha Sharir
    Applications of a New Space-Partitioning Technique. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:11-38 [Journal]
  247. Pankaj K. Agarwal, Micha Sharir
    On the Number of Views of Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:177-182 [Journal]
  248. Pankaj K. Agarwal, Micha Sharir
    Efficient Randomized Algorithms for Some Geometric. Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:317-337 [Journal]
  249. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir
    The Overlay of Lower Envelopes and Its Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:15, n:1, pp:1-13 [Journal]
  250. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    The Discrete 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:287-305 [Journal]
  251. Noga Alon, H. Last, Rom Pinchasi, Micha Sharir
    On the Complexity of Arrangements of Circles in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:4, pp:465-492 [Journal]
  252. Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec
    Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:4, pp:485-519 [Journal]
  253. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Improved Bounds on Weak epsilon-Nets for Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:1-15 [Journal]
  254. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    Diameter, Width, Closest Line Pair, and Parametric Searching. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:183-196 [Journal]
  255. Bernard Chazelle, Jirí Matousek, Micha Sharir
    An Elementary Approach to Lower Bounds in Geometric Discrepancy. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:363-381 [Journal]
  256. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:99-160 [Journal]
  257. Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir
    Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:2, pp:207-227 [Journal]
  258. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    On Arrangement of Jordan Arcs with Three Intersection per Pair. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:523-539 [Journal]
  259. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:433-466 [Journal]
  260. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:311-336 [Journal]
  261. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:161-196 [Journal]
  262. Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    The Complexity of Many Cells in Arrangements of Planes and Related Problems. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:197-216 [Journal]
  263. Herbert Edelsbrunner, Micha Sharir
    The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:35-42 [Journal]
  264. Alon Efrat, Micha Sharir
    On the Complexity of the Union of Fat Convex Objects in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:2, pp:171-189 [Journal]
  265. Alon Efrat, Micha Sharir
    A Near-Linear Algorithm for the Planar Segment-Center Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:3, pp:239-257 [Journal]
  266. Sharona Feldman, Micha Sharir
    An Improved Bound for Joints in Arrangements of Lines in Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:2, pp:307-320 [Journal]
  267. Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir
    Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:2, pp:113-122 [Journal]
  268. Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony
    On the General Motion-Planning Problem with Two Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:491-521 [Journal]
  269. Dan Halperin, Micha Sharir
    New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:313-326 [Journal]
  270. Dan Halperin, Micha Sharir
    Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:4, pp:385-410 [Journal]
  271. Dan Halperin, Micha Sharir
    A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:2, pp:121-134 [Journal]
  272. Sariel Har-Peled, Micha Sharir
    Online Point Location in Planar Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:1, pp:19-40 [Journal]
  273. Daniel P. Huttenlocher, Klara Kedem, Micha Sharir
    The Upper Envelope of voronoi Surfaces and Its Applications. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:267-291 [Journal]
  274. Klara Kedem, Ron Livne, János Pach, Micha Sharir
    On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:59-70 [Journal]
  275. Klara Kedem, Micha Sharir
    An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:43-75 [Journal]
  276. Klara Kedem, Micha Sharir, Sivan Toledo
    On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:2, pp:227-239 [Journal]
  277. Vladlen Koltun, Micha Sharir
    Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:1, pp:83-124 [Journal]
  278. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap
    Computing the Link Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:281-293 [Journal]
  279. Daniel Leven, Micha Sharir
    Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:9-31 [Journal]
  280. Daniel Leven, Micha Sharir
    On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:255-270 [Journal]
  281. Eduard Oks, Micha Sharir
    Minkowski Sums of Monotone and General Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:223-240 [Journal]
  282. Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner
    k-Sets in Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:2, pp:177-191 [Journal]
  283. János Pach, Micha Sharir
    The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:291-309 [Journal]
  284. János Pach, Micha Sharir
    On the Boundary of the Union of Planar Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:21, n:3, pp:321-328 [Journal]
  285. János Pach, Ido Safruti, Micha Sharir
    The Union of Congruent Cubes in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:1, pp:133-160 [Journal]
  286. Richard Pollack, Micha Sharir, Günter Rote
    Computing the Geodesic Center of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:611-626 [Journal]
  287. P. Pollack, Micha Sharir, Shmuel Sifrony
    Separating Two Simple Polygons by a Sequence of Translations. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:123-136 [Journal]
  288. Otfried Schwarzkopf, Micha Sharir
    Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:3, pp:269-288 [Journal]
  289. Micha Sharir
    On k-Sets in Arrangement of Curves and Surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:593-613 [Journal]
  290. Micha Sharir
    Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:327-345 [Journal]
  291. Micha Sharir
    A Near-Linear Algorithm for the Planar 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:18, n:2, pp:125-134 [Journal]
  292. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos
    An Improved Bound for k-Sets in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:195-204 [Journal]
  293. Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir
    Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:2, pp:247-259 [Journal]
  294. Ady Wiernik, Micha Sharir
    Planar Realizations of Nonlinear Davenport-Schnitzel Sequences by Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:15-47 [Journal]
  295. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir
    On the Union of kappa-Round Objects in Three and Four Dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:36, n:4, pp:511-526 [Journal]
  296. Micha Sharir, Shakhar Smorodinsky
    On neighbors in geometric permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:327-335 [Journal]
  297. János Pach, Micha Sharir
    Radial Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:6, pp:855-863 [Journal]
  298. János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth
    Topological Graphs with No Large Grids. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:355-364 [Journal]
  299. Sergiu Hart, Micha Sharir
    Probabilistic Propositional Temporal Logics [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:70, n:2/3, pp:97-155 [Journal]
  300. Pankaj K. Agarwal, Micha Sharir
    Circular visibility of a simple polygon from a fixed point. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:1-25 [Journal]
  301. Dan Halperin, Micha Sharir
    On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:4, pp:189-192 [Journal]
  302. Dan Halperin, Micha Sharir
    On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:53-56 [Journal]
  303. Matthew J. Katz, Micha Sharir
    Optimal Slope Selection via Expanders. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:3, pp:115-122 [Journal]
  304. Gennady Pustylnik, Micha Sharir
    The Minkowski sum of a simple polygon and a segment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:4, pp:179-184 [Journal]
  305. Micha Sharir
    Fast Composition of Sparse Maps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:4, pp:183-185 [Journal]
  306. Micha Sharir
    The Shortest Watchtower and Related Problems for Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:5, pp:265-270 [Journal]
  307. Micha Sharir
    A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:4, pp:187-190 [Journal]
  308. Micha Sharir
    Excess in Arrangements of Segments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:5, pp:245-247 [Journal]
  309. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan
    Approximating shortest paths on a convex polytope in three dimensions. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:4, pp:567-584 [Journal]
  310. Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky
    Lenses in arrangements of pseudo-circles and their applications. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:2, pp:139-186 [Journal]
  311. Avikam Baltsan, Micha Sharir
    On the shortest paths between two convex polyhedra. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:2, pp:267-287 [Journal]
  312. John H. Reif, Micha Sharir
    Motion Planning in the Presence of Moving Obstacles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:4, pp:764-790 [Journal]
  313. Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo
    Computing a Segment Center for a Planar Point Set. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:2, pp:314-323 [Journal]
  314. Pankaj K. Agarwal, Micha Sharir
    Circle Shooting in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:1, pp:69-87 [Journal]
  315. Pankaj K. Agarwal, Micha Sharir
    Ray Shooting Amidst Convex Polygons in 2D. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:3, pp:508-519 [Journal]
  316. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
    Applications of Parametric Searching in Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:292-318 [Journal]
  317. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:238-255 [Journal]
  318. Dan Halperin, Micha Sharir, Kenneth Y. Goldberg
    The 2-Center Problem with Obstacles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:109-134 [Journal]
  319. Daniel Leven, Micha Sharir
    An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:2, pp:192-215 [Journal]
  320. Pankaj K. Agarwal, Micha Sharir, Peter W. Shor
    Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:52, n:2, pp:228-274 [Journal]
  321. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir
    Crossing patterns of semi-algebraic sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2005, v:111, n:2, pp:310-326 [Journal]
  322. Boris Aronov, Jirí Matousek, Micha Sharir
    On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:65, n:2, pp:311-321 [Journal]
  323. János Pach, Rom Pinchasi, Micha Sharir
    On the number of directions determined by a three-dimensional points set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2004, v:108, n:1, pp:1-16 [Journal]
  324. János Pach, Micha Sharir
    Repeated Angles in the Plane and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:1, pp:12-22 [Journal]
  325. Rom Pinchasi, Rados Radoicic, Micha Sharir
    On empty convex polygons in a planar point set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:3, pp:385-419 [Journal]
  326. Micha Sharir
    On Joints in Arrangements of Lines in Space and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1994, v:67, n:1, pp:89-99 [Journal]
  327. Bernard Chazelle, Micha Sharir
    An Algorithm for Generalized Point Location and its Applications. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:281-310 [Journal]
  328. Richard Cole, Micha Sharir
    Visibility Problems for Polyhedral Terrains. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:1, pp:11-30 [Journal]
  329. Jacob T. Schwartz, Micha Sharir
    On the Two-Dimensional Davenport Schinzel Problem. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:10, n:3/4, pp:371-393 [Journal]
  330. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir
    Penetration Depth of Two Convex Polytopes in 3D. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:227-240 [Journal]
  331. Pankaj K. Agarwal, Boris Aronov, Micha Sharir
    Computing Envelopes in Four Dimensions with Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1714-1732 [Journal]
  332. Pankaj K. Agarwal, Alon Efrat, Micha Sharir
    Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:3, pp:912-953 [Journal]
  333. Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir
    Counting Circular Arc Intersections. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:778-793 [Journal]
  334. Pankaj K. Agarwal, Micha Sharir
    Pseudo-Line Arrangements: Duality, Algorithms, and Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:526-552 [Journal]
  335. Pankaj K. Agarwal, Micha Sharir
    Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:297-321 [Journal]
  336. Pankaj K. Agarwal, Micha Sharir
    Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:1, pp:100-116 [Journal]
  337. Boris Aronov, Micha Sharir
    On Translational Motion Planning of a Convex Polyhedron in 3-Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1785-1803 [Journal]
  338. Boris Aronov, Micha Sharir, Boaz Tagansky
    The Union of Convex Polyhedra in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1670-1688 [Journal]
  339. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
    Selecting Heavily Covered Points. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1138-1151 [Journal]
  340. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
    Computing a Face in an Arrangement of Line Segments and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:6, pp:1286-1302 [Journal]
  341. Richard Cole, Micha Sharir, Chee-Keng Yap
    On k-Hulls and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:1, pp:61-77 [Journal]
  342. Herbert Edelsbrunner, Raimund Seidel, Micha Sharir
    On the Zone Theorem for Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:418-429 [Journal]
  343. Esther Ezra, Micha Sharir
    Output-Sensitive Construction of the Union of Triangles. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:6, pp:1331-1351 [Journal]
  344. Dan Halperin, Mark H. Overmars, Micha Sharir
    Efficient Motion Planning for an L-Shaped Object. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:1, pp:1-23 [Journal]
  345. Sergiu Hart, Micha Sharir
    Concurrent Probabilistic Programs, Or: How to Schedule if You Must. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:991-1012 [Journal]
  346. Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler
    The Simplex Algorithm in Dimension Three. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:2, pp:475-497 [Journal]
  347. Matthew J. Katz, Micha Sharir
    An Expander-Based Approach to Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:5, pp:1384-1408 [Journal]
  348. Vladlen Koltun, Micha Sharir
    3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:3, pp:616-642 [Journal]
  349. Vladlen Koltun, Micha Sharir
    The Partition Technique for Overlays of Envelopes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:841-863 [Journal]
  350. Vladlen Koltun, Micha Sharir
    Curve-Sensitive Cuttings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:863-878 [Journal]
  351. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:154-169 [Journal]
  352. Shai Mohaban, Micha Sharir
    Ray Shooting Amidst Spheres in Three Dimensions and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:654-674 [Journal]
  353. János Pach, Micha Sharir
    On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:460-470 [Journal]
  354. Raimund Seidel, Micha Sharir
    Top-Down Analysis of Path Compression. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:515-525 [Journal]
  355. Micha Sharir
    Intersection and Closest-Pair Problems for a Set of Planar Discs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:448-468 [Journal]
  356. Micha Sharir
    On Shortest Paths Amidst Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:561-572 [Journal]
  357. Micha Sharir, Amir Pnueli, Sergiu Hart
    Verification of Probabilistic Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:292-314 [Journal]
  358. Micha Sharir, Amir Schorr
    On Shortest Paths in Polyhedral Spaces. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:193-215 [Journal]
  359. Micha Sharir, Emo Welzl
    On the Number of Crossing-Free Matchings, Cycles, and Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:695-720 [Journal]
  360. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
    Computing Maximally Separated Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:815-834 [Journal]
  361. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  362. Roel Apfelbaum, Micha Sharir
    Repeated Angles in Three and Four Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:294-300 [Journal]
  363. Mark de Berg, Leonidas J. Guibas, Dan Halperin, Mark H. Overmars, Otfried Schwarzkopf, Micha Sharir, Monique Teillaud
    Reaching a Goal with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:140, n:2, pp:301-317 [Journal]
  364. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
    A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:84, n:1, pp:77-105 [Journal]
  365. Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir
    Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:2, pp:319-336 [Journal]
  366. Micha Sharir, Mark H. Overmars
    A Simple Output-Sensitive Algorithm for Hidden Surface Removal. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Graph., 1992, v:11, n:1, pp:1-11 [Journal]
  367. Stefan M. Freudenberger, Jacob T. Schwartz, Micha Sharir
    Experience with the SETL Optimizer. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1983, v:5, n:1, pp:26-45 [Journal]
  368. Sergiu Hart, Micha Sharir, Amir Pnueli
    Termination of Probabilistic Concurrent Program. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1983, v:5, n:3, pp:356-380 [Journal]
  369. Micha Sharir
    Some Observations Concerning Formal Differentiation of Set Theoretic Expressions. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1982, v:4, n:2, pp:196-225 [Journal]
  370. Haim Kaplan, Natan Rubin, Micha Sharir
    Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:287-298 [Conf]
  371. Micha Sharir
    Arrangements in Geometry: Recent Advances and Challenges. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:12-16 [Conf]
  372. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin
    Counting colors in boxes. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:785-794 [Conf]
  373. Esther Ezra, Micha Sharir
    A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:1, pp:21-41 [Journal]
  374. Micha Sharir, Steven Skiena
    Tight bounds on a problem of lines and intersections. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:89, n:3, pp:313-314 [Journal]

  375. The complexity of the outer face in arrangements of random segments. [Citation Graph (, )][DBLP]


  376. Extremal problems on triangle areas in two and three dimensions. [Citation Graph (, )][DBLP]


  377. An improved bound on the number of unit area triangles. [Citation Graph (, )][DBLP]


  378. Near-linear approximation algorithms for geometric hitting sets. [Citation Graph (, )][DBLP]


  379. An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). [Citation Graph (, )][DBLP]


  380. On degrees in random triangulations of point sets. [Citation Graph (, )][DBLP]


  381. Incidences in three dimensions and distinct distances in the plane. [Citation Graph (, )][DBLP]


  382. A kinetic triangulation scheme for moving points in the plane. [Citation Graph (, )][DBLP]


  383. Kinetic stable Delaunay graphs. [Citation Graph (, )][DBLP]


  384. The 2-center problem in three dimensions. [Citation Graph (, )][DBLP]


  385. An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. [Citation Graph (, )][DBLP]


  386. Stabbing Convex Polygons with a Segment or a Polygon. [Citation Graph (, )][DBLP]


  387. Optimal Cover of Points by Disks in a Simple Polygon. [Citation Graph (, )][DBLP]


  388. Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. [Citation Graph (, )][DBLP]


  389. Weak ε-nets and interval chains. [Citation Graph (, )][DBLP]


  390. Line transversals of convex polyhedra in R3. [Citation Graph (, )][DBLP]


  391. Small-size epsilon-nets for axis-parallel rectangles and boxes. [Citation Graph (, )][DBLP]


  392. Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. [Citation Graph (, )][DBLP]


  393. Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. [Citation Graph (, )][DBLP]


  394. On the performance of the ICP algorithm. [Citation Graph (, )][DBLP]


  395. Eppstein's bound on intersecting triangles revisited [Citation Graph (, )][DBLP]


  396. Line Transversals of Convex Polyhedra in R3 [Citation Graph (, )][DBLP]


  397. On Lines, Joints, and Incidences in Three Dimensions [Citation Graph (, )][DBLP]


  398. On lines and Joints [Citation Graph (, )][DBLP]


  399. Semi-algebraic Range Reporting and Emptiness Searching with Applications [Citation Graph (, )][DBLP]


  400. Relative (p,epsilon)-Approximations in Geometry [Citation Graph (, )][DBLP]


  401. Counting Triangulations of Planar Point Sets [Citation Graph (, )][DBLP]


  402. An Improved Bound on the Number of Unit Area Triangles [Citation Graph (, )][DBLP]


  403. A Kinetic Triangulation Scheme for Moving Points in The Plane [Citation Graph (, )][DBLP]


  404. Incidences in Three Dimensions and Distinct Distances in the Plane [Citation Graph (, )][DBLP]


  405. Improved Bounds for Geometric Permutations [Citation Graph (, )][DBLP]


  406. Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. [Citation Graph (, )][DBLP]


  407. An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. [Citation Graph (, )][DBLP]


  408. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


  409. Efficient Algorithms for Maximum Regression Depth. [Citation Graph (, )][DBLP]


  410. On Regular Vertices of the Union of Planar Convex Objects. [Citation Graph (, )][DBLP]


  411. On Overlays and Minimization Diagrams. [Citation Graph (, )][DBLP]


Search in 0.053secs, Finished in 0.075secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002