Micha Sharir - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Non-Degenerate Spheres in Three DimensionsRoel Apfelbaum, Micha Sharir. cpc, 20(4):503-512, 2011. [doi]

On lines, joints, and incidences in three dimensionsGyörgy Elekes, Haim Kaplan, Micha Sharir. JCT, 118(3):962-977, 2011. [doi]

Incidences in Three Dimensions and Distinct Distances in the PlaneGyörgy Elekes, Micha Sharir. cpc, 20(4):571-608, 2011. [doi]

Improved Bound for the Union of Fat TrianglesEsther Ezra, Boris Aronov, Micha Sharir. soda 2011: 1778-1785 [doi]

Counting Plane Graphs: Flippability and Its ApplicationsMichael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl. wads 2011: 524-535 [doi]

A kinetic triangulation scheme for moving points in the planeHaim Kaplan, Natan Rubin, Micha Sharir. comgeo, 44(4):191-205, 2011. [doi]

Range Minima Queries with Respect to a Random Permutation, and Approximate Range CountingHaim Kaplan, Edgar Ramos, Micha Sharir. dcg, 45(1):3-33, 2011. [doi]

The Overlay of Minimization Diagrams in a Randomized Incremental ConstructionHaim Kaplan, Edgar Ramos, Micha Sharir. dcg, 45(3):371-382, 2011. [doi]

On degrees in random triangulations of point setsMicha Sharir, Adam Sheffer, Emo Welzl. JCT, 118(7):1979-1999, 2011. [doi]

Semialgebraic Range Reporting and Emptiness Searching with ApplicationsMicha Sharir, Hayim Shaul. siamcomp, 40(4):1045-1074, 2011. [doi]

An Improved Bound for ::::k::::-Sets in Four DimensionsMicha Sharir. cpc, 20(1):119-129, 2011. [doi]

2010

Hausdorff distance under translation for points and ballsPankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. talg, 6(4), 2010. [doi]

Guarding a Terrain by Two WatchtowersPankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. algorithmica, 58(2):352-390, 2010. [doi]

Kinetic stable Delaunay graphsPankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. compgeom 2010: 127-136 [doi]

An Improved Bound on the Number of Unit Area TrianglesRoel Apfelbaum, Micha Sharir. dcg, 44(4):753-761, 2010. [doi]

Approximate Halfspace Range CountingBoris Aronov, Micha Sharir. siamcomp, 39(7):2704-2725, 2010. [doi]

Small-Size /eps -Nets for Axis-Parallel Rectangles and BoxesBoris Aronov, Esther Ezra, Micha Sharir. siamcomp, 39(7):3248-3282, 2010. [doi]

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint)Kenneth L. Clarkson, Micha Sharir. General Books, 2010.

Incidences in three dimensions and distinct distances in the planeGyörgy Elekes, Micha Sharir. compgeom 2010: 413-422 [doi]

Optimal Cover of Points by Disks in a Simple PolygonHaim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir. esa 2010: 475-486 [doi]

A kinetic triangulation scheme for moving points in the planeHaim Kaplan, Natan Rubin, Micha Sharir. compgeom 2010: 137-146 [doi]

On Lines and JointsHaim Kaplan, Micha Sharir, Eugenii Shustin. dcg, 44(4):838-843, 2010. [doi]

Line Transversals of Convex Polyhedra in R:::3:::Haim Kaplan, Natan Rubin, Micha Sharir. siamcomp, 39(7):3283-3310, 2010. [doi]

Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in SpaceOphir Setter, Micha Sharir, Dan Halperin. tcos, 9:1-27, 2010. [doi]

On degrees in random triangulations of point setsMicha Sharir, Adam Sheffer, Emo Welzl. compgeom 2010: 297-306 [doi]

2009

Near-linear approximation algorithms for geometric hitting setsPankaj K. Agarwal, Esther Ezra, Micha Sharir. compgeom 2009: 23-32 [doi]

An improved bound on the number of unit area trianglesRoel Apfelbaum, Micha Sharir. compgeom 2009: 135-140 [doi]

Small-size epsilon-nets for axis-parallel rectangles and boxesBoris Aronov, Esther Ezra, Micha Sharir. stoc 2009: 639-648 [doi]

Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectanglesKe Chen, Haim Kaplan, Micha Sharir. talg, 5(2), 2009. [doi]

Extremal problems on triangle areas in two and three dimensionsAdrian Dumitrescu, Micha Sharir, Csaba D. TÃ³th. JCT, 116(7):1177-1198, 2009. [doi]

On the union of fat tetrahedra in three dimensionsEsther Ezra, Micha Sharir. JACM, 57(1), 2009. [doi]

On Regular Vertices of the Union of Planar Convex ObjectsEsther Ezra, János Pach, Micha Sharir. dcg, 41(2):216-231, 2009. [doi]

