2013
199The 2-center problem in three dimensions. Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir. Comput. Geom. (46): 734-746 (2013). Web SearchBibTeXDownload
198Reporting neighbors in high-dimensional Euclidean spaces. Dror Aiger, Haim Kaplan, Micha Sharir. SODA 2013, 784-803. Web SearchBibTeXDownload
197Computing the Discrete Fréchet Distance in Subquadratic Time. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir. SODA 2013, 156-167. Web SearchBibTeXDownload
2012
196Near-Linear Approximation Algorithms for Geometric Hitting Sets. Pankaj K. Agarwal, Esther Ezra, Micha Sharir. Algorithmica (63): 1-25 (2012). Web SearchBibTeXDownload
195Unit Distances in Three Dimensions. Haim Kaplan, Jirí Matousek, Zuzana Safernová, Micha Sharir. Combinatorics, Probability & Computing (21): 597-610 (2012). Web SearchBibTeXDownload
194Computing the Discrete Fréchet Distance in Subquadratic Time. Pankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir. CoRR (abs/1204.5333) (2012). Web SearchBibTeXDownload
193On Range Searching with Semialgebraic Sets II. Pankaj K. Agarwal, Jirí Matousek, Micha Sharir. CoRR (abs/1208.3384) (2012). Web SearchBibTeXDownload
192Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique. Haim Kaplan, Jirí Matousek, Micha Sharir. Discrete & Computational Geometry (48): 499-517 (2012). Web SearchBibTeXDownload
191Improved Bounds for Geometric Permutations. Natan Rubin, Haim Kaplan, Micha Sharir. SIAM J. Comput. (41): 367-390 (2012). Web SearchBibTeXDownload
190Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications. Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir. SODA 2012, 338-355. Web SearchBibTeXDownload
189Finding the maximal empty disk containing a query point. Haim Kaplan, Micha Sharir. Symposium on Computational Geometry 2012, 287-292. Web SearchBibTeXDownload
2011
188A kinetic triangulation scheme for moving points in the plane. Haim Kaplan, Natan Rubin, Micha Sharir. Comput. Geom. (44): 191-205 (2011). Web SearchBibTeXDownload
187Kinetic Stable Delaunay Graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. CoRR (abs/1104.0622) (2011). Web SearchBibTeXDownload
186Finding the Maximal Empty Rectangle Containing a Query Point. Haim Kaplan, Micha Sharir. CoRR (abs/1106.3628) (2011). Web SearchBibTeXDownload
185The Overlay of Minimization Diagrams in a Randomized Incremental Construction. Haim Kaplan, Edgar Ramos, Micha Sharir. Discrete & Computational Geometry (45): 371-382 (2011). Web SearchBibTeXDownload
184Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting. Haim Kaplan, Edgar Ramos, Micha Sharir. Discrete & Computational Geometry (45): 3-33 (2011). Web SearchBibTeXDownload
183On lines, joints, and incidences in three dimensions. György Elekes, Haim Kaplan, Micha Sharir. J. Comb. Theory, Ser. A (118): 962-977 (2011). Web SearchBibTeXDownload
182Optimal Cover of Points by Disks in a Simple Polygon. Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir. SIAM J. Comput. (40): 1647-1661 (2011). Web SearchBibTeXDownload
181Counting Plane Graphs: Flippability and Its Applications. Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl. WADS 2011, 524-535. Web SearchBibTeXDownload
2010
180Hausdorff distance under translation for points and balls. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. ACM Transactions on Algorithms (6) (2010). Web SearchBibTeXDownload
179Guarding a Terrain by Two Watchtowers. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu. Algorithmica (58): 352-390 (2010). Web SearchBibTeXDownload
178Improved Bounds for Geometric Permutations. Natan Rubin, Haim Kaplan, Micha Sharir. CoRR (abs/1007.3244) (2010). Web SearchBibTeXDownload
177A Kinetic Triangulation Scheme for Moving Points in The Plane. Haim Kaplan, Natan Rubin, Micha Sharir. CoRR (abs/1005.0912) (2010). Web SearchBibTeXDownload
176The 2-Center Problem in Three Dimensions. Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir. CoRR (abs/1012.2694) (2010). Web SearchBibTeXDownload
175Counting Plane Graphs: Flippability and its Applications. Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl. CoRR (abs/1012.0591) (2010). Web SearchBibTeXDownload
174On Lines and Joints. Haim Kaplan, Micha Sharir, Eugenii Shustin. Discrete & Computational Geometry (44): 838-843 (2010). Web SearchBibTeXDownload
173Optimal Cover of Points by Disks in a Simple Polygon. Haim Kaplan, Matthew J. Katz, Gila Morgenstern, Micha Sharir. ESA (1) 2010, 475-486. Web SearchBibTeXDownload
172Line Transversals of Convex Polyhedra in R3. Haim Kaplan, Natan Rubin, Micha Sharir. SIAM J. Comput. (39): 3283-3310 (2010). Web SearchBibTeXDownload
171A kinetic triangulation scheme for moving points in the plane. Haim Kaplan, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 137-146. Web SearchBibTeXDownload
170Kinetic stable Delaunay graphs. Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Haim Kaplan, Vladlen Koltun, Natan Rubin, Micha Sharir. Symposium on Computational Geometry 2010, 127-136. Web SearchBibTeXDownload
169The 2-center problem in three dimensions. Pankaj K. Agarwal, Rinat Ben Avraham, Micha Sharir. Symposium on Computational Geometry 2010, 87-96. Web SearchBibTeXDownload
2009
168Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles. Ke Chen, Haim Kaplan, Micha Sharir. ACM Transactions on Algorithms (5) (2009). Web SearchBibTeXDownload
167Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra. Haim Kaplan, Natan Rubin, Micha Sharir. Algorithmica (55): 283-310 (2009). Web SearchBibTeXDownload
166On lines and Joints. Haim Kaplan, Micha Sharir, Eugenii Shustin. CoRR (abs/0906.0558) (2009). Web SearchBibTeXDownload
165On Lines, Joints, and Incidences in Three Dimensions. György Elekes, Haim Kaplan, Micha Sharir. CoRR (abs/0905.1583) (2009). Web SearchBibTeXDownload
164On Overlays and Minimization Diagrams. Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (41): 385-397 (2009). Web SearchBibTeXDownload
163Extremal problems on triangle areas in two and three dimensions. Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth. J. Comb. Theory, Ser. A (116): 1177-1198 (2009). Web SearchBibTeXDownload
162Line transversals of convex polyhedra in R3. Haim Kaplan, Natan Rubin, Micha Sharir. SODA 2009, 170-179. Web SearchBibTeXDownload
161Near-linear approximation algorithms for geometric hitting sets. Pankaj K. Agarwal, Esther Ezra, Micha Sharir. Symposium on Computational Geometry 2009, 23-32. Web SearchBibTeXDownload
2008
160Kinetic and dynamic data structures for closest pair and all nearest neighbors. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir. ACM Transactions on Algorithms (5) (2008). Web SearchBibTeXDownload
159Algorithms for center and Tverberg points. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. ACM Transactions on Algorithms (5) (2008). Web SearchBibTeXDownload
158On the performance of the ICP algorithm. Esther Ezra, Micha Sharir, Alon Efrat. Comput. Geom. (41): 77-93 (2008). Web SearchBibTeXDownload
157Line Transversals of Convex Polyhedra in R3. Haim Kaplan, Natan Rubin, Micha Sharir. CoRR (abs/0807.1221) (2008). Web SearchBibTeXDownload
156Efficient Algorithms for Maximum Regression Depth. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann. Discrete & Computational Geometry (39): 656-677 (2008). Web SearchBibTeXDownload
155Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael A. Soss. Discrete & Computational Geometry (39): 17-37 (2008). Web SearchBibTeXDownload
154Stabbing Convex Polygons with a Segment or a Polygon. Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang. ESA 2008, 52-63. Web SearchBibTeXDownload
153Weak &epsis;-nets and interval chains. Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. J. ACM (55) (2008). Web SearchBibTeXDownload
152Efficient Colored Orthogonal Range Counting. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. SIAM J. Comput. (38): 982-1011 (2008). Web SearchBibTeXDownload
151Weak ε-nets and interval chains. Noga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. SODA 2008, 1194-1203. Web SearchBibTeXDownload
150The complexity of the outer face in arrangements of random segments. Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sharir. Symposium on Computational Geometry 2008, 69-78. Web SearchBibTeXDownload
149Extremal problems on triangle areas in two and three dimensions. Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth. Symposium on Computational Geometry 2008, 208-217. Web SearchBibTeXDownload
2007
148Kinetic and dynamic data structures for convex hulls and upper envelopes. Giora Alexandron, Haim Kaplan, Micha Sharir. Comput. Geom. (36): 144-158 (2007). Web SearchBibTeXDownload
147Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra. Haim Kaplan, Natan Rubin, Micha Sharir. ESA 2007, 287-298. Web SearchBibTeXDownload
146Online Conflict-Free Coloring for Intervals. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl. SIAM J. Comput. (36): 1342-1359 (2007). Web SearchBibTeXDownload
145Counting colors in boxes. Haim Kaplan, Natan Rubin, Micha Sharir, Elad Verbin. SODA 2007, 785-794. Web SearchBibTeXDownload
144Similar simplices in a d-dimensional point set. Pankaj K. Agarwal, Roel Apfelbaum, George B. Purdy, Micha Sharir. Symposium on Computational Geometry 2007, 232-238. Web SearchBibTeXDownload
143Computing the volume of the union of cubes. Pankaj K. Agarwal, Haim Kaplan, Micha Sharir. Symposium on Computational Geometry 2007, 294-301. Web SearchBibTeXDownload
2006
142On the Union of kappa-Round Objects in Three and Four Dimensions. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (36): 511-526 (2006). Web SearchBibTeXDownload
141Computing a Center-Transversal Line. Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sellarčs, Micha Sharir. FSTTCS 2006, 93-104. Web SearchBibTeXDownload
140Computing Maximally Separated Sets in the Plane. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir. SIAM J. Comput. (36): 815-834 (2006). Web SearchBibTeXDownload
139Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting. Haim Kaplan, Micha Sharir. SODA 2006, 484-493. Web SearchBibTeXDownload
138Colored intersection searching via sparse rectangular matrix multiplication. Haim Kaplan, Micha Sharir, Elad Verbin. Symposium on Computational Geometry 2006, 52-60. Web SearchBibTeXDownload
137On the ICP algorithm. Esther Ezra, Micha Sharir, Alon Efrat. Symposium on Computational Geometry 2006, 95-104. Web SearchBibTeXDownload
136On overlays and minimization diagrams. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2006, 395-401. Web SearchBibTeXDownload
2005
135Lines Avoiding Unit Balls in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (34): 231-250 (2005). Web SearchBibTeXDownload
134Cutting Triangular Cycles of Lines in Space. Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (33): 231-247 (2005). Web SearchBibTeXDownload
133Incidences between Points and Circles in Three and Higher Dimensions. Boris Aronov, Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (33): 185-206 (2005). Web SearchBibTeXDownload
132Crossing patterns of semi-algebraic sets. Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir. J. Comb. Theory, Ser. A (111): 310-326 (2005). Web SearchBibTeXDownload
131Curve-Sensitive Cuttings. Vladlen Koltun, Micha Sharir. SIAM J. Comput. (34): 863-878 (2005). Web SearchBibTeXDownload
130Pseudo-Line Arrangements: Duality, Algorithms, and Applications. Pankaj K. Agarwal, Micha Sharir. SIAM J. Comput. (34): 526-552 (2005). Web SearchBibTeXDownload
129Kinetic and Dynamic Data Structures for Convex Hulls and Upper Envelopes. Giora Alexandron, Haim Kaplan, Micha Sharir. WADS 2005, 269-281. Web SearchBibTeXDownload
2004
128Distinct Distances in Three and Higher Dimensions. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos. Combinatorics, Probability & Computing (13): 283-293 (2004). Web SearchBibTeXDownload
127Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions. Vladlen Koltun, Micha Sharir. Discrete & Computational Geometry (31): 83-124 (2004). Web SearchBibTeXDownload
126Lenses in arrangements of pseudo-circles and their applications. Eran Nevo, János Pach, János Pach, Micha Sharir, Micha Sharir, Shakhar Smorodinsky. J. ACM (51): 139-186 (2004). Web SearchBibTeXDownload
125Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir. SODA 2004, 516-525. Web SearchBibTeXDownload
124On lines avoiding unit balls in three dimensions. Pankaj K. Agarwal, Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 36-45. Web SearchBibTeXDownload
123Algorithms for center and Tverberg points. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. Symposium on Computational Geometry 2004, 61-67. Web SearchBibTeXDownload
122On the union of kapa-round objects. Boris Aronov, Alon Efrat, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2004, 383-390. Web SearchBibTeXDownload
2003
121The Partition Technique for Overlays of Envelopes. Vladlen Koltun, Micha Sharir. SIAM J. Comput. (32): 841-863 (2003). Web SearchBibTeXDownload
1203-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations. Vladlen Koltun, Micha Sharir. SIAM J. Comput. (32): 616-642 (2003). Web SearchBibTeXDownload
119Cutting triangular cycles of lines in space. Boris Aronov, Vladlen Koltun, Micha Sharir. STOC 2003, 547-555. Web SearchBibTeXDownload
118Distinct distances in three and higher dimensions. Boris Aronov, János Pach, Micha Sharir, Gábor Tardos. STOC 2003, 541-546. Web SearchBibTeXDownload
117Hausdorff distance under translation for points and balls. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. Symposium on Computational Geometry 2003, 282-291. Web SearchBibTeXDownload
116Curve-sensitive cuttings. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2003, 136-143. Web SearchBibTeXDownload
2002
115Reporting intersecting pairs of convex polytopes in two and three dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. Comput. Geom. (23): 195-207 (2002). Web SearchBibTeXDownload
114Translating a Planar Object to Maximize Point Containment. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl. ESA 2002, 42-53. Web SearchBibTeXDownload
113The Partition Technique for Overlays of Envelopes. Vladlen Koltun, Micha Sharir. FOCS 2002, 637. Web SearchBibTeXDownload
112Pseudo-line arrangements: duality, algorithms, and applications. Pankaj K. Agarwal, Micha Sharir. SODA 2002, 800-809. Web SearchBibTeXDownload
111On the overlay of envelopes in four dimensions. Vladlen Koltun, Micha Sharir. SODA 2002, 810-819. Web SearchBibTeXDownload
110Three dimensional euclidean Voronoi diagrams of lines with a fixed number of orientations. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 217-226. Web SearchBibTeXDownload
109Lenses in arrangements of pseudo-circles and their applications. Eran Nevo, János Pach, János Pach, Micha Sharir, Micha Sharir, Shakhar Smorodinsky. Symposium on Computational Geometry 2002, 123-132. Web SearchBibTeXDownload
108Polyhedral Voronoi diagrams of polyhedra in three dimensions. Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 227-236. Web SearchBibTeXDownload
107Incidences between points and circles in three and higher dimensions. Boris Aronov, Vladlen Koltun, Micha Sharir. Symposium on Computational Geometry 2002, 116-122. Web SearchBibTeXDownload
2001
106An Improved Bound for k-Sets in Three Dimensions. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos. Discrete & Computational Geometry (26): 195-204 (2001). Web SearchBibTeXDownload
105On the Complexity of Arrangements of Circles in the Plane. Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir. Discrete & Computational Geometry (26): 465-492 (2001). Web SearchBibTeXDownload
104Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (26): 307-320 (2001). Web SearchBibTeXDownload
103On the Number of Regular Vertices of the Union of Jordan Regions. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir. Discrete & Computational Geometry (25): 203-220 (2001). Web SearchBibTeXDownload
102On the Complexity of Many Faces in Arrangements of Circles. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. FOCS 2001, 74-83. Web SearchBibTeXDownload
101On the number of congruent simplices in a point. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 2001, 1-9. Web SearchBibTeXDownload
100Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions. Pankaj K. Agarwal, Mark de Berg, Sariel Har-Peled, Mark H. Overmars, Micha Sharir, Jan Vahrenhold. WADS 2001, 122-134. Web SearchBibTeXDownload
2000
99Dynamic data structures for fat objects and their applications. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir. Comput. Geom. (15): 215-227 (2000). Web SearchBibTeXDownload
98Pipes, Cigars, and Kreplach: the Union of Minkowski Sums in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (24): 645-657 (2000). Web SearchBibTeXDownload
97On the Complexity of the Union of Fat Convex Objects in the Plane. Alon Efrat, Micha Sharir. Discrete & Computational Geometry (23): 171-189 (2000). Web SearchBibTeXDownload
96Approximation Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Discrete & Computational Geometry (24): 687-705 (2000). Web SearchBibTeXDownload
95An Improved Bound for k-Sets in Three Dimensions. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos. EuroCG 2000, 132-135. Web SearchBibTeX
94Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. Nord. J. Comput. (7): 227-240 (2000). Web SearchBibTeX
93Exact and approximation algorithms for minimum-width cylindrical shells. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SODA 2000, 510-517. Web SearchBibTeXDownload
92Computing the Penetration Depth of Two Convex Polytopes in 3D. Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir. SWAT 2000, 328-338. Web SearchBibTeXDownload
91An improved bound for k-sets in three dimensions. Micha Sharir, Shakhar Smorodinsky, Gábor Tardos. Symposium on Computational Geometry 2000, 43-49. Web SearchBibTeXDownload
1999
90Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (21): 373-388 (1999). Web SearchBibTeXDownload
89Motion Planning for a Convex Polygon in a Polygonal Environment. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Discrete & Computational Geometry (22): 201-221 (1999). Web SearchBibTeXDownload
88Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Pankaj K. Agarwal, Alon Efrat, Micha Sharir. SIAM J. Comput. (29): 912-953 (1999). Web SearchBibTeXDownload
87Motion Planning of a Ball Amid Segments in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. SODA 1999, 21-30. Web SearchBibTeXDownload
86Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 1999, 143-153. Web SearchBibTeXDownload
85Efficient Algorithms for Maximum Regression Depth. Marc J. van Kreveld, Joseph S. B. Mitchell, Peter Rousseeuw, Micha Sharir, Jack Snoeyink, Bettina Speckmann. Symposium on Computational Geometry 1999, 31-40. Web SearchBibTeXDownload
84Approximation and Exact Algorithms for Minimum-Width Annuli and Shells. Pankaj K. Agarwal, Boris Aronov, Sariel Har-Peled, Micha Sharir. Symposium on Computational Geometry 1999, 380-389. Web SearchBibTeXDownload
1998
83Efficient Algorithms for Geometric Optimization. Pankaj K. Agarwal, Micha Sharir. ACM Comput. Surv. (30): 412-458 (1998). Web SearchBibTeXDownload
82On Levels in Arrangements of Lines, Segments, Planes, and Triangles%. Pankaj K. Agarwal, Boris Aronov, Timothy M. Chan, Micha Sharir. Discrete & Computational Geometry (19): 315-331 (1998). Web SearchBibTeXDownload
81The Discrete 2-Center Problem. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. Discrete & Computational Geometry (20): 287-305 (1998). Web SearchBibTeXDownload
80Largest Placement of One Convex Polygon Inside Another. Pankaj K. Agarwal, Nina Amenta, Micha Sharir. Discrete & Computational Geometry (19): 95-104 (1998). Web SearchBibTeXDownload
79Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl. J. Algorithms (29): 238-255 (1998). Web SearchBibTeXDownload
78On the Number of Regular Vertices of the Union of Jordan Regions. Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir. SWAT 1998, 322-334. Web SearchBibTeXDownload
1997
77Quasi-Planar Graphs Have a Linear Number of Edges. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir. Combinatorica (17): 1-9 (1997). Web SearchBibTeXDownload
76Approximating shortest paths on a convex polytope in three dimensions. Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Kasturi R. Varadarajan. J. ACM (44): 567-584 (1997). Web SearchBibTeXDownload
75Computing Envelopes in Four Dimensions with Applications. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SIAM J. Comput. (26): 1714-1732 (1997). Web SearchBibTeXDownload
74Line Traversals of Balls and Smallest Enclosing Cylinders in Three Dimensions. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. SODA 1997, 483-492. Web SearchBibTeXDownload
73The Discrete 2-Center Problem. Pankaj K. Agarwal, Micha Sharir, Emo Welzl. Symposium on Computational Geometry 1997, 147-155. Web SearchBibTeXDownload
72On Levels in Arrangements of Lines, Segments, Planes, and Triangles. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Symposium on Computational Geometry 1997, 30-38. Web SearchBibTeXDownload
71On the Complexity of the Union of Fat Objects in the Plane. Alon Efrat, Micha Sharir. Symposium on Computational Geometry 1997, 104-112. Web SearchBibTeXDownload
70Dynamic Data Structures for Fat Objects and Their Applications. Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha Sharir. WADS 1997, 297-306. Web SearchBibTeXDownload
1996
69A Near-Linear Algorithm for the Planar Segment-Center Problem. Alon Efrat, Micha Sharir. Discrete & Computational Geometry (16): 239-257 (1996). Web SearchBibTeXDownload
68Efficient Randomized Algorithms for Some Geometric. Optimization Problems. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (16): 317-337 (1996). Web SearchBibTeXDownload
67The Overlay of Lower Envelopes and Its Applications. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. Discrete & Computational Geometry (15): 1-13 (1996). Web SearchBibTeXDownload
66Ray Shooting Amidst Convex Polygons in 2D. Pankaj K. Agarwal, Micha Sharir. J. Algorithms (21): 508-519 (1996). Web SearchBibTeXDownload
65Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. SIAM J. Comput. (25): 100-116 (1996). Web SearchBibTeXDownload
64Efficient Generation of k-Directional Assembly Sequences. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir. SODA 1996, 122-131. Web SearchBibTeXDownload
1995
63Algorithmic Techniques for Geometric Optimization. Pankaj K. Agarwal, Micha Sharir. Computer Science Today 1995, 234-253. Web SearchBibTeXDownload
62Computing Depth Orders for Fat Objects and Related Problems. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir. Comput. Geom. (5): 187-206 (1995). Web SearchBibTeXDownload
61Quasi-Planar Graphs Have a Linear Number of Edges. Pankaj K. Agarwal, Boris Aronov, János Pach, Richard Pollack, Micha Sharir. Graph Drawing 1995, 1-7. Web SearchBibTeXDownload
60Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl. SODA 1995, 197-204. Web SearchBibTeXDownload
59The Overlay of Lower Envelopes in Three Dimensions and Its Applications. Pankaj K. Agarwal, Otfried Schwarzkopf, Micha Sharir. Symposium on Computational Geometry 1995, 182-189. Web SearchBibTeXDownload
58Efficient Randomized Algorithms for Some Geometric Optimization Problems. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 1995, 326-335. Web SearchBibTeXDownload
57Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications. Pankaj K. Agarwal, Alon Efrat, Micha Sharir. Symposium on Computational Geometry 1995, 39-50. Web SearchBibTeXDownload
56Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. Theor. Comput. Sci. (140): 301-317 (1995). Web SearchBibTeXDownload
1994
55Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. Algorithmica (12): 54-68 (1994). Web SearchBibTeXDownload
54Planar Geometric Location Problems. Pankaj K. Agarwal, Micha Sharir. Algorithmica (11): 185-195 (1994). Web SearchBibTeXDownload
53Computing the Smallest K-enclosing Circle and Related Problems. Alon Efrat, Micha Sharir, Alon Ziv. Comput. Geom. (4): 119-136 (1994). Web SearchBibTeXDownload
52On the Number of Views of Polyhedral Terrains. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (12): 177-182 (1994). Web SearchBibTeXDownload
51Applications of Parametric Searching in Geometric Optimization. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo. J. Algorithms (17): 292-318 (1994). Web SearchBibTeXDownload
50Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. SIAM J. Comput. (23): 1138-1151 (1994). Web SearchBibTeXDownload
49A Near-Linear Algorithm for the Planar Segment Center Problem. Alon Efrat, Micha Sharir. SODA 1994, 87-97. Web SearchBibTeXDownload
48Computing Depth Orders and Related Problems. Pankaj K. Agarwal, Matthew J. Katz, Micha Sharir. SWAT 1994, 1-12. Web SearchBibTeXDownload
47Computing Envelopes in Four Dimensions with Applications. Pankaj K. Agarwal, Boris Aronov, Micha Sharir. Symposium on Computational Geometry 1994, 348-358. Web SearchBibTeXDownload
1993
46Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Algorithmica (9): 495-514 (1993). Web SearchBibTeXDownload
45Finding Maximally Consistent Sets of Halfspaces. Alon Efrat, Micha Lindenbaum, Micha Sharir. CCCG 1993, 432-436. Web SearchBibTeX
44On the Number of Views of Polyhedral Terrains. Pankaj K. Agarwal, Micha Sharir. CCCG 1993, 55-60. Web SearchBibTeX
43On the Union of Fat Wedges and Separating a Collection of Segments By a Line. Alon Efrat, Günter Rote, Micha Sharir. CCCG (3): 277-288 (1993). Web SearchBibTeXDownload
42The Upper Envelope of voronoi Surfaces and Its Applications. Daniel P. Huttenlocher, Klara Kedem, Micha Sharir. Discrete & Computational Geometry (9): 267-291 (1993). Web SearchBibTeXDownload
41Applications of a New Space-Partitioning Technique. Pankaj K. Agarwal, Micha Sharir. Discrete & Computational Geometry (9): 11-38 (1993). Web SearchBibTeXDownload
40Circular visibility of a simple polygon from a fixed point. Pankaj K. Agarwal, Micha Sharir. Int. J. Comput. Geometry Appl. (3): 1-25 (1993). Web SearchBibTeXDownload
39Reaching a Goal with Directional Uncertainty. Mark de Berg, Mark H. Overmars, Dan Halperin, Mark H. Overmars, Monique Teillaud, Micha Sharir, Micha Sharir. ISAAC 1993, 1-10. Web SearchBibTeXDownload
38Circle Shooting in a Simple Polygon. Pankaj K. Agarwal, Micha Sharir. J. Algorithms (14): 69-87 (1993). Web SearchBibTeXDownload
37Computing a Segment Center for a Planar Point Set. Pankaj K. Agarwal, Alon Efrat, Micha Sharir, Sivan Toledo. J. Algorithms (15): 314-323 (1993). Web SearchBibTeXDownload
36Computing a Face in an Arrangement of Line Segments and Related Problems. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink. SIAM J. Comput. (22): 1286-1302 (1993). Web SearchBibTeXDownload
35Counting Circular Arc Intersections. Pankaj K. Agarwal, Micha Sharir, Micha Sharir. SIAM J. Comput. (22): 778-793 (1993). Web SearchBibTeXDownload
34Ray Shooting Amidst Convex Polytopes in Three Dimensions. Pankaj K. Agarwal, Micha Sharir. SODA 1993, 260-270. Web SearchBibTeXDownload
33Computing the Smallest k-Enclosing Circle and Related Problems. Alon Efrat, Micha Sharir, Alon Ziv. WADS 1993, 325-336. Web SearchBibTeXDownload
1992
32Applications of Parametric Searching in Geometric Optimization. Pankaj K. Agarwal, Micha Sharir, Sivan Toledo. SODA 1992, 72-82. Web SearchBibTeXDownload
1991
31Off-line Dynamic Maintenance of the Width of a Planar Point Set. Pankaj K. Agarwal, Micha Sharir. Comput. Geom. (1): 65-78 (1991). Web SearchBibTeXDownload
30Counting and Cutting Cycles of Lines and Rods in Space. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Comput. Geom. (1): 305-323 (1991). Web SearchBibTeXDownload
29Tight bounds on a problem of lines and intersections. Micha Sharir, Steven Skiena. Discrete Mathematics (89): 313-314 (1991). Web SearchBibTeXDownload
28Ray Shooting in Polygons Using Geodesic Triangulations. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink. ICALP 1991, 661-646. Web SearchBibTeXDownload
27Planar Geometric Location Problems and Maintaining the Width of a Planar Set. Pankaj K. Agarwal, Micha Sharir. SODA 1991, 449-458. Web SearchBibTeXDownload
26Computing a Face in an Arrangement of Line Segments. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink. SODA 1991, 441-448. Web SearchBibTeXDownload
25Counting Circular Arc Intersections. Pankaj K. Agarwal, Micha Sharir, Micha Sharir. Symposium on Computational Geometry 1991, 10-20. Web SearchBibTeXDownload
24The Upper Envelope of Voronoi Surfaces and Its Applications. Daniel P. Huttenlocher, Klara Kedem, Micha Sharir. Symposium on Computational Geometry 1991, 194-203. Web SearchBibTeXDownload
23Applications of a New Space Partitioning Technique. Pankaj K. Agarwal, Micha Sharir. WADS 1991, 379-391. Web SearchBibTeXDownload
1990
22Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. Discrete & Computational Geometry (5): 99-160 (1990). Web SearchBibTeXDownload
21Counting and Cutting Cycles of Lines and Rods in Space. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. FOCS 1990, 242-251. Web SearchBibTeXDownload
20Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. Pankaj K. Agarwal, Micha Sharir. SIAM J. Comput. (19): 297-321 (1990). Web SearchBibTeXDownload
19Slimming Down by Adding: Selecting Heavily Covered Points. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir. Symposium on Computational Geometry 1990, 116-127. Web SearchBibTeXDownload
18Selecting Distances in the Plane. Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri. Symposium on Computational Geometry 1990, 321-331. Web SearchBibTeXDownload
1989
17Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Discrete & Computational Geometry (4): 433-466 (1989). Web SearchBibTeXDownload
16On Arrangement of Jordan Arcs with Three Intersection per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Discrete & Computational Geometry (4): 523-539 (1989). Web SearchBibTeXDownload
15Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences. Pankaj K. Agarwal, Micha Sharir, Peter W. Shor. J. Comb. Theory, Ser. A (52): 228-274 (1989). Web SearchBibTeXDownload
14Visibility Problems for Polyhedral Terrains. Richard Cole, Micha Sharir. J. Symb. Comput. (7): 11-30 (1989). Web SearchBibTeXDownload
1988
13Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Discrete & Computational Geometry (3): 281-293 (1988). Web SearchBibTeXDownload
12Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl. FOCS 1988, 568-579. Web SearchBibTeXDownload
11Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection. Pankaj K. Agarwal, Micha Sharir. Symposium on Computational Geometry 1988, 70-80. Web SearchBibTeXDownload
10On Arrangements of Jordan Arcs with Three Intersections per Pair. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink. Symposium on Computational Geometry 1988, 258-265. Web SearchBibTeXDownload
9Implicitly Representing Arrangements of Lines or Segments. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl. Symposium on Computational Geometry 1988, 56-69. Web SearchBibTeXDownload
1987
8Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Algorithmica (2): 209-233 (1987). Web SearchBibTeXDownload
7Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap. Algorithmica (2): 27-59 (1987). Web SearchBibTeXDownload
6On k-Hulls and Related Problems. Richard Cole, Micha Sharir, Chee-Keng Yap. SIAM J. Comput. (16): 61-77 (1987). Web SearchBibTeXDownload
5Computing the Link Center of a Simple Polygon. William Lenhart, Richard Pollack, Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Subhash Suri, Godfried T. Toussaint, Sue Whitesides, Chee-Keng Yap. Symposium on Computational Geometry 1987, 1-10. Web SearchBibTeXDownload
1986
4Geometric Applications of Davenport-Schinzel Sequences. Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony. FOCS 1986, 77-86. Web SearchBibTeXDownload
3Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. Symposium on Computational Geometry 1986, 1-13. Web SearchBibTeXDownload
1984
2On k-hulls and Related Problems. Richard Cole, Micha Sharir, Chee-Keng Yap. STOC 1984, 154-166. Web SearchBibTeXDownload
1983
1Retraction: A New Approach to Motion-Planning (Extended Abstract). Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap. STOC 1983, 207-220. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research