Forgot your password?
Michal Kleinbort
PhD student in the School of Computer Science, Tel Aviv University
Advisor: Prof. Dan Halperin
Member of the Computational Geometry Lab
Contact Info: Blavatnik School of Computer Science, Tel Aviv University Tel Aviv 69978, Israel +972-3-6406114 balasmic AT post DOT tau DOT ac DOT il
Schreiber building, basement, room 18
Research Interests
Publications[dblp] Collision detection or nearest-neighbor search? On the computational bottleneck in sampling- based motion planning. In Workshop on the Algorithmic Foundations of Robotics (WAFR), San Francisco, CA, USA, 2016 [link]. Optimal randomized incremental construction for guaranteed logarithmic planar point loca- tion. Computational Geometry Theory and Applications (CGTA), , 2016 [link]. Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. In IEEE International Conference on Robotics and Automation (ICRA), Seattle, WA, USA, 2015 [link]. Improved Implementation of Point Location in General Two-Dimensional Subdivisions. In European Symposium on Algorithms (ESA), Ljubljana, Slovenia, 2012 [link]. Guaranteed Logarithmic-Time Point Location in General Two-Dimensional Subdivisions: New Bounds, Algorithms, and Implementation [pdf] Master's thesis, Tel Aviv University, February 2013 Advisor: Prof. Dan Halperin. Teaching
|