Line transversals of convex polyhedra in ::::R:::::::3:::Haim Kaplan, Natan Rubin, Micha Sharir. soda 2009: 170-179 [doi]

Linear Data Structures for Fast Ray-Shooting amidst Convex PolyhedraHaim Kaplan, Natan Rubin, Micha Sharir. algorithmica, 55(2):283-310, 2009. [doi]

On Overlays and Minimization DiagramsVladlen Koltun, Micha Sharir. dcg, 41(3):385-397, 2009. [doi]

Eppstein s bound on intersecting triangles revisitedGabriel Nivasch, Micha Sharir. JCT, 116(2):494-497, 2009. [doi]

Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in SpaceOphir Setter, Micha Sharir, Dan Halperin. isvd 2009: 43-52 [doi]

2008

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

Stabbing Convex Polygons with a Segment or a PolygonPankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang. esa 2008: 52-63 [doi]

Algorithms for center and Tverberg pointsPankaj K. Agarwal, Micha Sharir, Emo Welzl. talg, 5(1), 2008. [doi]

Kinetic and dynamic data structures for closest pair and all nearest neighborsPankaj K. Agarwal, Haim Kaplan, Micha Sharir. talg, 5(1), 2008. [doi]

Weak &epsis;-nets and interval chainsNoga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. JACM, 55(6), 2008. [doi]

The complexity of the outer face in arrangements of random segmentsNoga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir. compgeom 2008: 69-78 [doi]

Weak ε-nets and interval chainsNoga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. soda 2008: 1194-1203 [doi]

Extremal problems on triangle areas in two and three dimensionsAdrian Dumitrescu, Micha Sharir, Csaba D. Tóth. compgeom 2008: 208-217 [doi]

On the performance of the ICP algorithmEsther Ezra, Micha Sharir, Alon Efrat. comgeo, 41(1-2):77-93, 2008. [doi]

Efficient Colored Orthogonal Range CountingHaim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. siamcomp, 38(3):982-1011, 2008. [doi]

On planar intersection graphs with forbidden subgraphsJános Pach, Micha Sharir. jgt, 59(3):205-214, 2008. [doi]

An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three DimensionsYevgeny Schreiber, Micha Sharir. dcg, 39(1-3):500-579, 2008. [doi]

Efficient Algorithms for Maximum Regression DepthMarc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann. dcg, 39(4):656-677, 2008. [doi]

2007

Similar simplices in a d-dimensional point setPankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir. compgeom 2007: 232-238 [doi]

Computing the volume of the union of cubesPankaj K. Agarwal, Haim Kaplan, Micha Sharir. compgeom 2007: 294-301 [doi]

Kinetic and dynamic data structures for convex hulls and upper envelopesGiora Alexandron, Haim Kaplan, Micha Sharir. comgeo, 36(2):144-158, 2007. [doi]

Large Complete Bipartite Subgraphs In Incidence Graphs Of Points And HyperplanesRoel Apfelbaum, Micha Sharir. siamdm, 21(3):707-725, 2007. [doi]

On approximate halfspace range counting and relative epsilon-approximationsBoris Aronov, Sariel Har-Peled, Micha Sharir. compgeom 2007: 327-336 [doi]

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

Almost Tight Bound for the Union of Fat Tetrahedra in Three DimensionsEsther Ezra, Micha Sharir. focs 2007: 525-535 [doi]

A Single Cell in an Arrangement of Convex Polyhedra in /Bbb ::::R:::::::3:::Esther Ezra, Micha Sharir. dcg, 37(1):21-41, 2007. [doi]

On regular vertices on the union of planar objectsEsther Ezra, János Pach, Micha Sharir. compgeom 2007: 220-226 [doi]

Bi-criteria linear-time approximations for generalized k-mean/median/centerDan Feldman, Amos Fiat, Micha Sharir, Danny Segev. compgeom 2007: 19-26 [doi]

Counting colors in boxesHaim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. soda 2007: 785-794 [doi]

Linear Data Structures for Fast Ray-Shooting Amidst Convex PolyhedraHaim Kaplan, Natan Rubin, Micha Sharir. esa 2007: 287-298 [doi]

Solution of Scott s Problem on the Number of Directions Determined by a Point Set in 3-SpaceJános Pach, Rom Pinchasi, Micha Sharir. dcg, 38(2):399-441, 2007. [doi]

Arrangements in Geometry: Recent Advances and ChallengesMicha Sharir. esa 2007: 12-16 [doi]

2006

Computing Maximally Separated Sets in the PlanePankaj K. Agarwal, Mark H. Overmars, Micha Sharir. siamcomp, 36(3):815-834, 2006. [doi]

Computing a Center-Transversal LinePankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarès, Micha Sharir. fsttcs 2006: 93-104 [doi]

