מדעי המחשב
הטכניון - מכון טכנולוגי לישראל
אליהו אושרוביץ
- יצירת קשר
- דואר אלקטרוני:
- oeli
cs.technion.ac.il
- מנחים
- פרסומים נבחרים
- E. Osherovich and A. M. Bruckstein.
All triangulations are reachable via sequences of edge-flips: an elementary proof.
Computer Aided Geometric Design, 25(3):157--161, 2008 [bibtex] [pdf]
- Eliyahu Osherovich, Alfred M. Bruckstein and Vladimir Yanovski.
Covering a Continuous Domain by Distributed, Limited Robots.
In ANTS Workshop, Lecture Notes in Computer Science, 4150:144--155, Springer, 2006 [bibtex] [pdf]
- Eliyahu Osherovich, Vladimir Yanovski, Israel A. Wagner and Alfred M. Bruckstein.
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts.
The International Journal of Robotics Research, 27(7):815--831, 2008 [bibtex] [pdf]
- Eliyahu Osherovich, Michael Zibulevsky and Irad Yavneh.
Fast Reconstruction Method for Diffraction Imaging.
In ISVC 2009, Lecture Notes in Computer Science, 5876:1063--1072, Springer, 2009 [bibtex] [pdf]