default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMicha Sharir
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j306]Esther Ezra
, Micha Sharir:
Intersection Searching amid Tetrahedra in Four Dimensions. Discret. Comput. Geom. 73(2): 327-369 (2025)- 2024
- [j305]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
On reverse shortest paths in geometric proximity graphs. Comput. Geom. 117: 102053 (2024) - [j304]Pankaj K. Agarwal, Micha Sharir, Alex Steiger:
Decomposing the Complement of the Union of Cubes and Boxes in Three Dimensions. Discret. Comput. Geom. 72(2): 407-450 (2024) - [c259]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Semi-Algebraic Off-Line Range Searching and Biclique Partitions in the Plane. SoCG 2024: 4:1-4:15 - [c258]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Lower Envelopes of Surface Patches in 3-Space. ESA 2024: 6:1-6:17 - [c257]Pankaj K. Agarwal, Haim Kaplan, Matthew J. Katz, Micha Sharir:
Segment Proximity Graphs and Nearest Neighbor Queries Amid Disjoint Segments. ESA 2024: 7:1-7:20 - [c256]Matthew J. Katz, Rachel Saban, Micha Sharir:
Near-Linear Algorithms for Visibility Graphs over a 1.5-Dimensional Terrain. ESA 2024: 77:1-77:17 - [c255]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. SODA 2024: 150-170 - [c254]Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger:
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. SODA 2024: 4942-4962 - [i77]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane. CoRR abs/2403.12276 (2024) - [i76]Zuzana Patáková, Micha Sharir:
Covering points by hyperplanes and related problems. CoRR abs/2412.05157 (2024) - 2023
- [j303]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Comput. Geom. 109: 101945 (2023) - [j302]Boris Aronov, Esther Ezra, Micha Sharir, Guy Zigdon:
Time and space efficient collinearity indexing. Comput. Geom. 110: 101963 (2023) - [j301]Matthew J. Katz, Micha Sharir:
Bottleneck matching in the plane. Comput. Geom. 112: 101986 (2023) - [j300]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. Discret. Comput. Geom. 69(4): 1157-1194 (2023) - [j299]Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. Discret. Comput. Geom. 70(4): 1169-1220 (2023) - [c253]Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. SoCG 2023: 22:1-22:16 - [c252]Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. ESA 2023: 67:1-67:14 - [i75]Haim Kaplan, Matthew J. Katz, Rachel Saban, Micha Sharir:
The Unweighted and Weighted Reverse Shortest Path Problem for Disk Graphs. CoRR abs/2307.14663 (2023) - [i74]Pankaj K. Agarwal, Dan Halperin, Micha Sharir, Alex Steiger:
Near-Optimal Min-Sum Motion Planning for Two Square Robots in a Polygonal Environment. CoRR abs/2310.20615 (2023) - [i73]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Vertical Decomposition in 3D and 4D with Applications to Line Nearest-Neighbor Searching in 3D. CoRR abs/2311.01597 (2023) - 2022
- [j298]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. Discret. Comput. Geom. 67(2): 439-461 (2022) - [j297]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems. Discret. Comput. Geom. 68(4): 997-1048 (2022) - [j296]Micha Sharir, Noam Solomon, Oleg Zlydenko:
Incidences between points and curves with almost two degrees of freedom. J. Comb. Theory A 188: 105582 (2022) - [j295]Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. SIAM J. Comput. 51(4): 1065-1095 (2022) - [j294]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
Counting and Cutting Rich Lenses in Arrangements of Circles. SIAM J. Discret. Math. 36(2): 958-974 (2022) - [c251]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. SoCG 2022: 4:1-4:14 - [c250]Zuzana Patáková, Micha Sharir:
Covering Points by Hyperplanes and Related Problems. SoCG 2022: 57:1-57:7 - [c249]Esther Ezra, Micha Sharir:
Intersection Searching Amid Tetrahedra in 4-Space and Efficient Continuous Collision Detection. ESA 2022: 51:1-51:17 - [c248]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
On Reverse Shortest Paths in Geometric Proximity Graphs. ISAAC 2022: 42:1-42:19 - [i72]Pankaj K. Agarwal, Boris Aronov, Esther Ezra, Matthew J. Katz, Micha Sharir:
Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems. CoRR abs/2203.10241 (2022) - [i71]Matthew J. Katz, Micha Sharir:
Bottleneck Matching in the Plane. CoRR abs/2205.05887 (2022) - [i70]Esther Ezra, Micha Sharir:
Intersection Searching amid Tetrahedra in Four Dimensions. CoRR abs/2208.06703 (2022) - [i69]Jean Cardinal, Micha Sharir:
Improved Algebraic Degeneracy Testing. CoRR abs/2212.03030 (2022) - 2021
- [j293]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. Discret. Comput. Geom. 65(4): 1136-1165 (2021) - [j292]Micha Sharir, Chen Ziv:
On the complexity of the k-level in arrangements of pseudoplanes. Discret. Math. 344(6): 112354 (2021) - [j291]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. Discret. Math. 344(7): 112403 (2021) - [j290]Micha Sharir, Noam Solomon:
On rich points and incidences with restricted sets of lines in 3-space. J. Comput. Geom. 13(2): 51-72 (2021) - [j289]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SIAM J. Comput. 50(2): 509-554 (2021) - [c247]Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. SoCG 2021: 34:1-34:15 - [c246]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On Rich Lenses in Planar Arrangements of Circles and Related Problems. SoCG 2021: 35:1-35:15 - [c245]Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. SoCG 2021: 41:1-41:16 - [c244]Micha Sharir, Noam Solomon:
On Rich Points and Incidences with Restricted Sets of Lines in 3-Space. SoCG 2021: 56:1-56:14 - [c243]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. ISAAC 2021: 3:1-3:15 - [c242]Pankaj K. Agarwal, Micha Sharir, Alex Steiger:
Decomposing the Complement of the Union of Cubes in Three Dimensions. SODA 2021: 1425-1444 - [c241]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. WAFR 2021: 37-53 - [i68]Dan Halperin, Micha Sharir, Itay Yehuda:
Throwing a Sofa Through the Window. CoRR abs/2102.04262 (2021) - [i67]Esther Ezra, Micha Sharir:
On Ray Shooting for Triangles in 3-Space and Related Problems. CoRR abs/2102.07310 (2021) - [i66]Boris Aronov, Mark de Berg, Jean Cardinal, Esther Ezra, John Iacono, Micha Sharir:
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. CoRR abs/2109.07587 (2021) - [i65]Matthew J. Katz, Micha Sharir:
Efficient algorithms for optimization problems involving distances in a point set. CoRR abs/2111.02052 (2021) - 2020
- [j288]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. Comput. Geom. 91: 101666 (2020) - [j287]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing Arrangements of Hyperplanes: VC-Dimension, Combinatorial Dimension, and Point Location. Discret. Comput. Geom. 64(1): 109-173 (2020) - [j286]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles Among Triangles in Three Dimensions. Discret. Comput. Geom. 64(3): 627-653 (2020) - [j285]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and Their Algorithmic Applications. Discret. Comput. Geom. 64(3): 838-904 (2020) - [c240]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. SoCG 2020: 8:1-8:14 - [c239]Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. SoCG 2020: 52:1-52:15 - [c238]Micha Sharir, Oleg Zlydenko:
Incidences Between Points and Curves with Almost Two Degrees of Freedom. SoCG 2020: 66:1-66:14 - [i64]Dan Halperin, Sariel Har-Peled, Kurt Mehlhorn, Eunjin Oh, Micha Sharir:
The Maximum-Level Vertex in an Arrangement of Lines. CoRR abs/2003.00518 (2020) - [i63]Micha Sharir, Oleg Zlydenko:
Incidences between points and curves with almost two degrees of freedom. CoRR abs/2003.02190 (2020) - [i62]Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. CoRR abs/2003.09533 (2020) - [i61]Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. CoRR abs/2003.13192 (2020) - [i60]Shiri Artstein-Avidan, Haim Kaplan, Micha Sharir:
On Radial Isotropic Position: Theory and Algorithms. CoRR abs/2005.04918 (2020) - [i59]Dror Aiger, Haim Kaplan, Micha Sharir:
Output sensitive algorithms for approximate incidences and their applications. CoRR abs/2005.08193 (2020) - [i58]Dan Halperin, Marc J. van Kreveld, Golan Miglioli-Levy, Micha Sharir:
Space-Aware Reconfiguration. CoRR abs/2006.04402 (2020) - [i57]Dror Aiger, Haim Kaplan, Micha Sharir:
Duality-based approximation algorithms for depth queries and maximum depth. CoRR abs/2006.12318 (2020) - [i56]Micha Sharir, Noam Solomon:
Incidences with curves in three dimensions. CoRR abs/2007.04081 (2020) - [i55]Esther Ezra, Orit E. Raz, Micha Sharir, Joshua Zahl:
On rich lenses in planar arrangements of circles and related problems. CoRR abs/2012.04204 (2020) - [i54]Micha Sharir, Noam Solomon:
On rich points and incidences with restricted sets of lines in 3-space. CoRR abs/2012.11913 (2020)
2010 – 2019
- 2019
- [j284]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points. Comput. Geom. 81: 1-11 (2019) - [j283]Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for Point-Location in Hyperplane Arrangements, in the Linear Decision Tree Model. Discret. Comput. Geom. 61(4): 735-755 (2019) - [c237]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem. SoCG 2019: 8:1-8:14 - [c236]Micha Sharir, Chen Ziv:
On the Complexity of the k-Level in Arrangements of Pseudoplanes. SoCG 2019: 62:1-62:15 - [c235]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. ESA 2019: 64:1-64:14 - [i53]Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, Bernhard Zeisl:
General techniques for approximate incidences and their application to the camera posing problem. CoRR abs/1903.07047 (2019) - [i52]Micha Sharir, Chen Ziv:
On the Complexity of the k-Level in Arrangements of Pseudoplanes. CoRR abs/1903.07196 (2019) - [i51]Haim Kaplan, Katharina Klost, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Triangles and Girth in Disk Graphs and Transmission Graphs. CoRR abs/1907.01980 (2019) - 2018
- [j282]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching RMS Distance Under Translation: Combinatorics and Algorithms. Algorithmica 80(8): 2400-2421 (2018) - [j281]Micha Sharir, Shakhar Smorodinsky, Claudiu Valculescu, Frank de Zeeuw:
Distinct distances between points and lines. Comput. Geom. 69: 2-15 (2018) - [j280]Micha Sharir, Noam Solomon:
Incidences Between Points and Lines on Two- and Three-Dimensional Varieties. Discret. Comput. Geom. 59(1): 88-130 (2018) - [j279]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. Discret. Comput. Geom. 59(3): 725-741 (2018) - [j278]Ariel Bruner, Micha Sharir:
Distinct distances between a collinear set and an arbitrary set of points. Discret. Math. 341(1): 261-265 (2018) - [j277]Dror Aiger, Micha Sharir:
Homotheties and incidences. Discret. Math. 341(7): 2011-2017 (2018) - [j276]Omer Gold, Micha Sharir:
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. ACM Trans. Algorithms 14(4): 50:1-50:17 (2018) - [c234]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of Hypercubes and 3D Minkowski Sums with Random Sizes. ICALP 2018: 10:1-10:15 - [c233]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers Under Translation. ISAAC 2018: 26:1-26:13 - [c232]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing Pairwise Intersecting Disks by Five Points. ISAAC 2018: 50:1-50:12 - [c231]Micha Sharir:
Algebraic Techniques in Geometry: The 10th Anniversary. ISSAC 2018: 1-5 - [c230]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ(n5/3) Time. SODA 2018: 495-514 - [i50]Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir, Max Willert:
Stabbing pairwise intersecting disks by five points. CoRR abs/1801.03158 (2018) - [i49]Pankaj K. Agarwal, Haim Kaplan, Geva Kipper, Wolfgang Mulzer, Günter Rote, Micha Sharir, Allen Xiao:
Approximate Minimum-Weight Matching with Outliers under Translation. CoRR abs/1810.10466 (2018) - 2017
- [j275]Orit E. Raz, Micha Sharir:
The Number of Unit-Area Triangles in the Plane: Theme and Variation. Comb. 37(6): 1221-1240 (2017) - [j274]Orit E. Raz, Micha Sharir, Ilya D. Shkredov:
On the number of unit-area triangles spanned by convex grids in the plane. Comput. Geom. 62: 25-33 (2017) - [j273]Micha Sharir, Noam Solomon:
Incidences Between Points and Lines in $${\mathbb {R}}^4$$. Discret. Comput. Geom. 57(3): 702-756 (2017) - [j272]Micha Sharir, Joshua Zahl:
Cutting algebraic curves into pseudo-segments and applications. J. Comb. Theory A 150: 1-35 (2017) - [j271]Micha Sharir:
Computational Geometry Column 65. SIGACT News 48(2): 68-85 (2017) - [j270]Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir:
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications. ACM Trans. Algorithms 13(2): 26:1-26:42 (2017) - [c229]Micha Sharir:
The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art (Invited Talk). SoCG 2017: 2:1-2:1 - [c228]Esther Ezra, Micha Sharir:
A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM. SoCG 2017: 41:1-41:15 - [c227]Pankaj K. Agarwal, Natan Rubin, Micha Sharir:
Approximate Nearest Neighbor Search Amid Higher-Dimensional Flats. ESA 2017: 4:1-4:13 - [c226]Dror Aiger, Haim Kaplan, Micha Sharir:
Output Sensitive Algorithms for Approximate Incidences and Their Applications. ESA 2017: 5:1-5:13 - [c225]Omer Gold, Micha Sharir:
Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy. ESA 2017: 42:1-42:13 - [c224]Haim Kaplan, Sasanka Roy, Micha Sharir:
Finding Axis-Parallel Rectangles of Fixed Perimeter or Area Containing the Largest Number of Points. ESA 2017: 52:1-52:13 - [c223]Omer Gold, Micha Sharir:
Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. ICALP 2017: 25:1-25:14 - [c222]Omer Gold, Micha Sharir:
Dominance Product and High-Dimensional Closest Pair under L_infty. ISAAC 2017: 39:1-39:12 - [c221]Micha Sharir, Noam Solomon:
Incidences with curves and surfaces in three dimensions, with applications to distinct and repeated distances. SODA 2017: 2456-2475 - [c220]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. SODA 2017: 2476-2494 - [c219]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. SODA 2017: 2495-2504 - [i48]Pawel Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, Oren Weimann:
Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. CoRR abs/1704.02793 (2017) - [i47]Dror Aiger, Micha Sharir:
Homotheties and incidences. CoRR abs/1709.02933 (2017) - [i46]Esther Ezra, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location. CoRR abs/1712.02913 (2017) - 2016
- [j269]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝd. Electron. J. Comb. 23(4): 4 (2016) - [j268]Micha Sharir, József Solymosi:
Distinct Distances from Three Points. Comb. Probab. Comput. 25(4): 623-632 (2016) - [j267]Saarik Kalia, Micha Sharir, Noam Solomon, Ben Yang:
Generalizations of the Szemerédi-Trotter Theorem. Discret. Comput. Geom. 55(3): 571-593 (2016) - [c218]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the k-Level in Three-Dimensional Plane Arrangements. SODA 2016: 1193-1212 - [c217]Boris Aronov, Micha Sharir:
Almost tight bounds for eliminating depth cycles in three dimensions. STOC 2016: 1-8 - [i45]Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Approximating the $k$-Level in Three-Dimensional Plane Arrangements. CoRR abs/1601.04755 (2016) - [i44]Haim Kaplan, Wolfgang Mulzer, Liam Roditty, Paul Seiferth, Micha Sharir:
Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications. CoRR abs/1604.03654 (2016) - [i43]Micha Sharir, Joshua Zahl:
Cutting Algebraic Curves into Pseudo-segments and Applications. CoRR abs/1604.07877 (2016) - [i42]Omer Gold, Micha Sharir:
Dominance Products and Faster Algorithms for High-Dimensional Closest Pair under L∞. CoRR abs/1605.08107 (2016) - [i41]Orit E. Raz, Micha Sharir, Frank de Zeeuw:
The Elekes-Szabó Theorem in four dimensions. CoRR abs/1607.03600 (2016) - [i40]Esther Ezra, Micha Sharir:
The Decision Tree Complexity for k-SUM is at most Nearly Quadratic. CoRR abs/1607.04336 (2016) - [i39]Omer Gold, Micha Sharir:
Dynamic Time Warping: Breaking the Quadratic Barrier. CoRR abs/1607.05994 (2016) - [i38]Boris Aronov, Edward Y. Miller, Micha Sharir:
Eliminating Depth Cycles among Triangles in Three Dimensions. CoRR abs/1607.06136 (2016) - 2015
- [j266]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved Bounds for Incidences Between Points and Circles. Comb. Probab. Comput. 24(3): 490-520 (2015) - [j265]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. Discret. Comput. Geom. 54(4): 871-904 (2015) - [j264]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. Discret. Comput. Geom. 54(4): 905-929 (2015) - [j263]Orit E. Raz, Micha Sharir, József Solymosi:
On Triple Intersections of Three Families of Unit Circles. Discret. Comput. Geom. 54(4): 930-953 (2015) - [j262]Orit E. Raz, Oliver Roche-Newton, Micha Sharir:
Sets with few distinct distances do not have heavy lines. Discret. Math. 338(8): 1484-1492 (2015) - [j261]Tal Kaminker, Micha Sharir:
Finding the largest disk containing a query point in logarithmic time with linear storage. J. Comput. Geom. 6(2): 3-18 (2015) - [j260]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. ACM Trans. Algorithms 11(4): 29:1-29:29 (2015) - [c216]Orit E. Raz, Micha Sharir, Frank de Zeeuw:
Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited. SoCG 2015: 522-536 - [c215]Micha Sharir, Noam Solomon:
Incidences between Points and Lines in Three Dimensions. SoCG 2015: 553-568 - [c214]Orit E. Raz, Micha Sharir:
The Number of Unit-Area Triangles in the Plane: Theme and Variations. SoCG 2015: 569-583 - [c213]Micha Sharir, Adam Sheffer, Noam Solomon:
Incidences with Curves in ℝ d. ESA 2015: 977-988 - [c212]Micha Sharir, Noam Solomon:
Incidences between Points and Lines in R^4. FOCS 2015: 1378-1394 - [i37]Orit E. Raz, Micha Sharir:
The number of unit-area triangles in the plane: Theme and variations. CoRR abs/1501.00379 (2015) - [i36]Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
A faster algorithm for the discrete Fréchet distance under translation. CoRR abs/1501.03724 (2015) - [i35]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Natan Rubin, Micha Sharir:
Stable Delaunay Graphs. CoRR abs/1504.06851 (2015) - [i34]Michael Khanimov, Micha Sharir:
Delaunay Triangulations of Degenerate Point Sets. CoRR abs/1510.04608 (2015) - [i33]Boris Aronov, Micha Sharir:
Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions. CoRR abs/1512.00358 (2015) - [i32]Omer Gold, Micha Sharir:
Improved Bounds for 3SUM, K-SUM, and Linear Degeneracy. CoRR abs/1512.05279 (2015) - 2014
- [j259]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. Discret. Comput. Geom. 52(3): 551-582 (2014) - [j258]Javier Cilleruelo, Micha Sharir, Adam Sheffer:
A note on distinct distances in rectangular lattices. Discret. Math. 336: 37-40 (2014) - [j257]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. SIAM J. Comput. 43(2): 429-449 (2014) - [j256]Boris Aronov, Mark de Berg, Esther Ezra, Micha Sharir:
Improved Bounds for the Union of Locally Fat Objects in the Plane. SIAM J. Comput. 43(2): 543-572 (2014) - [j255]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting Neighbors in High-Dimensional Euclidean Space. SIAM J. Comput. 43(4): 1363-1395 (2014) - [c211]Micha Sharir, Noam Solomon:
Incidences between points and lines in R4: Extended Abstract. SoCG 2014: 189 - [c210]Orit E. Raz, Micha Sharir, József Solymosi:
On triple intersections of three families of unit circles. SoCG 2014: 198 - [c209]Tal Kaminker, Micha Sharir:
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. SoCG 2014: 206 - [c208]Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. SoCG 2014: 251 - [c207]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. SoCG 2014: 377 - [c206]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms. ESA 2014: 100-111 - [i31]Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. CoRR abs/1401.7419 (2014) - [i30]Pankaj K. Agarwal, Haim Kaplan, Natan Rubin, Micha Sharir:
Kinetic Voronoi Diagrams and Delaunay Triangulations under Polygonal Distance Functions. CoRR abs/1404.4851 (2014) - [i29]Sariel Har-Peled, Haim Kaplan, Micha Sharir, Shakhar Smorodinsky:
Epsilon-Nets for Halfspaces Revisited. CoRR abs/1410.3154 (2014) - [i28]Rinat Ben Avraham, Matthias Henze, Rafel Jaume, Balázs Keszegh, Orit E. Raz, Micha Sharir, Igor Tubis:
Partial-Matching and Hausdorff RMS Distance Under Translation: Combinatorics and Algorithms. CoRR abs/1411.7273 (2014) - 2013
- [j254]Boris Aronov, Muriel Dulieu, Rom Pinchasi, Micha Sharir:
On the Union Complexity of Diametral Disks. Electron. J. Comb. 20(2): 53 (2013) - [j253]Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir:
The 2-center problem in three dimensions. Comput. Geom. 46(6): 734-746 (2013) - [j252]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. Comb. Probab. Comput. 22(6): 935-954 (2013) - [j251]Haim Kaplan, Micha Sharir:
Finding the largest Empty Disk containing a Query Point. Int. J. Comput. Geom. Appl. 23(4-5): 335-356 (2013) - [j250]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory A 120(4): 777-794 (2013) - [j249]Micha Sharir, Adam Sheffer, József Solymosi:
Distinct distances on two lines. J. Comb. Theory A 120(7): 1732-1736 (2013) - [j248]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets. II. SIAM J. Comput. 42(6): 2039-2062 (2013) - [c205]Micha Sharir, Adam Sheffer, Joshua Zahl:
Improved bounds for incidences between points and circles. SoCG 2013: 97-106 - [c204]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Union of random minkowski sums and network vulnerability analysis. SoCG 2013: 177-186 - [c203]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. SODA 2013: 156-167 - [c202]Dror Aiger, Haim Kaplan, Micha Sharir:
Reporting neighbors in high-dimensional Euclidean spaces. SODA 2013: 784-803 - [i27]Micha Sharir, Adam Sheffer:
Distinct distances on two lines. CoRR abs/1302.3081 (2013) - [i26]Javier Cilleruelo, Micha Sharir, Adam Sheffer:
On lattices, distinct distances, and the Elekes-Sharir framework. CoRR abs/1306.0242 (2013) - [i25]Tal Kaminker, Micha Sharir:
Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage. CoRR abs/1310.3388 (2013) - [i24]Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection Techniques. CoRR abs/1310.5245 (2013) - [i23]Pankaj K. Agarwal, Sariel Har-Peled, Haim Kaplan, Micha Sharir:
Union of Random Minkowski Sums and Network Vulnerability Analysis. CoRR abs/1310.5647 (2013) - [i22]Micha Sharir, Shai Zaban:
Output-Sensitive Tools for Range Searching in Higher Dimensions. CoRR abs/1312.6305 (2013) - 2012
- [j247]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-Linear Approximation Algorithms for Geometric Hitting Sets. Algorithmica 63(1-2): 1-25 (2012) - [j246]Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir:
Unit Distances in Three Dimensions. Comb. Probab. Comput. 21(4): 597-610 (2012) - [j245]Haim Kaplan, Jirí Matousek, Micha Sharir:
Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Discret. Comput. Geom. 48(3): 499-517 (2012) - [j244]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. SIAM J. Comput. 41(2): 367-390 (2012) - [c201]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. SCG 2012: 189-198 - [c200]Haim Kaplan, Micha Sharir:
Finding the maximal empty disk containing a query point. SCG 2012: 287-292 - [c199]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets II. FOCS 2012: 420-429 - [c198]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. GD 2012: 19-30 - [c197]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 - [i21]Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir:
Computing the Discrete Fréchet Distance in Subquadratic Time. CoRR abs/1204.5333 (2012) - [i20]Micha Sharir, Adam Sheffer, Joshua Zahl:
Incidences between points and non-coplanar circles. CoRR abs/1208.0053 (2012) - [i19]Pankaj K. Agarwal, Jirí Matousek, Micha Sharir:
On Range Searching with Semialgebraic Sets II. CoRR abs/1208.3384 (2012) - [i18]Micha Sharir, Adam Sheffer:
Counting Plane Graphs: Cross-Graph Charging Schemes. CoRR abs/1209.0194 (2012) - 2011
- [j243]Micha Sharir, Adam Sheffer:
Counting Triangulations of Planar Point Sets. Electron. J. Comb. 18(1) (2011) - [j242]Haim Kaplan, Natan Rubin, Micha Sharir:
A kinetic triangulation scheme for moving points in the plane. Comput. Geom. 44(4): 191-205 (2011) - [j241]Micha Sharir:
An Improved Bound for k-Sets in Four Dimensions. Comb. Probab. Comput. 20(1): 119-129 (2011) - [j240]Roel Apfelbaum, Micha Sharir:
Non-Degenerate Spheres in Three Dimensions. Comb. Probab. Comput. 20(4): 503-512 (2011) - [j239]György Elekes, Micha Sharir:
Incidences in Three Dimensions and Distinct Distances in the Plane. Comb. Probab. Comput. 20(4): 571-608 (2011) - [j238]Haim Kaplan, Edgar Ramos, Micha Sharir:
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Discret. Comput. Geom. 45(1): 3-33 (2011) - [j237]Haim Kaplan, Edgar Ramos, Micha Sharir:
The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Discret. Comput. Geom. 45(3): 371-382 (2011) - [j236]Sariel Har-Peled, Micha Sharir:
Relative (p, ε)-Approximations in Geometry. Discret. Comput. Geom. 45(3): 462-496 (2011) - [j235]György Elekes, Haim Kaplan, Micha Sharir:
On lines, joints, and incidences in three dimensions. J. Comb. Theory A 118(3): 962-977 (2011) - [j234]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. J. Comb. Theory A 118(7): 1979-1999 (2011) - [j233]Micha Sharir, Hayim Shaul:
Semialgebraic Range Reporting and Emptiness Searching with Applications. SIAM J. Comput. 40(4): 1045-1074 (2011) - [j232]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) - [c196]Esther Ezra, Boris Aronov, Micha Sharir:
Improved Bound for the Union of Fat Triangles. SODA 2011: 1778-1785 - [c195]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535 - [i17]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) - [i16]Haim Kaplan, Micha Sharir:
Finding the Maximal Empty Rectangle Containing a Query Point. CoRR abs/1106.3628 (2011) - [i15]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique. CoRR abs/1109.5596 (2011) - 2010
- [b3]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 - [b2]Micha Sharir:
Algorithm Derivation by Transformations (reprint). General Books 2010, ISBN 978-1-154-60684-3, pp. 1-21 - [j231]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) - [j230]Roel Apfelbaum, Micha Sharir:
An Improved Bound on the Number of Unit Area Triangles. Discret. Comput. Geom. 44(4): 753-761 (2010) - [j229]Haim Kaplan, Micha Sharir, Eugenii Shustin:
On Lines and Joints. Discret. Comput. Geom. 44(4): 838-843 (2010) - [j228]Boris Aronov, Micha Sharir:
Approximate Halfspace Range Counting. SIAM J. Comput. 39(7): 2704-2725 (2010) - [j227]Boris Aronov, Esther Ezra, Micha Sharir:
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. SIAM J. Comput. 39(7): 3248-3282 (2010) - [j226]Haim Kaplan, Natan Rubin, Micha Sharir:
Line Transversals of Convex Polyhedra in R3. SIAM J. Comput. 39(7): 3283-3310 (2010) - [j225]Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang:
Hausdorff distance under translation for points and balls. ACM Trans. Algorithms 6(4): 71:1-71:26 (2010) - [j224]Ophir Setter, Micha Sharir, Dan Halperin:
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. Trans. Comput. Sci. 9: 1-27 (2010) - [c194]Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir:
The 2-center problem in three dimensions. SCG 2010: 87-96 - [c193]Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir:
Kinetic stable Delaunay graphs. SCG 2010: 127-136 - [c192]Haim Kaplan, Natan Rubin, Micha Sharir:
A kinetic triangulation scheme for moving points in the plane. SCG 2010: 137-146 - [c191]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. SCG 2010: 297-306 - [c190]György Elekes, Micha Sharir:
Incidences in three dimensions and distinct distances in the plane. SCG 2010: 413-422 - [c189]Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir:
Optimal Cover of Points by Disks in a Simple Polygon. ESA (1) 2010: 475-486 - [c188]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. FOCS 2010: 355-364 - [i14]Roel Apfelbaum, Micha Sharir:
An Improved Bound on the Number of Unit Area Triangles. CoRR abs/1001.4764 (2010) - [i13]Haim Kaplan, Natan Rubin, Micha Sharir:
A Kinetic Triangulation Scheme for Moving Points in The Plane. CoRR abs/1005.0912 (2010) - [i12]György Elekes, Micha Sharir:
Incidences in Three Dimensions and Distinct Distances in the Plane. CoRR abs/1005.0982 (2010) - [i11]Natan Rubin, Haim Kaplan, Micha Sharir:
Improved Bounds for Geometric Permutations. CoRR abs/1007.3244 (2010) - [i10]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010) - [i9]Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir:
The 2-Center Problem in Three Dimensions. CoRR abs/1012.2694 (2010)
2000 – 2009
- 2009
- [j223]Haim Kaplan, Natan Rubin, Micha Sharir:
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Algorithmica 55(2): 283-310 (2009) - [j222]Esther Ezra, János Pach, Micha Sharir:
On Regular Vertices of the Union of Planar Convex Objects. Discret. Comput. Geom. 41(2): 216-231 (2009) - [j221]Vladlen Koltun, Micha Sharir:
On Overlays and Minimization Diagrams. Discret. Comput. Geom. 41(3): 385-397 (2009) - [j220]Esther Ezra, Micha Sharir:
On the union of fat tetrahedra in three dimensions. J. ACM 57(1): 2:1-2:23 (2009) - [j219]Gabriel Nivasch, Micha Sharir:
Eppstein's bound on intersecting triangles revisited. J. Comb. Theory A 116(2): 494-497 (2009) - [j218]Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth:
Extremal problems on triangle areas in two and three dimensions. J. Comb. Theory A 116(7): 1177-1198 (2009) - [j217]Ke Chen, Haim Kaplan, Micha Sharir:
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. ACM Trans. Algorithms 5(2): 16:1-16:24 (2009) - [c187]Pankaj K. Agarwal, Esther Ezra, Micha Sharir:
Near-linear approximation algorithms for geometric hitting sets. SCG 2009: 23-32 - [c186]Roel Apfelbaum, Micha Sharir:
An improved bound on the number of unit area triangles. SCG 2009: 135-140 - [c185]Ophir Setter, Micha Sharir, Dan Halperin:
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. ISVD 2009: 43-52 - [c184]Haim Kaplan, Natan Rubin, Micha Sharir:
Line transversals of convex polyhedra in R3. SODA 2009: 170-179 - [c183]Boris Aronov, Esther Ezra, Micha Sharir:
Small-size epsilon-nets for axis-parallel rectangles and boxes. STOC 2009: 639-648 - [i8]György Elekes, Haim Kaplan, Micha Sharir:
On Lines, Joints, and Incidences in Three Dimensions. CoRR abs/0905.1583 (2009) - [i7]Haim Kaplan, Micha Sharir, Eugenii Shustin:
On lines and Joints. CoRR abs/0906.0558 (2009) - [i6]Micha Sharir, Hayim Shaul:
Semi-algebraic Range Reporting and Emptiness Searching with Applications. CoRR abs/0908.4061 (2009) - [i5]Sariel Har-Peled, Micha Sharir:
Relative (p,epsilon)-Approximations in Geometry. CoRR abs/0909.0717 (2009) - [i4]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting Triangulations of Planar Point Sets. CoRR abs/0911.3352 (2009) - 2008
- [j216]Esther Ezra, Micha Sharir, Alon Efrat:
On the performance of the ICP algorithm. Comput. Geom. 41(1-2): 77-93 (2008) - [j215]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. Discret. Comput. Geom. 39(1-3): 17-37 (2008) - [j214]Yevgeny Schreiber, Micha Sharir:
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. Discret. Comput. Geom. 39(1-3): 500-579 (2008) - [j213]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. Discret. Comput. Geom. 39(4): 656-677 (2008) - [j212]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. J. ACM 55(6): 28:1-28:32 (2008) - [j211]János Pach, Micha Sharir:
On planar intersection graphs with forbidden subgraphs. J. Graph Theory 59(3): 205-214 (2008) - [j210]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Efficient Colored Orthogonal Range Counting. SIAM J. Comput. 38(3): 982-1011 (2008) - [j209]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Kinetic and dynamic data structures for closest pair and all nearest neighbors. ACM Trans. Algorithms 5(1): 4:1-4:37 (2008) - [j208]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. ACM Trans. Algorithms 5(1): 5:1-5:20 (2008) - [c182]Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir:
The complexity of the outer face in arrangements of random segments. SCG 2008: 69-78 - [c181]Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth:
Extremal problems on triangle areas in two and three dimensions. SCG 2008: 208-217 - [c180]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 - [c179]Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky:
Weak ε-nets and interval chains. SODA 2008: 1194-1203 - [i3]Gabriel Nivasch, Micha Sharir:
Eppstein's bound on intersecting triangles revisited. CoRR abs/0804.4415 (2008) - [i2]Haim Kaplan, Natan Rubin, Micha Sharir:
Line Transversals of Convex Polyhedra in R3. CoRR abs/0807.1221 (2008) - 2007
- [j207]Giora Alexandron, Haim Kaplan, Micha Sharir:
Kinetic and dynamic data structures for convex hulls and upper envelopes. Comput. Geom. 36(2): 144-158 (2007) - [j206]Esther Ezra, Micha Sharir:
A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. Discret. Comput. Geom. 37(1): 21-41 (2007) - [j205]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. Discret. Comput. Geom. 38(2): 399-441 (2007) - [j204]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) - [j203]Roel Apfelbaum, Micha Sharir:
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. SIAM J. Discret. Math. 21(3): 707-725 (2007) - [c178]Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev:
Bi-criteria linear-time approximations for generalized k-mean/median/center. SCG 2007: 19-26 - [c177]Esther Ezra, János Pach, Micha Sharir:
On regular vertices on the union of planar objects. SCG 2007: 220-226 - [c176]Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir:
Similar simplices in a d-dimensional point set. SCG 2007: 232-238 - [c175]Pankaj K. Agarwal, Haim Kaplan, Micha Sharir:
Computing the volume of the union of cubes. SCG 2007: 294-301 - [c174]Boris Aronov, Sariel Har-Peled, Micha Sharir:
On approximate halfspace range counting and relative epsilon-approximations. SCG 2007: 327-336 - [c173]Micha Sharir:
Arrangements in Geometry: Recent Advances and Challenges. ESA 2007: 12-16 - [c172]Haim Kaplan, Natan Rubin, Micha Sharir:
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. ESA 2007: 287-298 - [c171]Esther Ezra, Micha Sharir:
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. FOCS 2007: 525-535 - [c170]Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin:
Counting colors in boxes. SODA 2007: 785-794 - 2006
- [j202]Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner:
k-Sets in Four Dimensions. Discret. Comput. Geom. 35(2): 177-191 (2006) - [j201]Eduard Oks, Micha Sharir:
Minkowski Sums of Monotone and General Simple Polygons. Discret. Comput. Geom. 35(2): 223-240 (2006) - [j200]Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir:
On the Union of kappa-Round Objects in Three and Four Dimensions. Discret. Comput. Geom. 36(4): 511-526 (2006) - [j199]Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. J. Comb. Theory A 113(3): 385-419 (2006) - [j198]Micha Sharir, Emo Welzl:
On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006) - [j197]Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir:
Computing Maximally Separated Sets in the Plane. SIAM J. Comput. 36(3): 815-834 (2006) - [c169]Yevgeny Schreiber, Micha Sharir:
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. SCG 2006: 30-39 - [c168]Haim Kaplan, Micha Sharir, Elad Verbin:
Colored intersection searching via sparse rectangular matrix multiplication. SCG 2006: 52-60 - [c167]Esther Ezra, Micha Sharir, Alon Efrat:
On the ICP algorithm. SCG 2006: 95-104 - [c166]Micha Sharir, Emo Welzl:
Random triangulations of planar point sets. SCG 2006: 273-281 - [c165]Vladlen Koltun, Micha Sharir:
On overlays and minimization diagrams. SCG 2006: 395-401 - [c164]Dan Feldman, Amos Fiat, Micha Sharir:
Coresets forWeighted Facilities and Their Applications. FOCS 2006: 315-324 - [c163]Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir:
Computing a Center-Transversal Line. FSTTCS 2006: 93-104 - [c162]Haim Kaplan, Micha Sharir:
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. SODA 2006: 484-493 - [c161]Micha Sharir, Emo Welzl:
On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869 - 2005
- [j196]Rom Pinchasi, Micha Sharir:
On Graphs That Do Not Contain The Cube And Related Problems. Comb. 25(5): 615-623 (2005) - [j195]Micha Sharir, Hayim Shaul:
Ray shooting and stone throwing with near-linear storage. Comput. Geom. 30(3): 239-252 (2005) - [j194]Esther Ezra, Micha Sharir:
Counting and representing intersections among triangles in three dimensions. Comput. Geom. 32(3): 196-215 (2005) - [j193]Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between Points and Circles in Three and Higher Dimensions. Discret. Comput. Geom. 33(2): 185-206 (2005) - [j192]Boris Aronov, Vladlen Koltun, Micha Sharir:
Cutting Triangular Cycles of Lines in Space. Discret. Comput. Geom. 33(2): 231-247 (2005) - [j191]Sharona Feldman, Micha Sharir:
An Improved Bound for Joints in Arrangements of Lines in Space. Discret. Comput. Geom. 33(2): 307-320 (2005) - [j190]Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir:
Lines Avoiding Unit Balls in Three Dimensions. Discret. Comput. Geom. 34(2): 231-250 (2005) - [j189]János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth:
Topological Graphs with No Large Grids. Graphs Comb. 21(3): 355-364 (2005) - [j188]Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir:
Crossing patterns of semi-algebraic sets. J. Comb. Theory A 111(2): 310-326 (2005) - [j187]Raimund Seidel, Micha Sharir:
Top-Down Analysis of Path Compression. SIAM J. Comput. 34(3): 515-525 (2005) - [j186]Pankaj K. Agarwal, Micha Sharir:
Pseudo-Line Arrangements: Duality, Algorithms, and Applications. SIAM J. Comput. 34(3): 526-552 (2005) - [j185]Vladlen Koltun, Micha Sharir:
Curve-Sensitive Cuttings. SIAM J. Comput. 34(4): 863-878 (2005) - [j184]Esther Ezra, Micha Sharir:
Output-Sensitive Construction of the Union of Triangles. SIAM J. Comput. 34(6): 1331-1351 (2005) - [j183]Roel Apfelbaum, Micha Sharir:
Repeated Angles in Three and Four Dimensions. SIAM J. Discret. Math. 19(2): 294-300 (2005) - [c160]Micha Sharir:
The interface between computational and combinatorial geometry. SODA 2005: 137-145 - [c159]Micha Sharir, Hayim Shaul:
Ray shooting amid balls, farthest point from a line, and range emptiness searching. SODA 2005: 525-534 - [c158]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 - [c157]Giora Alexandron, Haim Kaplan, Micha Sharir:
Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. WADS 2005: 269-281 - 2004
- [j182]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) - [j181]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) - [j180]Micha Sharir, Emo Welzl:
Point-Line Incidences in Space. Comb. Probab. Comput. 13(2): 203-220 (2004) - [j179]Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct Distances in Three and Higher Dimensions. Comb. Probab. Comput. 13(3): 283-293 (2004) - [j178]Shakhar Smorodinsky, Micha Sharir:
Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres or Rectangles. Comb. Probab. Comput. 13(3): 389-411 (2004) - [j177]Vladlen Koltun, Micha Sharir:
Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. Discret. Comput. Geom. 31(1): 83-124 (2004) - [j176]Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles. Discret. Comput. Geom. 31(2): 207-227 (2004) - [j175]Boris Aronov, Micha Sharir:
Cell Complexities in Hyperplane Arrangements. Discret. Comput. Geom. 32(1): 107-115 (2004) - [j174]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) - [j173]János Pach, Rom Pinchasi, Micha Sharir:
On the number of directions determined by a three-dimensional points set. J. Comb. Theory A 108(1): 1-16 (2004) - [j172]Volker Kaibel, Rafael Mechtel, Micha Sharir, Günter M. Ziegler:
The Simplex Algorithm in Dimension Three. SIAM J. Comput. 34(2): 475-497 (2004) - [c156]Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir:
On lines avoiding unit balls in three dimensions. SCG 2004: 36-45 - [c155]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. SCG 2004: 61-67 - [c154]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. SCG 2004: 76-85 - [c153]Joseph S. B. Mitchell, Micha Sharir:
New results on shortest paths in three dimensions. SCG 2004: 124-133 - [c152]Esther Ezra, Micha Sharir:
Counting and representing intersections among triangles in three dimensions. SCG 2004: 210-219 - [c151]Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir:
On the union of kapa-round objects. SCG 2004: 383-390 - [c150]Rom Pinchasi, Rados Radoicic, Micha Sharir:
On empty convex polygons in a planar point set. SCG 2004: 391-400 - [c149]Gady Kozma, Zvi Lotker, Micha Sharir, Gideon Stupp:
Geometrically aware communication in random wireless networks. PODC 2004: 310-319 - [c148]Eti Ezra, Micha Sharir:
Output-sensitive construction of the union of triangles. SODA 2004: 420-429 - [c147]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 - [r1]Micha Sharir:
Algorithmic motion planning. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 1037-1064 - 2003
- [j171]Micha Sharir:
The Clarkson-Shor Technique Revisited And Extended. Comb. Probab. Comput. 12(2): 191-201 (2003) - [j170]János Pach, Ido Safruti, Micha Sharir:
The Union of Congruent Cubes in Three Dimensions. Discret. Comput. Geom. 30(1): 133-160 (2003) - [j169]Micha Sharir, Shakhar Smorodinsky:
On neighbors in geometric permutations. Discret. Math. 268(1-3): 327-335 (2003) - [j168]Gennady Pustylnik, Micha Sharir:
The Minkowski sum of a simple polygon and a segment. Inf. Process. Lett. 85(4): 179-184 (2003) - [j167]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) - [j166]Vladlen Koltun, Micha Sharir:
The Partition Technique for Overlays of Envelopes. SIAM J. Comput. 32(4): 841-863 (2003) - [c146]János Pach, Rom Pinchasi, Micha Sharir:
A tight bound for the number of different directions in three dimensions. SCG 2003: 106-113 - [c145]Vladlen Koltun, Micha Sharir:
Curve-sensitive cuttings. SCG 2003: 136-143 - [c144]Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang:
Hausdorff distance under translation for points and balls. SCG 2003: 282-291 - [c143]Micha Sharir, Hayim Shaul:
Ray Shooting and Stone Throwing. ESA 2003: 470-481 - [c142]Boris Aronov, János Pach, Micha Sharir, Gábor Tardos:
Distinct distances in three and higher dimensions. STOC 2003: 541-546 - [c141]Boris Aronov, Vladlen Koltun, Micha Sharir:
Cutting triangular cycles of lines in space. STOC 2003: 547-555 - [c140]Micha Sharir, Shakhar Smorodinsky:
Extremal Configurations and Levels in Pseudoline Arrangements. WADS 2003: 127-139 - 2002
- [j165]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) - [j164]Pankaj K. Agarwal, Micha Sharir:
The Number of Congruent Simplices in a Point Set. Discret. Comput. Geom. 28(2): 123-150 (2002) - [j163]Boris Aronov, Micha Sharir:
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. Discret. Comput. Geom. 28(4): 475-490 (2002) - [j162]Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-Center Problem with Obstacles. J. Algorithms 42(1): 109-134 (2002) - [c139]Micha Sharir, Emo Welzl:
Point-line incidences in space. SCG 2002: 107-115 - [c138]Boris Aronov, Vladlen Koltun, Micha Sharir:
Incidences between points and circles in three and higher dimensions. SCG 2002: 116-122 - [c137]Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky:
Lenses in arrangements of pseudo-circles and their applications. SCG 2002: 123-132 - [c136]Vladlen Koltun, Micha Sharir:
Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. SCG 2002: 217-226 - [c135]Vladlen Koltun, Micha Sharir:
Polyhedral Voronoi diagrams of polyhedra in three dimensions. SCG 2002: 227-236 - [c134]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 - [c133]Eti Ezra, Dan Halperin, Micha Sharir:
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice. ESA 2002: 473-484 - [c132]Vladlen Koltun, Micha Sharir:
The Partition Technique for Overlays of Envelopes. FOCS 2002: 637- - [c131]Pankaj K. Agarwal, Micha Sharir:
Pseudo-line arrangements: duality, algorithms, and applications. SODA 2002: 800-809 - [c130]Vladlen Koltun, Micha Sharir:
On the overlay of envelopes in four dimensions. SODA 2002: 810-819 - [c129]Micha Sharir, Shakhar Smorodinsky:
On Neighbors in Geometric Permutations. SWAT 2002: 131-139 - 2001
- [j161]Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir:
On the Number of Regular Vertices of the Union of Jordan Regions. Discret. Comput. Geom. 25(2): 203-220 (2001) - [j160]Sariel Har-Peled, Micha Sharir:
Online Point Location in Planar Arrangements and Its Applications. Discret. Comput. Geom. 26(1): 19-40 (2001) - [j159]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions. Discret. Comput. Geom. 26(2): 195-204 (2001) - [j158]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discret. Comput. Geom. 26(3): 307-320 (2001) - [j157]Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir:
On the Complexity of Arrangements of Circles in the Plane. Discret. Comput. Geom. 26(4): 465-492 (2001) - [j156]János Pach, Micha Sharir:
Radial Points in the Plane. Eur. J. Comb. 22(6): 855-863 (2001) - [c128]Pankaj K. Agarwal, Micha Sharir:
On the number of congruent simplices in a point. SCG 2001: 1-9 - [c127]János Pach, Ido Safruti, Micha Sharir:
The union of congruent cubes in three dimensions. SCG 2001: 19-28 - [c126]Adrian Dumitrescu, Joseph S. B. Mitchell, Micha Sharir:
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles. SCG 2001: 141-150 - [c125]Micha Sharir:
The Clarkson-Shor technique revisited and extended. SCG 2001: 252-256 - [c124]Micha Sharir, Emo Welzl:
Balanced lines, halving triangles, and the generalized lower bound theorem. SCG 2001: 315-318 - [c123]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
On the Complexity of Many Faces in Arrangements of Circles. FOCS 2001: 74-83 - [c122]Sariel Har-Peled, Micha Sharir:
Online point location in planar arrangements and its applications. SODA 2001: 57-66 - [c121]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 - 2000
- [j155]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) - [j154]Alon Efrat, Micha Sharir:
On the Complexity of the Union of Fat Convex Objects in the Plane. Discret. Comput. Geom. 23(2): 171-189 (2000) - [j153]Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls in Rd. Discret. Comput. Geom. 23(2): 247-259 (2000) - [j152]Pankaj K. Agarwal, Micha Sharir:
Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Discret. Comput. Geom. 24(4): 645-657 (2000) - [j151]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir:
Approximation Algorithms for Minimum-Width Annuli and Shells. Discret. Comput. Geom. 24(4): 687-705 (2000) - [j150]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) - [c120]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An improved bound for k-sets in three dimensions. SCG 2000: 43-49 - [c119]Dan Halperin, Micha Sharir, Kenneth Y. Goldberg:
The 2-center problem with obstacles. SCG 2000: 80-90 - [c118]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Exact and approximation algorithms for minimum-width cylindrical shells. SODA 2000: 510-517 - [c117]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 - [p5]Pankaj K. Agarwal, Micha Sharir:
Davenport-Schinzel Sequences and Their Geometric Applications. Handbook of Computational Geometry 2000: 1-47 - [p4]Pankaj K. Agarwal, Micha Sharir:
Arrangements and Their Applications. Handbook of Computational Geometry 2000: 49-119 - [i1]Micha Sharir, Shakhar Smorodinsky, Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions. EuroCG 2000: 132-135
1990 – 1999
- 1999
- [j149]Gill Barequet, Micha Sharir:
Partial surface matching by using directed footprints. Comput. Geom. 12(1-2): 45-62 (1999) - [j148]János Pach, Micha Sharir:
On the Boundary of the Union of Planar Convex Sets. Discret. Comput. Geom. 21(3): 321-328 (1999) - [j147]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Discret. Comput. Geom. 21(3): 373-388 (1999) - [j146]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Motion Planning for a Convex Polygon in a Polygonal Environment. Discret. Comput. Geom. 22(2): 201-221 (1999) - [j145]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) - [c116]Marc J. van Kreveld, Joseph S. B. Mitchell, Peter J. Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann:
Efficient Algorithms for Maximum Regression Depth. SCG 1999: 31-40 - [c115]Pankaj K. Agarwal, Micha Sharir:
Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. SCG 1999: 143-153 - [c114]Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir:
Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. SCG 1999: 380-389 - [c113]Shakhar Smorodinsky, Joseph S. B. Mitchell, Micha Sharir:
Sharp Bounds on Geometric Permutations of Pairwise Disjoint Balls inRd. SCG 1999: 400-406 - [c112]Micha Sharir:
Recent Developments in the Theory of Arrangements of Surfaces. FSTTCS 1999: 1-20 - [c111]Pankaj K. Agarwal, Micha Sharir:
Motion Planning of a Ball Amid Segments in Three Dimensions. SODA 1999: 21-30 - 1998
- [j144]János Pach, Micha Sharir:
On the Number of Incidences Between Points and Curves. Comb. Probab. Comput. 7(1): 121-127 (1998) - [j143]Pankaj K. Agarwal, Micha Sharir:
Efficient Algorithms for Geometric Optimization. ACM Comput. Surv. 30(4): 412-458 (1998) - [j142]Pankaj K. Agarwal, Nina Amenta, Micha Sharir:
Largest Placement of One Convex Polygon Inside Another. Discret. Comput. Geom. 19(1): 95-104 (1998) - [j141]Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir:
On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Discret. Comput. Geom. 19(3): 315-331 (1998) - [j140]Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec:
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. Discret. Comput. Geom. 19(4): 485-519 (1998) - [j139]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
The Discrete 2-Center Problem. Discret. Comput. Geom. 20(3): 287-305 (1998) - [j138]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) - [c110]Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir:
On the Number of Regular Vertices of the Union of Jordan Regions. SWAT 1998: 322-334 - 1997
- [j137]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. Comput. Aided Des. 29(9): 672 (1997) - [j136]Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. Comb. 17(1): 1-9 (1997) - [j135]Boris Aronov, Micha Sharir:
The Common Exterior of Convex Polygons in the Plane. Comput. Geom. 8: 139-149 (1997) - [j134]Klara Kedem, Micha Sharir, Sivan Toledo:
On Critical Orientations in the Kedem-Sharir Motion Planning Algorithm. Discret. Comput. Geom. 17(2): 227-239 (1997) - [j133]Micha Sharir:
A Near-Linear Algorithm for the Planar 2-Center Problem. Discret. Comput. Geom. 18(2): 125-134 (1997) - [j132]Otfried Schwarzkopf, Micha Sharir:
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces. Discret. Comput. Geom. 18(3): 269-288 (1997) - [j131]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) - [j130]Shai Mohaban, Micha Sharir:
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems. SIAM J. Comput. 26(3): 654-674 (1997) - [j129]Matthew J. Katz, Micha Sharir:
An Expander-Based Approach to Geometric Optimization. SIAM J. Comput. 26(5): 1384-1408 (1997) - [j128]Boris Aronov, Micha Sharir, Boaz Tagansky:
The Union of Convex Polyhedra in Three Dimensions. SIAM J. Comput. 26(6): 1670-1688 (1997) - [j127]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Computing Envelopes in Four Dimensions with Applications. SIAM J. Comput. 26(6): 1714-1732 (1997) - [j126]Boris Aronov, Micha Sharir:
On Translational Motion Planning of a Convex Polyhedron in 3-Space. SIAM J. Comput. 26(6): 1785-1803 (1997) - [c109]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
On Levels in Arrangements of Lines, Segments, Planes, and Triangles. SCG 1997: 30-38 - [c108]Alon Efrat, Micha Sharir:
On the Complexity of the Union of Fat Objects in the Plane. SCG 1997: 104-112 - [c107]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
The Discrete 2-Center Problem. SCG 1997: 147-155 - [c106]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. SODA 1997: 483-492 - [c105]Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir:
Dynamic Data Structures for Fat Objects and Their Applications. WADS 1997: 297-306 - 1996
- [j125]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi:
Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996) - [j124]Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996) - [j123]Gill Barequet, Micha Sharir:
Piecewise-Linear Interpolation between Polygonal Slices. Comput. Vis. Image Underst. 63(2): 251-272 (1996) - [j122]Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir:
The Overlay of Lower Envelopes and Its Applications. Discret. Comput. Geom. 15(1): 1-13 (1996) - [j121]Dan Halperin, Micha Sharir:
A Near-Quadratic Algorithm for Planning the Motion of a Polygon in a Polygonal Environment. Discret. Comput. Geom. 16(2): 121-134 (1996) - [j120]Alon Efrat, Micha Sharir:
A Near-Linear Algorithm for the Planar Segment-Center Problem. Discret. Comput. Geom. 16(3): 239-257 (1996) - [j119]Pankaj K. Agarwal, Micha Sharir:
Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Discret. Comput. Geom. 16(4): 317-337 (1996) - [j118]Micha Sharir:
Excess in Arrangements of Segments. Inf. Process. Lett. 58(5): 245-247 (1996) - [j117]Pankaj K. Agarwal, Micha Sharir:
Ray Shooting Amidst Convex Polygons in 2D. J. Algorithms 21(3): 508-519 (1996) - [j116]Pankaj K. Agarwal, Micha Sharir:
Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. SIAM J. Comput. 25(1): 100-116 (1996) - [c104]Otfried Schwarzkopf, Micha Sharir:
Vertical Decomposition of a Single Cell in a Three-Dimensional Arrangement of Surfaces and Its Applications. SCG 1996: 20-29 - [c103]Micha Sharir:
A Near-Linear Algorithm for the Planar 2-Center Problem. SCG 1996: 106-112 - [c102]Micha Sharir, Emo Welzl:
Rectilinear and Polygonal p-Piercing and p-Center Problems. SCG 1996: 122-132 - [c101]Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan:
Approximating Shortest Paths on a Convex Polytope in Three Dimensions. SCG 1996: 329-338 - [c100]Gill Barequet, Micha Sharir:
Partial Surface Matching by Using Directed Footprints. SCG 1996: C-9-C-10 - [c99]Micha Sharir:
Arrangements of Curves and Surfaces in Computational Geometry. ISTCS 1996: 44-50 - [c98]Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir:
Efficient Generation of k-Directional Assembly Sequences. SODA 1996: 122-131 - 1995
- [b1]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 - [j115]Gill Barequet, Micha Sharir:
Filling gaps in the boundary of a polyhedron. Comput. Aided Geom. Des. 12(2): 207-229 (1995) - [j114]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
Computing Depth Orders for Fat Objects and Related Problems. Comput. Geom. 5: 187-206 (1995) - [j113]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. 13: 1-15 (1995) - [j112]Bernard Chazelle, Jirí Matousek, Micha Sharir:
An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discret. Comput. Geom. 13: 363-381 (1995) - [j111]Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. Discret. Comput. Geom. 14(2): 113-122 (1995) - [j110]Dan Halperin, Micha Sharir:
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. Discret. Comput. Geom. 14(4): 385-410 (1995) - [j109]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) - [c97]Pankaj K. Agarwal, Alon Efrat, Micha Sharir:
Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. SCG 1995: 39-50 - [c96]Jean-Daniel Boissonnat, Micha Sharir, Boaz Tagansky, Mariette Yvinec:
Voronoi Diagrams in Higher Dimensions under Certain Polyhedral Distance Functions. SCG 1995: 79-88 - [c95]Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir:
The Overlay of Lower Envelopes in Three Dimensions and Its Applications. SCG 1995: 182-189 - [c94]Pankaj K. Agarwal, Micha Sharir:
Efficient Randomized Algorithms for Some Geometric Optimization Problems. SCG 1995: 326-335 - [c93]Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir:
Quasi-Planar Graphs Have a Linear Number of Edges. GD 1995: 1-7 - [c92]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 - [c91]Micha Sharir:
Arrangements in Higher Dimensions: Voronoi Diagrams, Motion Planning, and Other Applications. WADS 1995: 109-121 - [p3]Pankaj K. Agarwal, Micha Sharir:
Algorithmic Techniques for Geometric Optimization. Computer Science Today 1995: 234-253 - 1994
- [j108]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994) - [j107]Pankaj K. Agarwal, Micha Sharir:
Planar Geometric Location Problems. Algorithmica 11(2): 185-195 (1994) - [j106]Mark H. Overmars, Micha Sharir:
An Improved Technique for Output-Sensitive Hidden Surface Removal. Algorithmica 11(5): 469-484 (1994) - [j105]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) - [j104]Micha Sharir, Sivan Toledo:
External Polygon Containment Problems. Comput. Geom. 4: 99-118 (1994) - [j103]Alon Efrat, Micha Sharir, Alon Ziv:
Computing the Smallest K-enclosing Circle and Related Problems. Comput. Geom. 4: 119-136 (1994) - [j102]Boris Aronov, Micha Sharir:
Castles in the Air Revisited. Discret. Comput. Geom. 12: 119-150 (1994) - [j101]Pankaj K. Agarwal, Micha Sharir:
On the Number of Views of Polyhedral Terrains. Discret. Comput. Geom. 12: 177-182 (1994) - [j100]Dan Halperin, Micha Sharir:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visbility in Terrains. Discret. Comput. Geom. 12: 313-326 (1994) - [j99]Micha Sharir:
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. Discret. Comput. Geom. 12: 327-345 (1994) - [j98]Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994) - [j97]John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles. J. ACM 41(4): 764-790 (1994) - [j96]Pankaj K. Agarwal, Micha Sharir, Sivan Toledo:
Applications of Parametric Searching in Geometric Optimization. J. Algorithms 17(3): 292-318 (1994) - [j95]Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. J. Comb. Theory A 65(2): 311-321 (1994) - [j94]Micha Sharir:
On Joints in Arrangements of Lines in Space and Related Problems. J. Comb. Theory A 67(1): 89-99 (1994) - [j93]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) - [j92]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) - [c90]Dan Halperin, Micha Sharir:
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions. SCG 1994: 11-20 - [c89]Boris Aronov, Micha Sharir:
On Translational Motion Planning in 3-Space. SCG 1994: 21-30 - [c88]Gill Barequet, Micha Sharir:
Piecewise-Linear Interpolation Between Polygonal Slices. SCG 1994: 93-102 - [c87]Pankaj K. Agarwal, Boris Aronov, Micha Sharir:
Computing Envelopes in Four Dimensions with Applications. SCG 1994: 348-358 - [c86]Gill Barequet, Micha Sharir:
Partial surface and volume matching in three dimensions. ICPR (2) 1994: 610-614 - [c85]Alon Efrat, Micha Sharir:
A Near-Linear Algorithm for the Planar Segment Center Problem. SODA 1994: 87-97 - [c84]Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir:
Computing Depth Orders and Related Problems. SWAT 1994: 1-12 - 1993
- [j91]Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. Algorithmica 9(5): 495-514 (1993) - [j90]Micha Sharir:
k-sets and random hulls. Comb. 13(4): 483-496 (1993) - [j89]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) - [j88]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) - [j87]Pankaj K. Agarwal, Micha Sharir:
Applications of a New Space-Partitioning Technique. Discret. Comput. Geom. 9: 11-38 (1993) - [j86]Boris Aronov, Marco Pellegrini, Micha Sharir:
On the Zone of a Surface in a Hyperplane Arrangement. Discret. Comput. Geom. 9: 177-186 (1993) - [j85]Daniel P. Huttenlocher, Klara Kedem, Micha Sharir:
The Upper Envelope of voronoi Surfaces and Its Applications. Discret. Comput. Geom. 9: 267-291 (1993) - [j84]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching. Discret. Comput. Geom. 10: 183-196 (1993) - [j83]Boris Aronov, Daniel Q. Naiman, János Pach, Micha Sharir:
An Invariant Property of Balls in Arrangements of Hyperplanes. Discret. Comput. Geom. 10: 421-425 (1993) - [j82]Pankaj K. Agarwal, Micha Sharir:
Circular visibility of a simple polygon from a fixed point. Int. J. Comput. Geom. Appl. 3(1): 1-25 (1993) - [j81]Matthew J. Katz, Micha Sharir:
Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993) - [j80]Pankaj K. Agarwal, Micha Sharir:
Circle Shooting in a Simple Polygon. J. Algorithms 14(1): 69-87 (1993) - [j79]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) - [j78]Herbert Edelsbrunner, Raimund Seidel, Micha Sharir:
On the Zone Theorem for Hyperplane Arrangements. SIAM J. Comput. 22(2): 418-429 (1993) - [j77]Pankaj K. Agarwal, Marco Pellegrini, Micha Sharir:
Counting Circular Arc Intersections. SIAM J. Comput. 22(4): 778-793 (1993) - [j76]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) - [c83]Pankaj K. Agarwal, Micha Sharir:
On the Number of Views of Polyhedral Terrains. CCCG 1993: 55-60 - [c82]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 - [c81]Leonidas J. Guibas, Dan Halperin, Jirí Matousek, Micha Sharir:
On Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions. CCCG 1993: 127-132 - [c80]Matthew J. Katz, Micha Sharir:
Optimal Slope Selection Via Expanders. CCCG 1993: 139-144 - [c79]Micha Sharir:
Arrangements of Surfaces in Higher Dimensions: Envelopes Single Cells and Other Recent Developments. CCCG 1993: 181-186 - [c78]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 - [c77]Alon Efrat, Micha Lindenbaum, Micha Sharir:
Finding Maximally Consistent Sets of Halfspaces. CCCG 1993: 432-436 - [c76]Dan Halperin, Micha Sharir:
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains. SCG 1993: 11-18 - [c75]Matthew J. Katz, Micha Sharir:
An Expander-Based Approach to Geometric Optimization. SCG 1993: 198-207 - [c74]Y. B. Karasik, Micha Sharir:
The Power of Geometric Duality and Minkowski Sums in Optical Computational Geometry. SCG 1993: 379-388 - [c73]Estarose Wolfson, Micha Sharir:
Implementation of a Motion Planning System in Three Dimensions. SCG 1993: 399-400 - [c72]Dan Halperin, Micha Sharir:
Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment. FOCS 1993: 382-391 - [c71]Micha Sharir:
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions. FOCS 1993: 498-507 - [c70]Boris Aronov, Micha Sharir:
The Union of Convex Polyhedra in Three Dimensions. FOCS 1993: 518-527 - [c69]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 - [c68]Pankaj K. Agarwal, Micha Sharir:
Ray Shooting Amidst Convex Polytopes in Three Dimensions. SODA 1993: 260-270 - [c67]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 - [c66]Alon Efrat, Micha Sharir, Alon Ziv:
Computing the Smallest k-Enclosing Circle and Related Problems. WADS 1993: 325-336 - 1992
- [j75]Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. Algorithmica 7(4): 381-413 (1992) - [j74]Jacob T. Schwartz, Micha Sharir:
Finding Effective "Force Targets" for Two-Dimensional Multifinger Frictional Grips. Algorithmica 8(1): 1-20 (1992) - [j73]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) - [j72]Boris Aronov, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The number of edges of many faces in a line segment arrangement. Comb. 12(3): 261-274 (1992) - [j71]Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with Small Union Size. Comput. Geom. 2: 223-234 (1992) - [j70]János Pach, Micha Sharir:
Repeated Angles in the Plane and Related Problems. J. Comb. Theory A 59(1): 12-22 (1992) - [j69]Dan Halperin, Mark H. Overmars, Micha Sharir:
Efficient Motion Planning for an L-Shaped Object. SIAM J. Comput. 21(1): 1-23 (1992) - [j68]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) - [j67]Micha Sharir, Mark H. Overmars:
A Simple Output-Sensitive Algorithm for Hidden Surface Removal. ACM Trans. Graph. 11(1): 1-11 (1992) - [c65]Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. SCG 1992: 1-8 - [c64]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Diameter, Width, Closest Line Pair, and Parametric Searching. SCG 1992: 120-129 - [c63]Boris Aronov, Micha Sharir:
Castles in the Air Revisited. SCG 1992: 146-156 - [c62]Y. B. Karasik, Micha Sharir:
Optical Computational Geometry. SCG 1992: 232-241 - [c61]Pankaj K. Agarwal, Micha Sharir, Sivan Toledo:
Applications of Parametric Searching in Geometric Optimization. SODA 1992: 72-82 - [c60]Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93 - [c59]Micha Sharir, Emo Welzl:
A Combinatorial Bound for Linear Programming and Related Problems. STACS 1992: 569-579 - 1991
- [j66]Micha Sharir, Shmuel Sifrony:
Coordinated Motion Planning for Two Independent Robots. Ann. Math. Artif. Intell. 3(1): 107-130 (1991) - [j65]Mark H. Overmars, Micha Sharir:
Merging Visibility Maps. Comput. Geom. 1: 35-49 (1991) - [j64]Pankaj K. Agarwal, Micha Sharir:
Off-line Dynamic Maintenance of the Width of a Planar Point Set. Comput. Geom. 1: 65-78 (1991) - [j63]Dan Halperin, Micha Sharir:
Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. Comput. Geom. 1: 269-303 (1991) - [j62]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. Comput. Geom. 1: 305-323 (1991) - [j61]Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. 6: 435-442 (1991) - [j60]Micha Sharir:
On k-Sets in Arrangement of Curves and Surfaces. Discret. Comput. Geom. 6: 593-613 (1991) - [j59]Micha Sharir, Steven Skiena:
Tight bounds on a problem of lines and intersections. Discret. Math. 89(3): 313-314 (1991) - [j58]Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 40(4): 189-192 (1991) - [j57]János Pach, Micha Sharir:
On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm. SIAM J. Comput. 20(3): 460-470 (1991) - [j56]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. 84(1): 77-105 (1991) - [c58]Herbert Edelsbrunner, Raimund Seidel, Micha Sharir:
On the Zone Theorem for Hyperplane Arrangements. New Results and New Trends in Computer Science 1991: 108-123 - [c57]Pankaj K. Agarwal, Micha Sharir:
Counting Circular Arc Intersections. SCG 1991: 10-20 - [c56]Matthew J. Katz, Mark H. Overmars, Micha Sharir:
Efficient Hidden Surface Removal for Objects with small Union Size. SCG 1991: 31-40 - [c55]Daniel P. Huttenlocher, Klara Kedem, Micha Sharir:
The Upper Envelope of Voronoi Surfaces and Its Applications. SCG 1991: 194-203 - [c54]Boris Aronov, Jirí Matousek, Micha Sharir:
On the Sum of Squares of Cell Complexities in Hyperplane Arrangements. SCG 1991: 307-313 - [c53]Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. FOCS 1991: 49-58 - [c52]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink:
Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646 - [c51]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink:
Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448 - [c50]Pankaj K. Agarwal, Micha Sharir:
Planar Geometric Location Problems and Maintaining the Width of a Planar Set. SODA 1991: 449-458 - [c49]Boris Aronov, Micha Sharir:
On the Zone of a Surface in a Hyperplane Arrangement. WADS 1991: 13-19 - [c48]Pankaj K. Agarwal, Micha Sharir:
Applications of a New Space Partitioning Technique. WADS 1991: 379-391 - 1990
- [j55]Mark H. Overmars, Haijo Schipper, Micha Sharir:
Storing Line Segments in Partition Trees. BIT 30(3): 385-403 (1990) - [j54]Boris Aronov, Micha Sharir:
Triangles in space or building (and analyzing) castles in the air. Comb. 10(2): 137-173 (1990) - [j53]Imre Bárány, Micha Sharir:
The Caratheodory number for the k-core. Comb. 10(2): 185-194 (1990) - [j52]Herbert Edelsbrunner, Micha Sharir:
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n-2. Discret. Comput. Geom. 5: 35-42 (1990) - [j51]Klara Kedem, Micha Sharir:
An Efficient Motion-planning Algorithm for a Convex Polygonal Object in Two Dimensional Polygonal Space. Discret. Comput. Geom. 5: 43-75 (1990) - [j50]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. 5: 99-160 (1990) - [j49]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity and Construction of Many Faces in Arrangement of Lines and of Segments. Discret. Comput. Geom. 5: 161-196 (1990) - [j48]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity of Many Cells in Arrangements of Planes and Related Problems. Discret. Comput. Geom. 5: 197-216 (1990) - [j47]Bernard Chazelle, Micha Sharir:
An Algorithm for Generalized Point Location and its Applications. J. Symb. Comput. 10(3/4): 281-310 (1990) - [j46]Jacob T. Schwartz, Micha Sharir:
On the Two-Dimensional Davenport Schinzel Problem. J. Symb. Comput. 10(3/4): 371-393 (1990) - [j45]Pankaj K. Agarwal, Micha Sharir:
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SIAM J. Comput. 19(2): 297-321 (1990) - [c47]Bernard Chazelle, Micha Sharir, Emo Welzl:
Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. SCG 1990: 23-33 - [c46]Sylvain E. Cappell, Jacob E. Goodman, János Pach, Richard Pollack, Micha Sharir, Rephael Wenger:
The Combinatorial Complexity of Hyperplane Transversals. SCG 1990: 83-91 - [c45]Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger:
Points and Triangles in the Plane and Halving Planes in Space. SCG 1990: 112-115 - [c44]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir:
Slimming Down by Adding: Selecting Heavily Covered Points. SCG 1990: 116-127 - [c43]Mark H. Overmars, Micha Sharir:
Merging Visibility Maps. SCG 1990: 168-176 - [c42]Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri:
Selecting Distances in the Plane. SCG 1990: 321-331 - [c41]Herbert Edelsbrunner, Micha Sharir:
A Hyperplane Incidence Problem with Applications to Counting Distances. Applied Geometry And Discrete Mathematics 1990: 253-264 - [c40]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. FOCS 1990: 242-251 - [c39]Leonidas J. Guibas, Donald E. Knuth, Micha Sharir:
Randomized Incremental Construction of Delaunay and Voronoi Diagrams. ICALP 1990: 414-431 - [c38]Herbert Edelsbrunner, Micha Sharir:
A Hyperplane Incidence Problem with Applications to Counting Distances. SIGAL International Symposium on Algorithms 1990: 419-428 - [p2]Jacob T. Schwartz, Micha Sharir:
Algorithmic Motion Planning in Robotics. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 391-430 - [p1]Klara Kedem, Micha Sharir:
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. Autonomous Robot Vehicles 1990: 349-362
1980 – 1989
- 1989
- [j44]Micha Sharir:
Algorithmic Motion Planning in Robotics. Computer 22(3): 9-20 (1989) - [j43]János Pach, Micha Sharir:
The Upper Envelope of Piecewise Linear Functions and the Boundary of a Region Enclosed by Convex Plates: Combinatorial Analysis. Discret. Comput. Geom. 4: 291-309 (1989) - [j42]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications. Discret. Comput. Geom. 4: 311-336 (1989) - [j41]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4: 433-466 (1989) - [j40]Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony:
On the General Motion-Planning Problem with Two Degrees of Freedom. Discret. Comput. Geom. 4: 491-521 (1989) - [j39]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. Discret. Comput. Geom. 4: 523-539 (1989) - [j38]Richard Pollack, Micha Sharir, Günter Rote:
Computing the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 4: 611-626 (1989) - [j37]Micha Sharir:
A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder. Inf. Process. Lett. 32(4): 187-190 (1989) - [j36]Pankaj K. Agarwal, Micha Sharir, Peter W. Shor:
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. J. Comb. Theory A 52(2): 228-274 (1989) - [j35]Richard Cole, Micha Sharir:
Visibility Problems for Polyhedral Terrains. J. Symb. Comput. 7(1): 11-30 (1989) - [c37]Mark H. Overmars, Micha Sharir:
Output-Sensitive Hidden Surface Removal. FOCS 1989: 598-603 - [c36]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP 1989: 179-193 - [c35]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Lines in Space-Combinatorics, Algorithms and Applications. STOC 1989: 382-393 - 1988
- [j34]Jacob T. Schwartz, Micha Sharir:
A Survey of Motion Planning and Related Geometric Algorithms. Artif. Intell. 37(1-3): 157-169 (1988) - [j33]Micha Sharir:
Improved lower bounds on the length of Davenport - Schinzel sequences. Comb. 8(1): 117-124 (1988) - [j32]Ady Wiernik, Micha Sharir:
Planar Realizations of Nonlinear Davenport-Schnitzel Sequences by Segments. Discret. Comput. Geom. 3: 15-47 (1988) - [j31]Ricky Pollack, Micha Sharir, Shmuel Sifrony:
Separating Two Simple Polygons by a Sequence of Translations. Discret. Comput. Geom. 3: 123-136 (1988) - [j30]William J. 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. Discret. Comput. Geom. 3: 281-293 (1988) - [j29]Micha Sharir:
The Shortest Watchtower and Related Problems for Polyhedral Terrains. Inf. Process. Lett. 29(5): 265-270 (1988) - [j28]Avikam Baltsan, Micha Sharir:
On the shortest paths between two convex polyhedra. J. ACM 35(2): 267-287 (1988) - [c34]Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
The Complexity of Many Faces in Arrangements of Lines and of Segments. SCG 1988: 44-55 - [c33]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - [c32]Pankaj K. Agarwal, Micha Sharir:
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. SCG 1988: 70-80 - [c31]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. SCG 1988: 258-265 - [c30]Leonidas J. Guibas, Micha Sharir, Shmuel Sifrony:
On the General Motion Planning Problem with Two Degrees of Freedom. SCG 1988: 289-298 - [c29]Micha Sharir, Shmuel Sifrony:
Coordinated Motion Planning for Two Independent Robots. SCG 1988: 319-328 - [c28]Klara Kedem, Micha Sharir:
An Automatic Motion Planning System for a Convex Polygonal Mobile Robot in 2-Dimensional Polygonal Space. SCG 1988: 329-340 - [c27]Boris Aronov, Micha Sharir:
Triangles in Space or Building (and Analyzing) Castles in the Air. SCG 1988: 381-391 - [c26]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. FOCS 1988: 568-579 - [c25]Herbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir:
Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. ICALP 1988: 214-229 - [c24]James Demmel, Gerardo Lafferriere, Jacob T. Schwartz, Micha Sharir:
Theoretical and experimental studies using a multifinger planar manipulator. ICRA 1988: 390-395 - [c23]Leonidas J. Guibas, Mark H. Overmars, Micha Sharir:
Intersecting Line Segments, Ray Shooting, and Other Applications of Geometric Partitioning Techniques. SWAT 1988: 64-73 - 1987
- [j27]Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap:
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Algorithmica 2: 27-59 (1987) - [j26]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. Algorithmica 2: 209-233 (1987) - [j25]Shmuel Sifrony, Micha Sharir:
A New Efficient Motion-Planning Algorithm for a Rod in Two-Dimensional Polygonal Space. Algorithmica 2: 367-402 (1987) - [j24]Bhubaneswar Mishra, Jacob T. Schwartz, Micha Sharir:
On the Existence and Synthesis of Multifinger Positive Grips. Algorithmica 2: 541-558 (1987) - [j23]Micha Sharir:
Almost linear upper bounds on the length of general Davenport-Schinzel sequences. Comb. 7(1): 131-143 (1987) - [j22]Daniel Leven, Micha Sharir:
Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams. Discret. Comput. Geom. 2: 9-31 (1987) - [j21]Daniel Leven, Micha Sharir:
On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space. Discret. Comput. Geom. 2: 255-270 (1987) - [j20]Daniel Leven, Micha Sharir:
An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers. J. Algorithms 8(2): 192-215 (1987) - [j19]Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-Hulls and Related Problems. SIAM J. Comput. 16(1): 61-77 (1987) - [j18]Micha Sharir:
On Shortest Paths Amidst Convex Polyhedra. SIAM J. Comput. 16(3): 561-572 (1987) - [c22]William J. 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. SCG 1987: 1-10 - [c21]Herbert Edelsbrunner, János Pach, Jacob T. Schwartz, Micha Sharir:
On the Lower Envelope of Bivariate Functions and its Applications. FOCS 1987: 27-37 - [c20]Jacob T. Schwartz, Micha Sharir:
On the Bivariate Function Minimization Problem And Its Applications to Motion Planning. ICALP 1987: 357-363 - [c19]Micha Sharir:
Efficient algorithms for planning purely translational collision-free motion in two and three dimensions. ICRA 1987: 1326-1331 - 1986
- [j17]Sergiu Hart, Micha Sharir:
Nonlinearity of Davenport - Schinzel sequences and of generalized path compression schemes. Comb. 6(2): 151-178 (1986) - [j16]Klara Kedem, Ron Livne, János Pach, Micha Sharir:
On the Union of Jordan Regions and Collision-Free Translational Motion Amidst Polygonal Obstacles. Discret. Comput. Geom. 1: 59-70 (1986) - [j15]Sergiu Hart, Micha Sharir:
Probabilistic Propositional Temporal Logics. Inf. Control. 70(2/3): 97-155 (1986) - [j14]C. Marc Bastuscheck, Edith Schonberg, Jacob T. Schwartz, Micha Sharir:
Object recognition by three-dimensional curve matching. Int. J. Intell. Syst. 1(2): 105-132 (1986) - [j13]Micha Sharir, Amir Schorr:
On Shortest Paths in Polyhedral Spaces. SIAM J. Comput. 15(1): 193-215 (1986) - [c18]Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan:
Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. SCG 1986: 1-13 - [c17]Shmuel Sifrony, Micha Sharir:
A New Efficient Motion-Planning Algorithm for a Rod in Polygonal Space. SCG 1986: 178-186 - [c16]Micha Sharir, Avikam Baltsan:
On Shortest Paths Amidst Convex Polyhedra. SCG 1986: 193-206 - [c15]Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony:
Geometric Applications of Davenport-Schinzel Sequences. FOCS 1986: 77-86 - 1985
- [j12]Micha Sharir:
Intersection and Closest-Pair Problems for a Set of Planar Discs. SIAM J. Comput. 14(2): 448-468 (1985) - [j11]Sergiu Hart, Micha Sharir:
Concurrent Probabilistic Programs, Or: How to Schedule if You Must. SIAM J. Comput. 14(4): 991-1012 (1985) - [c14]Klara Kedem, Micha Sharir:
An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles. SCG 1985: 75-80 - [c13]Daniel Leven, Micha Sharir:
An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract). SCG 1985: 221-227 - [c12]John H. Reif, Micha Sharir:
Motion Planning in the Presence of Moving Obstacles. FOCS 1985: 144-154 - [c11]Micha Sharir, Ron Livne:
On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences. FOCS 1985: 312-320 - 1984
- [j10]Micha Sharir, Amir Pnueli, Sergiu Hart:
Verification of Probabilistic Programs. SIAM J. Comput. 13(2): 292-314 (1984) - [c10]Sergiu Hart, Micha Sharir:
Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme. FOCS 1984: 313-319 - [c9]Sergiu Hart, Micha Sharir:
Probabilistic Temporal Logics for Finite and Bounded Models. STOC 1984: 1-13 - [c8]Micha Sharir, Amir Schorr:
On Shortest Paths in Polyhedral Spaces. STOC 1984: 144-153 - [c7]Richard Cole, Micha Sharir, Chee-Keng Yap:
On k-hulls and Related Problems. STOC 1984: 154-166 - 1983
- [j9]Stefan M. Freudenberger, Jacob T. Schwartz, Micha Sharir:
Experience with the SETL Optimizer. ACM Trans. Program. Lang. Syst. 5(1): 26-45 (1983) - [j8]Sergiu Hart, Micha Sharir, Amir Pnueli:
Termination of Probabilistic Concurrent Program. ACM Trans. Program. Lang. Syst. 5(3): 356-380 (1983) - [c6]Sergiu Hart, Micha Sharir:
Concurrent Probabilistic Program, or: How to Schedule if You Must. ICALP 1983: 304-318 - [c5]