On the Union of kappa-Round Objects in Three and Four DimensionsBoris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. dcg, 36(4):511-526, 2006. [doi]

On the ICP algorithmEsther Ezra, Micha Sharir, Alon Efrat. compgeom 2006: 95-104 [doi]

Coresets forWeighted Facilities and Their ApplicationsDan Feldman, Amos Fiat, Micha Sharir. focs 2006: 315-324 [doi]

Colored intersection searching via sparse rectangular matrix multiplicationHaim Kaplan, Micha Sharir, Elad Verbin. compgeom 2006: 52-60 [doi]

Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range countingHaim Kaplan, Micha Sharir. soda 2006: 484-493 [doi]

On overlays and minimization diagramsVladlen Koltun, Micha Sharir. compgeom 2006: 395-401 [doi]

k-Sets in Four DimensionsJirí Matousek, Micha Sharir, Shakhar Smorodinsky, Uli Wagner. dcg, 35(2):177-191, 2006. [doi]

Minkowski Sums of Monotone and General Simple PolygonsEduard Oks, Micha Sharir. dcg, 35(2):223-240, 2006. [doi]

On empty convex polygons in a planar point setRom Pinchasi, Rados Radoicic, Micha Sharir. JCT, 113(3):385-419, 2006. [doi]

An optimal-time algorithm for shortest paths on a convex polytope in three dimensionsYevgeny Schreiber, Micha Sharir. compgeom 2006: 30-39 [doi]

Random triangulations of planar point setsMicha Sharir, Emo Welzl. compgeom 2006: 273-281 [doi]

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

On the Number of Crossing-Free Matchings, Cycles, and PartitionsMicha Sharir, Emo Welzl. siamcomp, 36(3):695-720, 2006. [doi]

2005

Lines Avoiding Unit Balls in Three DimensionsPankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. dcg, 34(2):231-250, 2005. [doi]

Pseudo-Line Arrangements: Duality, Algorithms, and ApplicationsPankaj K. Agarwal, Micha Sharir. siamcomp, 34(3):526-552, 2005. [doi]

Kinetic and Dynamic Data Structures for Convex Hulls and Upper EnvelopesGiora Alexandron, Haim Kaplan, Micha Sharir. wads 2005: 269-281 [doi]

Crossing patterns of semi-algebraic setsNoga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir. JCT, 111(2):310-326, 2005. [doi]

Repeated Angles in Three and Four DimensionsRoel Apfelbaum, Micha Sharir. siamdm, 19(2):294-300, 2005. [doi]

Cutting Triangular Cycles of Lines in SpaceBoris Aronov, Vladlen Koltun, Micha Sharir. dcg, 33(2):231-247, 2005. [doi]

Incidences between Points and Circles in Three and Higher DimensionsBoris Aronov, Vladlen Koltun, Micha Sharir. dcg, 33(2):185-206, 2005. [doi]

Counting and representing intersections among triangles in three dimensionsEsther Ezra, Micha Sharir. comgeo, 32(3):196-215, 2005. [doi]

Output-Sensitive Construction of the Union of TrianglesEsther Ezra, Micha Sharir. siamcomp, 34(6):1331-1351, 2005. [doi]

An Improved Bound for Joints in Arrangements of Lines in SpaceSharona Feldman, Micha Sharir. dcg, 33(2):307-320, 2005. [doi]

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

Curve-Sensitive CuttingsVladlen Koltun, Micha Sharir. siamcomp, 34(4):863-878, 2005. [doi]

Topological Graphs with No Large GridsJános Pach, Rom Pinchasi, Micha Sharir, Géza Tóth. gc, 21(3):355-364, 2005. [doi]

On Graphs That Do Not Contain The Cube And Related ProblemsRom Pinchasi, Micha Sharir. combinatorica, 25(5):615-623, 2005. [doi]

Top-Down Analysis of Path CompressionRaimund Seidel, Micha Sharir. siamcomp, 34(3):515-525, 2005. [doi]

The interface between computational and combinatorial geometryMicha Sharir. soda 2005: 137-145 [doi]

Ray shooting amid balls, farthest point from a line, and range emptiness searchingMicha Sharir, Hayim Shaul. soda 2005: 525-534 [doi]

Ray shooting and stone throwing with near-linear storageMicha Sharir, Hayim Shaul. comgeo, 30(3):239-252, 2005. [doi]

2004

On lines avoiding unit balls in three dimensionsPankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. compgeom 2004: 36-45 [doi]

Distinct Distances in Three and Higher DimensionsBoris Aronov, János Pach, Micha Sharir, Gábor Tardos. cpc, 13(3):283-293, 2004.

On empty convex polygons in a planar point setRom Pinchasi, Rados Radoicic, Micha Sharir. compgeom 2004: 391-400 [doi]

PreviousNext