L
Leonidas J. Guibas
Researcher at Massachusetts Institute of Technology
Publications - 8
Citations - 283
Leonidas J. Guibas is an academic researcher from Massachusetts Institute of Technology. The author has contributed to research in topics: Convex combination & Convex hull. The author has an hindex of 6, co-authored 8 publications receiving 281 citations.
Papers
More filters
Book
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces
TL;DR: The authors study both the incidence counting and the many-faces problem for various kinds of curves, including lines, pseudolines, unit circles, general circles, and pseudocircles and extend the analysis to three dimensions, where they concentrate on the case of spheres, which is relevant for the three-dimensional unit-distance problem.
Proceedings ArticleDOI
Computing a face in an arrangement of line segments
TL;DR: In this paper, a randomized incremental algorithm for computing a single face in an arrangement of n line segments in the plane is presented, and the expected running time of the algorithm is O(n\alpha (n) log n).
Journal ArticleDOI
Improved bounds on weak ź-nets for convex sets
Bernard Chazelle,Herbert Edelsbrunner,Michelangelo Grigni,Leonidas J. Guibas,Micha Sharir,Emo Welzl +5 more
TL;DR: In the case whereS consists of the vertices of a regular polygon, an argument from hyperbolic geometry is used to exhibit an optimal net of sizeO(1/ε), which improves a previous bound of Capoyleas.
Proceedings ArticleDOI
Improved bounds on weak e-nets for convex sets
Bernard Chazelle,Herbert Edelsbrunner,Michelangelo Grigni,Leonidas J. Guibas,Micha Sharir,Emo Welzl +5 more
TL;DR: In the case whereS consists of the vertices of a regular polygon, this work uses an argument from hyperbolic geometry to exhibit an optimal net of sizeO(1/e), which improves a previous bound of Capoyleas.