Hot News
(24/Aug/2020)
Prof. Lowenstein (a.k.a. as "Prof") is the manager of the ophthalmology
(eyes) department of Ichilov hospital in Tel Aviv. A lady named Ilanit,
the public-inquiries coordinator of the hopital, forwarded to Prof an
inquiry
about Dana, a resident (מתמחה) at
the department, who also happens to be my daughter!
(10/Mar/2020)
λ < 4.5252
(Klarner's constant)
Trying hard to fix a miserable bug I had a few years ago (see below),
my former PhD student Mira Shalah and I showed that λ (Klarner's
constant) is strictly less than 4.53. As a byproduct, we imrpoved
significantly the upper bound on λ3 to 9.39, and
found a general method for setting an efficient lower bound in any
dimension.
(31/Jan/2020)
Yet another Technion CS team,
Volodymyr Polosukhin, Artem Shtefan, Evgenii Zheltonozhskii,
and coaches Nofar Carmeli and Gil Ben-Shachar,
and supposedly under my virtual supervision, did well and won
bronze medals
(11th place out of 95) in the prestigious ICPC contest
(Southwestern Europe region) held in January 26, 2020 in Paris, France.
(28/Jan/2019)
My former Ph.D. student Mira Shalah appears in
Forbes
list of the 30 most promising young researchers.
(27/Nov/2017)
One more Technion CS team, Dean Leitersdorf, Volodymyr Polosukhin, Artem
Shtefan, and Coach Eden Saig,
and under my virtual supervision, performed extremely well and won
silver medals
(6th place out of 75) in the prestigious ACM/ICPC contest
(Southwestern Europe region) held in November 26, 2017 in Paris, France.
(11/Feb/2016)
Günter Rote found a gap in the proof of the upper bound on λ
claimed below; We are working on fixing the proof...
(16/Dec/2015)
λ < 4.5685
(Klarner's constant)
A new upper bound on λ (4.5685) was obtained; see
paper in EuroComb'15.
A few more tricks reduced the bound further, and it continues to go down.
(20/Nov/2013)
Again, the Technion CS team, Roei Gelbhart, Alexander Goltman, Oleg Zlotnik,
and under my virtual supervision, performed very nicely,
winning this time
bronze medals
(10th place out of 44) in the prestigious ACM/ICPC contest
(Southwestern Europe region) held in November 17, 2013 in Valencia, Spain.
(23/May/2013)
λ > 4.0025
(Klarner's constant)
Closing a 10-year effort, Günter Rote and I showed that the leading
decimal digit of λ (Klarner's constant, the asymptotic growth rate [or
growth constant] of site animals in the planar cubical lattice) is 4.
My Ph.D. student Mira Shalah participated in the last step of this research.
See more details
here.
(23/Nov/2012)
Once again, the Technion CS team, Idan Elad, Olivier Hofman, and Mike Harris,
with its coach Noa Korner and under my virtual supervision, performed nicely,
winning this time
bronze medals
(12th place) in the prestigious ACM/ICPC contest (Southwestern Europe
region) held in November 18, 2012 in Valencia, Spain.
(22/Nov/2010)
The Technion CS team, Shahar Papini, Yaniv Sabo, and Carmi Grushko, with its
coach Kolman Vornovitsky and under my supervision, won
gold medals
(2nd place) in the prestigious ACM/ICPC contest (Southwestern Europe
region) held in November 21, 2010 in Madrid, Spain.
(Shahar almost did not compete since he lost both his passport and his
contest badge. Worldwide efforts to restore both items were successful.)
(04/Mar/2009)
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 unrelated 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 and solid modeling
Geometric algorithms for medical imaging
Geometric algorithms for computer graphics
|
|
Current Research
Polyominoes and polycubes:
The running time of Jensen's Algorithm
λ (Klarner's constants) ≥ 3.9801
Redelmeier's algorithm on any lattice
Redelmeier's algorithm without the dimensionality curse
Formulas enumerating polycubes
Tree-like convex polyominoes
Exact formula for DX(n,n-3)
Permutations count polyominoes on twisted cylinders
Growth constant of tree polycubes
λ (Klarner's constants) ≥ 4 (!)
Object reconstruction from slices:
Geometric-hashing algorithm
Context-enabled interpolation
Smooth blending of slices
Straight-skeleton algorithm
Matability of polygons
Moving polygons around
Nonplanar interpolation
Multicolor interpolation
Biographic Details
Here are links to
a short résumé
and a list of publications.
My academic genealogy goes back to
Gauss, Bessel, and Weierstrass.
Post-Doctoral Fellows:
-
Muthuganapathy Ramanathan
(March 2004 - July 2006, collaborated with G. Elber and me)
-
Andrei Asinowski
(October 2010 - September 2011)
-
Minati De
(May 2014 - January 2015)
Graduate Students
Ph.D.:
-
Eyal Ackerman
(Ph.D., Computer Science, secondary advisor: R.Y. Pinter)
Counting problems for geometric structures:
Rectangulations, floorplans, and quasi-planar graphs
(dissertation;
defense held September 3, 2006;
now at Haifa University at Oranim, Israel)
M.Sc. in Sciences obtained while passing the Ph.D.-candidacy exam in
the direct track, January 1, 2004
-
Amir Vaxman
(Ph.D., Computer Science)
General techniques for interpolation, reconstruction, and morphing of
polyhedral surfaces
(dissertation;
defense held April 3, 2011;
now at Vienna University of Technology, Austria)
-
Gadi Aleksandrowicz
(Ph.D., Computer Science)
Enumeration of lattice animals
(dissertation;
defense held July 17, 2011;
now at IBM Research Labs, Haifa, Israel)
M.Sc. in Sciences obtained while passing the Ph.D.-candidacy exam in
the direct track, March 9, 2008
-
Mira Shalah
(Ph.D., Computer Science)
Formulae and growth rates of animals on cubical and triangular lattices
(dissertation;
defense held October 15, 2017;
now at Stanford University, CA)
M.Sc. in Sciences obtained while passing the Ph.D.-candidacy exam in
the direct track, May 4, 2015
-
Gil Ben-Shachar
(Ph.D., Computer Science)
Extremal properties of polyominoes
(dissertation;
defense held December 4, 2022;
now at ???)
M.Sc. in Sciences obtained while passing the Ph.D.-candidacy exam in
the direct track, December 24, 2018
M.Sc.:
-
Vadim Makhervaks
(M.Sc., Mathematics, primary advisor: A. Bruckstein)
Image flows and one-liner graphical image representations
(thesis;
defense held November 5, 2002)
-
Daniel Brunstein
(M.Sc., Computer Science, secondary advisor: 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 General Electric, Tirat Carmel, Israel)
-
Micha Moffie
(M.Sc., Computer Science)
Counting polyominoes in two and three dimensions
(thesis;
defense held December 31, 2003;
now at IBM Research Labs, Haifa, Israel)
-
Evgeny Yakersberg
(M.Sc., Computer Science)
Morphing between geometric shapes using straight-skeleton-based interpolation
(thesis;
defense held May 14, 2004;
now in Pattaya, Thailand)
-
Yuval Scharf
(M.Sc., Computer Science)
Covering points with a polygon
(thesis;
defense held September 27, 2004;
now in Mountain View, CA)
-
Aya Steiner
(M.Sc., Mathematics)
Matability of polygons
(thesis;
defense held February 28, 2005;
now in Haifa, Israel)
-
Alex Goryachev
(M.Sc., Computer Science)
Offset polygon and annulus placement problems
(thesis;
defense held November 16, 2005;
now at IBM Research Labs, Haifa, Israel)
-
Dimitry Kloper
(M.Sc., Computer Science, secondary advisor: with C. Gotsman)
Geometries and topologies of triangulations of point sets
(thesis;
defense held December 21, 2005;
now at Microsoft, Haifa, 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 Systems, Haifa, Israel)
-
Avishay Sidlesky
(M.Sc., Computer Science, secondary advisor: C. Gotsman)
Polygon reconstruction from line cross-sections
(thesis;
defense held June 11, 2006)
-
Amir Vaxman
(M.Sc., Computer Science)
Nonlinear interpolation between slices
(thesis;
defense held November 22, 2006;
see also a Ph.D. entry)
-
Alina Shaikhet
(M.Sc., Computer Science)
The on-line Heilbronn's triangle problem in d dimensions
(thesis;
defense held June 20, 2007;
now in Ottawa, Canada)
-
Alik Zamansky
(M.Sc., Computer Science)
A framework for surface reconstruction of sparsely-sampled objects
(thesis;
defense held June 26, 2007;
now at BIRD Aerosystems, Herzlia, Israel)
-
Asenath Tal
(M.Sc., Computer Science)
Algorithms for Heilbronn's triangle problem
(thesis;
defense held April 19, 2009;
now at Red Bend Software, Hod HaSharon, Israel)
-
Shahar Tal
(M.Sc., Computer Science, The Open University)
Solving general lattice puzzles
(thesis;
defense held May 1, 2011;
now at HP, Israel)
-
Raeda Naamnieh
(M.Sc., Computer Science)
Fair multi-label reconstruction from cross-sections
(thesis;
defense held November 7, 2013)
-
Abraham Stiefel
(M.Sc., Computer Science)
Motion planning in the presence of mobile obstacles
(thesis;
defense held October 26, 2015)
-
Yufei Zheng
(M.Sc., Computer Science)
Two researches on lattice animals
(thesis;
defense held June 27, 2018;
now a Ph.D. student at Princeton, NJ)
-
Bar Magal
(M.Sc., Computer Science)
Enumerating polyominoes with fixed perimeter defect
(thesis;
defense held September 1, 2021;
now at Exodigo, Tel Aviv)
-
Matan Eyn-Avi
(M.Sc., Computer Science)
A new lower bound on the growth constant of polycubes in three dimensions
(thesis;
defense held September 12, 2022;
now [12/2022] is serving the IDF)
-
Amani Shhadi
(M.Sc., Computer Science)
Topology-controlled reconstruction from partial planar cross-sections
(thesis;
defense held September 12, 2022;
now at ???, ???)
-
Antoine Vinciguerra
(M.Sc., Computer Science)
On the structure of Heilbronn's configurations
(thesis;
defense held October 23, 2022;
now at ???, ???)
In progress:
Publicly-Available Resources
My
electronic collection of human organs and digital terrains
(in polygonal-slices format), and related software
My
partial surface matching and object registration software
My
polyhedral environment and database software (DCEL)
Software for
approximating the minimum-volume bounding box of a spatial point
set (with Sariel Har-Peled)
Teaching
Computational Geometry (236719,
announcement):
Fall 15-16,
Fall 14-15,
Fall 12-13,
Fall 11-12,
Fall 10-11,
Fall 09-10 (Tufts University),
Fall 08-09,
Spring 07-08,
Spring 06-07,
Spring 05-06,
Spring 04-05,
Spring 03-04,
Fall 02-03,
Spring 01-02,
Spring 00-01,
Spring 99-00 (236603),
Spring 98-99 (236601)
Project in Copmutational Geometry (236729):
Continuously (Technion),
Fall 95-96 (TAU, project)
Discrete Algorithmic Geometry (238739):
Spring 15-16,
Spring 14-15,
Spring 12-13,
Spring 10-11,
Fall 07-08 (236739),
Fall 05-06 (236604),
Spring 02-03 (236601)
Advanced Seminar on Geometric Computing:
Graphics:
Spring 01-02 (236801)
Object reconstruction:
Fall 06-07 (236801),
Spring 04-05 (236801),
Spring 03-04 (236801),
Spring 95-96 (TAU)
Polyominoes and polycubes:
Fall 15-16 (236803),
Fall 14-15 (236804),
Spring 11-12 (236801),
Fall 08-09 (236803)
Computer Graphics 1 (234325):
Fall 03-04
Introduction to System Programming (234122):
Fall 16-17,
Fall 13-14,
Fall 12-13,
Fall 11-12,
Fall 10-11,
Spring 09-10,
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 (2016-17 I
תשע"ז)
-
Computational Geometry
(236719, Tuesday 12:30-14:30, Taub ??)
-
Introduction to System Programming
(234122, Monday 12:30-14:30, Taub ??)
- Project in Computational Geometry
(236729, continuously)
PhD and Postdoc,
CS, Tel Aviv University
(Tel Aviv, Israel, 1991-96)
Postdoc,
CS, Johns Hopkins University
(Baltimore, MD, 1996-98)
Sabbatical,
CS, Tufts University
(Medford, MA, 2009-10)
Office address:
Dept. of Computer Science
(New Taub bldg., fl. 4, rm. 430)
Technion---Israel Inst. of Technology
Haifa 32000
Israel
+972 (4) 829-3219
(ask Inbal below)
(center) +972 (4) 829-5538
(dept.) +972 (4) 829-3900
barequet@cs.technion.ac.il
http://www.cs.technion.ac.il/~barequet
CGGC administrative assistant:
Inbal Barazani
New Taub bldg., fl. 4, rm. 427
phone: +972 (4) 829-4906;
fax: +972 (4) 829-5538
inbalb@cs.technion.ac.il
View in and from the Technion:
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 [Dani B., 07/01/2003],
and a new picture shot ten
years later [Mira S., 29/01/2013])
|
|
You are viewer number
(and counting) of this page.
|
|
Stop/Resume These Annoying Moving Colored Balloons!
|