| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
Near-Linear Approximation Algorithms for Geometric Hitting Sets.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir |
Computing the Discrete Fréchet Distance in Subquadratic Time |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir |
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | György Elekes, Haim Kaplan, Micha Sharir |
On lines, joints, and incidences in three dimensions. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Adam Sheffer, Emo Welzl |
On degrees in random triangulations of point sets. |
J. Comb. Theory, Ser. A |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Adam Sheffer |
Counting Triangulations of Planar Point Sets. |
Electr. J. Comb. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Roel Apfelbaum, Micha Sharir |
Non-Degenerate Spheres in Three Dimensions. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | György Elekes, Micha Sharir |
Incidences in Three Dimensions and Distinct Distances in the Plane. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir |
An Improved Bound for k-Sets in Four Dimensions. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Edgar Ramos, Micha Sharir |
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sariel Har-Peled, Micha Sharir |
Relative (p, ε)-Approximations in Geometry. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Edgar Ramos, Micha Sharir |
The Overlay of Minimization Diagrams in a Randomized Incremental Construction. |
Discrete & Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Adam Sheffer, Emo Welzl |
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir |
Finding the Maximal Empty Rectangle Containing a Query Point |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir |
Kinetic Stable Delaunay Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
A kinetic triangulation scheme for moving points in the plane. |
Comput. Geom. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Hayim Shaul |
Semialgebraic Range Reporting and Emptiness Searching with Applications. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
Optimal Cover of Points by Disks in a Simple Polygon. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther Ezra, Boris Aronov, Micha Sharir |
Improved Bound for the Union of Fat Triangles. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl |
Counting Plane Graphs: Flippability and Its Applications. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ophir Setter, Micha Sharir, Dan Halperin |
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. |
Transactions on Computational Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu |
Guarding a Terrain by Two Watchtowers. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang |
Hausdorff distance under translation for points and balls. |
ACM Transactions on Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir, Eugenii Shustin |
On Lines and Joints. |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Roel Apfelbaum, Micha Sharir |
An Improved Bound on the Number of Unit Area Triangles. |
Discrete & Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl |
Counting Plane Graphs: Flippability and its Applications |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
A Kinetic Triangulation Scheme for Moving Points in The Plane |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir |
The 2-Center Problem in Three Dimensions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Roel Apfelbaum, Micha Sharir |
An Improved Bound on the Number of Unit Area Triangles |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | György Elekes, Micha Sharir |
Incidences in Three Dimensions and Distinct Distances in the Plane |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line Transversals of Convex Polyhedra in R3. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Esther Ezra, Micha Sharir |
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Micha Sharir |
Approximate Halfspace Range Counting. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir |
Algorithm Derivation by Transformations (reprint). |
|
2010 |
RDF |
|
| 1 | Kenneth L. Clarkson, Micha Sharir |
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint). |
|
2010 |
RDF |
|
| 1 | Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir |
Optimal Cover of Points by Disks in a Simple Polygon. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Adam Sheffer, Emo Welzl |
On degrees in random triangulations of point sets. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
crossing-free geometric graphs, degree sequences, number of triangulatons, random triangulations, counting, charging, plane graphs |
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
A kinetic triangulation scheme for moving points in the plane. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
moving points, triangulation, convex hull, kinetic data structures |
| 1 | Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir |
The 2-center problem in three dimensions. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
2-center problem, intersection of congruent balls, multi-dimensional parametric searching, spherical polytopes, facility location, geometric optimization |
| 1 | Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir |
Kinetic stable Delaunay graphs. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
Voronoi diagram, Delaunay triangulation, kinetic data structure |
| 1 | György Elekes, Micha Sharir |
Incidences in three dimensions and distinct distances in the plane. |
Symposium on Computational Geometry |
2010 |
DBLP DOI BibTeX RDF |
algebraic techniques, distinct distances, incidences |
| 1 | Natan Rubin, Haim Kaplan, Micha Sharir |
Improved Bounds for Geometric Permutations. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth |
Extremal problems on triangle areas in two and three dimensions. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel Nivasch, Micha Sharir |
Eppstein's bound on intersecting triangles revisited. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Computational geometry, Ray-shooting, Convex polyhedra, Lines in space |
| 1 | Ke Chen 0006, Haim Kaplan, Micha Sharir |
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
Conflict free coloring, online algorithms, coloring |
| 1 | Esther Ezra, Micha Sharir |
On the union of fat tetrahedra in three dimensions. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladlen Koltun, Micha Sharir |
On Overlays and Minimization Diagrams. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Minimization diagrams, Overlays, Arrangements, Combinatorial complexity, Lower envelopes |
| 1 | Esther Ezra, János Pach, Micha Sharir |
On Regular Vertices of the Union of Planar Convex Objects. |
Discrete & Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
Geometric arrangements, Union of planar regions, Regular vertices, Bi-clique decompositions, (1/r)-cuttings, Lower envelopes |
| 1 | Micha Sharir, Adam Sheffer, Emo Welzl |
Counting Triangulations of Planar Point Sets |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir, Eugenii Shustin |
On lines and Joints |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | György Elekes, Haim Kaplan, Micha Sharir |
On Lines, Joints, and Incidences in Three Dimensions |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Micha Sharir, Hayim Shaul |
Semi-algebraic Range Reporting and Emptiness Searching with Applications |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sariel Har-Peled, Micha Sharir |
Relative (p,epsilon)-Approximations in Geometry |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line transversals of convex polyhedra in R3. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ophir Setter, Micha Sharir, Dan Halperin |
Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space. |
ISVD |
2009 |
DBLP DOI BibTeX RDF |
minimum-width annulus, Voronoi diagrams, randomization, envelopes |
| 1 | Pankaj K. Agarwal, Esther Ezra, Micha Sharir |
Near-linear approximation algorithms for geometric hitting sets. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
geometric range spaces, shallow cuttings, union of simply-shaped regions, randomized algorithms, hitting sets |
| 1 | Roel Apfelbaum, Micha Sharir |
An improved bound on the number of unit area triangles. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
geometric incidences, repeated configurations, unit-area triangles, combinatorial geometry |
| 1 | Boris Aronov, Esther Ezra, Micha Sharir |
Small-size epsilon-nets for axis-parallel rectangles and boxes. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
?-nets, geometric range spaces, randomized algorithms, set cover, hitting set |
| 1 | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
Kinetic and dynamic data structures for closest pair and all nearest neighbors. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
computational geometry, nearest neighbors, Kinetic data structures, closest pair |
| 1 | Pankaj K. Agarwal, Micha Sharir, Emo Welzl |
Algorithms for center and Tverberg points. |
ACM Transactions on Algorithms |
2008 |
DBLP DOI BibTeX RDF |
Tverberg point, center point, Arrangements |
| 1 | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
Weak &epsis;-nets and interval chains. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
Interval chain, inverse Ackermann function, moment curve, weak epsilon-net |
| 1 | Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss |
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeny Schreiber, Micha Sharir |
An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
Continuous Dijkstra, Polytope surface, Shortest path, Unfolding, Geodesics, Wavefront, Shortest path map |
| 1 | Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann |
Efficient Algorithms for Maximum Regression Depth. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel Nivasch, Micha Sharir |
Eppstein's bound on intersecting triangles revisited |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Line Transversals of Convex Polyhedra in R3 |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | János Pach, Micha Sharir |
On planar intersection graphs with forbidden subgraphs. |
Journal of Graph Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther Ezra, Micha Sharir, Alon Efrat |
On the performance of the ICP algorithm. |
Comput. Geom. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
Efficient Colored Orthogonal Range Counting. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky |
Weak ε-nets and interval chains. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth |
Extremal problems on triangle areas in two and three dimensions. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
distinct triangle areas, extremal combinatorics, maximum triangle areas, minimum triangle areas, unit triangle areas, discrete geometry, point configurations |
| 1 | Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir |
The complexity of the outer face in arrangements of random segments. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
outer face complexity, walk along a line, computation geometry |
| 1 | Esther Ezra, Micha Sharir |
A Single Cell in an Arrangement of Convex Polyhedra in \Bbb R3. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Rom Pinchasi, Micha Sharir |
Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Roel Apfelbaum, Micha Sharir |
Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And Hyperplanes. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Giora Alexandron, Haim Kaplan, Micha Sharir |
Kinetic and dynamic data structures for convex hulls and upper envelopes. |
Comput. Geom. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ke Chen 0006, 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir |
Arrangements in Geometry: Recent Advances and Challenges. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir |
Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin |
Counting colors in boxes. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir |
Similar simplices in a d-dimensional point set. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
points and hyperplanes, combinatorial geometry, incidences, repeated patterns, point configurations |
| 1 | Dan Feldman, Amos Fiat, Micha Sharir, Danny Segev |
Bi-criteria linear-time approximations for generalized k-mean/median/center. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
bi-criteria approximation, approximation, k-mean, geometric optimization, k-median, k-center |
| 1 | Esther Ezra, János Pach, Micha Sharir |
On regular vertices on the union of planar objects. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
(1/r)-cuttings, regular vertices, union of geometric objects |
| 1 | Boris Aronov, Sariel Har-Peled, Micha Sharir |
On approximate halfspace range counting and relative epsilon-approximations. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces |
| 1 | Pankaj K. Agarwal, Haim Kaplan, Micha Sharir |
Computing the volume of the union of cubes. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
union of objects, arrangements |
| 1 | Esther Ezra, Micha Sharir |
Almost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rom Pinchasi, Rados Radoicic, Micha Sharir |
On empty convex polygons in a planar point set. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner |
k-Sets in Four Dimensions. |
Discrete & Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduard Oks, Micha Sharir |
Minkowski Sums of Monotone and General Simple Polygons. |
Discrete & Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir |
On the Union of kappa-Round Objects in Three and Four Dimensions. |
Discrete & Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Emo Welzl |
On the Number of Crossing-Free Matchings, Cycles, and Partitions. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir |
Computing Maximally Separated Sets in the Plane. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Micha Sharir |
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Emo Welzl |
On the number of crossing-free matchings, (cycles, and partitions). |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Emo Welzl |
Random triangulations of planar point sets. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
crossing-free geometric graphs, crossing-free spanning trees, degree sequences, number of triangulations, random triangulations, counting, charging |
| 1 | Vladlen Koltun, Micha Sharir |
On overlays and minimization diagrams. |
Symposium on Computational Geometry |
2006 |
DBLP DOI BibTeX RDF |
minimization diagrams, Voronoi diagrams, overlays, arrangements, hyperplanes, power diagrams, lower envelopes |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")