(04/MAR/09)
The Technion awarded
me the Henri Taub prize for academic excellence, for a few polyomino and
polycube-related works.
(The background of the picture in the above link is completely irrelated to
the things I do. 8-)
Information for Prospective Graduate Students
Just want to be a CGGC student and then decide? Click
Here.
Would like to consider a thesis topic in Computational Geometry? Take my
Computational Geometry
course and send me a
message!
Here is a nice research problem for a thesis: Read
this paper (journal #26) and rethink about
the 3D case. Can it be improved to Ω(1/n³) by sharpening
the argument for the inner-most cylinder?
For perspective,
here is
(completely out of context!) how Eli O'Hana was quoted in Yediot Akhronot in
an interview in May 1999.
Major Interests
Computational geometry
Graph theory and combinatorics
Discrete mathematics
Geometric software
Geometric computing over the Internet
Geometric and solid modeling
Geometric algorithms for medical imaging
Geometric algorithms for computer graphics
Current Research
Counting polyominoes and polycubes Heilbronn-type problems
Object reconstruction from slices
Geometric optimization problems
Vadim Makhervaks
(M.Sc., Mathematics, co-supervised with A. Bruckstein)
Image flows and one-liner graphical image representations
(thesis;
defense held November 5, 2002;
now at Austin, TX)
Daniel Brunstein
(M.Sc., Computer Science, co-supervised with C. Gotsman)
Animating a camera for viewing a planar polygon
(thesis;
defense held June 18, 2003;
now at Intel, Haifa, Israel)
Vadim Rogol
(M.Sc., Electrical Engineering)
Maximizing the area of an axially-symmetric polygon inscribed by a simple
polygon
(thesis;
defense held June 30, 2003;
now at Neomagic, Natanya, Israel)
Micha Moffie
(M.Sc., Computer Science)
Counting polyominoes in two and three dimensions
(thesis;
defense held December 31, 2003;
now a Ph.D. student at Northeastern University, Boston, MA)
Evgeny Yakersberg
(M.Sc., Computer Science)
Morphing between geometric shapes using straight-skeleton-based interpolation
(thesis;
defense held May 14, 2004;
now at PTC, Herzlia, Israel)
Yuval Scharf
(M.Sc., Computer Science)
Covering points with a polygon
(thesis;
defense held September 27, 2004;
now at Google, Mountain View, CA)
Aya Steiner
(M.Sc., Mathematics)
Matability of polygons
(thesis;
defense held February 28, 2005;
now a researcher at the Univ. of Michigan, Ann Arbor, MI)
Alex Goryachev
(M.Sc., Computer Science)
Offset polygon and annulus placement problems
(thesis;
defense held November 16, 2005;
now at IBM, Haifa, Israel)
Dimitry Kloper
(M.Sc., Computer Science, co-supervised with C. Gotsman)
Geometries and topologies of triangulations of point sets
(thesis;
defense held December 21, 2005;
now at Avalon-Net, Tel Hanan, Israel)
David Hodorkovsky
(M.Sc., Mathematics)
2-point site Voronoi diagrams
(thesis;
defense held December 22, 2005;
now at Imagine, Natanya, Israel)
Jonathan Naor
(M.Sc., Computer Science) d-dimensional variants of Heilbronn's triangle problem
(thesis;
defense held January 8, 2006;
now at Elbit, Haifa, Israel)
Avishay Sidlesky
(M.Sc., Computer Science, co-supervised with C. Gotsman)
Polygon reconstruction from line cross-sections
(thesis;
defense held June 11, 2006;
now at Xurity, ???, Israel)
Eyal Ackerman
(Ph.D., Computer Science, co-supervised with R.Y. Pinter)
Counting problems for geometric structures:
Rectangulations, floorplans, and quasi-planar graphs
(dissertation;
defense held September 3, 2006;
now at Simon Fraser Univ., Burnaby, British Columbia, Canada)
(M.Sc. in Sciences obtained while passing the Ph.D.-candidacy exam in
the direct track, January 1, 2004.)
Amir Vaxman
(M.Sc., Computer Science)
Nonlinear interpolation between slices
(thesis;
defense held November 22, 2006;
now a Ph.D. student in the Technion)
Alina Shaikhet
(M.Sc., Computer Science)
The on-line Heilbronn's triangle problem in d dimensions
(thesis;
defense held June 20, 2007)
Alik Zamansky
(M.Sc., Computer Science)
A framework for surface reconstruction of sparsely-sampled objects
(thesis;
defense held June 26, 2007)
Asenath Tal
(M.Sc., Computer Science)
Algorithms for Heilbronn's triangle problem
(thesis;
defense held April 19, 2009)
In progress:
Gadi Aleksandrowicz
(Ph.D., Computer Science)
Polyominoes in triangular, hexagonal, and d-dimensional rectangular
grids
(M.Sc. in Sciences obtained while passing the Ph.D.-candidacy exam in
the direct track, March 9, 2008.)
Amir Vaxman
(Ph.D., Computer Science)
General techniques for interpolation
Advanced Seminar in Geometric Computing: Fall 08-09 (236803),
Fall 06-07 (236801),
Spring 04-05 (236801),
Spring 03-04 (236801),
Spring 01-02 (236801),
Spring 95-96 (TAU),
Computer Graphics 1 (234325):
Fall 03-04
Introduction to System Programming (234122):
Spring 08-09,
Fall 07-08,
Fall 06-07,
Fall 05-06,
Fall 04-05,
Fall 03-04,
Fall 02-03,
Fall 01-02,
Fall 00-01,
Fall 99-00,
Fall 98-99,
Spring 94-95 (TAU),
Fall 94-95 (TAU),
Spring 93-94 (TAU)
Courses I Teach in the Current Semester (2009-10 II)
Introduction to System Programming
(234122, Sunday 12:30-14:30, T-7):
1st term: ??? ??/??/10, time TBA, TBA.
2nd term: ??? ??/??/10, time TBA, TBA.
Project in Computational Geometry
(236729, continuously)
The new Taub building, hosting the department of computer science:
(Click on the picture to see it full sized)
When the visibility is perfect, this is how the Hermon mountain
(60 miles [96.5 KM] from Haifa) is seen from my office:
(Click on the picture to see the full sight)
You are viewer number
(and counting) of this page.
Stop/Resume These Annoying Moving Colored Balloons!