L
Leonidas J. Guibas
Researcher at Stanford University
Publications - 736
Citations - 99526
Leonidas J. Guibas is an academic researcher from Stanford University. The author has contributed to research in topics: Computer science & Point cloud. The author has an hindex of 124, co-authored 691 publications receiving 79200 citations. Previous affiliations of Leonidas J. Guibas include PARC & Association for Computing Machinery.
Papers
More filters
Book ChapterDOI
Ray Shooting in Polygons Using Geodesic Triangulations
Bernard Chazelle,Herbert Edelsbrunner,Michelangelo Grigni,Leonidas J. Guibas,Leonidas J. Guibas,John Hershberger,Micha Sharir,Micha Sharir,Jack Snoeyink +8 more
TL;DR: A simple decomposition scheme that partitions the interior of P intoO(n) so-called geodesic triangles, so that any line segment interior toP crosses at most 2 logn of these triangles can be used to preprocessP in a very simple manner, so any ray-shooting query can be answered in timeO(logn).
Proceedings ArticleDOI
Snap rounding line segments efficiently in two and three dimensions
TL;DR: It is shown that a snap-rounded approximation to the arrangement defined by S can be built in an output-sensitive fashion, and that this can be done without first determining all the intersecting pairs of segments in S.
Proceedings Article
Syntactic and Functional Variability of a Million Code Submissions in a Machine Learning MOOC.
TL;DR: The syntax and functional similarity of the submissions are mapped out in order to explore the variation in solutions in the first offering of Stanford's Machine Learning Massive Open-Access Online Course.
Book ChapterDOI
Computing the Penetration Depth of Two Convex Polytopes in 3D
Pankaj K. Agarwal,Leonidas J. Guibas,Sariel Har-Peled,Alexander Rabinovitch,Micha Sharir,Micha Sharir +5 more
TL;DR: A randomized algorithm that computes π(A, B) in O(m3/4+e n3/ 4+e +m1-e + n1+e) expected time, for any constant e > 0, and a δ-approximation algorithm for computing the width of A in time O(n + (1/δ) log2(1/ δ)), which is simpler and faster than the recent algorithm by Chan.
Journal ArticleDOI
Counting and cutting cycles of lines and rods in space
Bernard Chazelle,Herbert Edelsbrunner,Leonidas J. Guibas,Richard Pollack,Raimund Seidel,Micha Sharir,Micha Sharir,Jack Snoeyink +7 more
TL;DR: A number of rendering algorithms in computer graphics sort 3D objects by depth and assume that there is no cycle that makes the sorting impossible as discussed by the authors, and one way to resolve the problem caused by cycles is to cut the objects into smaller pieces.