Publications
Request a copy
Theses

G. Barequet,
A system for automatic generation of demonstrations for concurrent
graphical software systems,
M.Sc. Thesis (under the supervision of Prof. A. Yehudai),
Dept. of Computer Science, Tel Aviv University, 1987.

G. Barequet,
Applications of geometric hashing to the repair, reconstruction, and
matching of threedimensional objects,
Ph.D. Dissertation (under the supervision of Prof. M. Sharir),
Dept. of Computer Science, Tel Aviv University, 1994.
(.ps.gz
1.73M)
Book Chapters

G. Barequet,
Geometric hashing and its applications,
in: Database and Data Communication Network Systems:
Techniques and Applications
(C.T. Leondes, ed.),
vol. I, ch. 8, pp. 277287,
Elsevier, June 2002.

G. Barequet,
Computer techniques and applications in rapid prototyping,
in: Computer Aided and Integrated Manufacturing Systems
(C.T. Leondes, ed.),
vol. 4 (CAD/CAM), ch. 6, pp. 281295,
World Scientific Publishing Co., September 2003.
Journal Papers

G. Barequet and M. Sharir,
Filling gaps in the boundary of a polyhedron,
ComputerAided Geometric Design
(CAGD),
12 (2), 207229, March 1995.

G. Barequet and M. Sharir,
Piecewiselinear interpolation between polygonal slices,
Computer Vision and Image Understanding
(CVIU),
63 (2), 251272, March 1996.

G. Barequet, B. Chazelle, L.J. Guibas, J.S.B. Mitchell, and A. Tal,
BOXTREE: A hierarchical representation for surfaces in 3D,
Computer Graphics Forum
(CGF),
15 (3), C387396, August 1996.

G. Barequet and M. Sharir,
Partial surface and volume matching in three dimensions,
IEEE Trans. on Pattern Analysis and Machine Intelligence
(TPAMI),
19 (9), 929948, September 1997.

G. Barequet, M. Dickerson, and P. Pau,
Translating a convex polygon to contain a maximum number of points,
Computational Geometry: Theory and Applications
(CGTA),
8 (4), 167179, September 1997.

G. Barequet,
Using geometric hashing to repair CAD objects,
IEEE Computational Science & Engineering
(CS&E),
4 (4), 2228, OctoberDecember 1997.

G. Barequet and Y. Kaplan,
A data frontend for layered manufacturing,
ComputerAided Design
(CAD),
30 (4), 231243, April 1998.

G. Barequet, C.A. Duncan, and S. Kumar,
RSVP: A geometric toolkit for controlled repair of solid models,
IEEE Trans. on Visualization and Computer Graphics
(TVCG),
4 (2), 162177, AprilJune 1998.

G. Barequet and B. Wolfers,
Optimizing a strip separating two polygons,
Graphical Models and Image Processing
(GMIP),
60 (3), 214221, May 1998.

G. Barequet, M. Dickerson, and D. Eppstein,
On triangulating threedimensional polygons,
Computational Geometry: Theory and Applications
(CGTA),
10 (3), 155170, June 1998.

G. Barequet,
DCEL: A polyhedral database and programming environment,
Int. J. of Computational Geometry and Applications
(IJCGA),
8 (56), 619636, OctoberDecember 1998.

G. Barequet, A.J. Briggs, M.T. Dickerson, and M.T. Goodrich,
Offsetpolygon annulus placement problems,
Computational Geometry: Theory and Applications
(CGTA),
11 (34), 125141, December 1998.

G. Barequet and M. Sharir,
Partial surface matching by using directed footprints,
Computational Geometry: Theory and Applications
(CGTA),
12 (12), 4562, February 1999.

G. Barequet, C.A. Duncan, M.T. Goodrich, S.S. Bridgeman, and R. Tamassia,
GeomNet: Geometric computing over the Internet,
IEEE Internet Computing
(IC),
3 (2), 2129, MarchApril 1999.

G. Barequet, D. Shapiro, and A. Tal,
Multilevel sensitive reconstruction of polyhedral surfaces from parallel
slices,
The Visual Computer
(TVC),
16 (2), 116133, March 2000.

G. Barequet and S. HarPeled,
Efficiently approximating the minimumvolume bounding box
of a point set in three dimensions,
J. of Algorithms
(JAGM),
38 (1), 91109, January 2001.

G. Barequet, M.T. Dickerson, and M.T. Goodrich,
Voronoi diagrams for polygonoffset distance functions,
Discrete & Computational Geometry
(DCG),
25 (2), 271291, January 2001.

T. Surazhsky, V. Surazhsky, G. Barequet, and A. Tal,
Blending polygonal shapes with different topologies,
Computers & Graphics
(C&G),
25 (1), 2939, February 2001.

G. Barequet,
A lower bound for Heilbronn's triangle problem in d dimensions,
SIAM J. on Discrete Mathematics
(SIDMA),
14 (2), 230236, 2001.

G. Barequet,
A duality between smallface problems in arrangements of lines and
Heilbronntype problems,
Discrete Mathematics
(DM),
237 (13), 112, June 2001.

G. Elber, G. Barequet, and M.S. Kim,
Bisectors and αsectors of rational varieties,
Computing (Suppl.),
in: Geometric Modelling (G. Brunnett, H. Bieri, and G. Farin, eds.),
14, 7388, 2001,
SpringerVerlag, Wien.

G. Barequet and S. HarPeled,
Polygoncontainment and translational minHausdorffdistance between
segment sets are 3SUMhard,
Int. J. of Computational Geometry and Applications
(IJCGA),
11 (4), 465474, August 2001.

G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, and J. Snoeyink,
Efficiently approximating polygonal paths in three and higher dimensions,
Algorithmica
(ALG),
33 (2), 150167, January 2002.

V. Makhervaks, G. Barequet, and A. Bruckstein,
Image flows and oneliner graphical image representation,
in: Visualization and Imaging in Transport Phenomena
(S. Sideman and A. Landesberg, eds.),
Anals of the New York Academy of Sciences
(NYAS), 972,
1018, October 2002.

G. Barequet, M.T. Dickerson, and R.L.S. Drysdale,
2point site Voronoi diagrams,
Discrete Applied Mathematics
(DAM),
122 (13), 3754, October 2002.

G. Barequet,
The online Heilbronn's triangle problem,
Discrete Mathematics
(DM),
283 (13), 714, June 2004.

G. Barequet, M.T. Goodrich, A. LeviSteiner, and D. Steiner,
Contour interpolation by straight skeletons,
Graphical Models
(GM),
66 (4), 245260, July 2004.

G. Barequet, M.T. Goodrich, and C. Riley,
Drawing planar graphs with large vertices and thick edges,
J. of Graph Algorithms and Applications
(JGAA),
8 (1), 320, 2004.

G. Barequet and G. Elber,
Optimal bounding cones of vectors in three dimensions,
Information Processing Letters
(IPL),
93 (1), 8389, January 2005.

G. Barequet, P. Bose, M.T. Dickerson, and M.T. Goodrich,
Optimizing a constrained convex polygonal annulus,
J. of Discrete Algorithms
(JDA),
3 (1), 126, March 2005.

G. Barequet, G. Elber, and M.S. Kim,
Computing the minimum enclosing circle of a set of planar curves,
ComputerAided Design and Applications
(CADA),
2 (14), 301308, June 2005.

E. Ackerman, G. Barequet, R.Y. Pinter, and D. Romik,
The number of guillotine partitions in d dimensions,
Information Processing Letters
(IPL),
98 (4), 162167, May 2006.

E. Ackerman, G. Barequet, and R.Y. Pinter,
A bijection between permutations and floorplans, and its applications,
Discrete Applied Mathematics
(DAM),
154 (12), 16741685, July 2006.

E. Ackerman, G. Barequet, and R.Y. Pinter,
On the number of rectangulations of a planar point set,
J. of Combinatorial Theory, Series A
(JCTA),
113 (6), 10721091, August 2006.

G. Barequet and J. Naor,
Large kD simplices in the ddimensional unit cube,
Far East J. of Applied Mathematics
(FJAM),
24 (3), 343354, September 2006.

G. Barequet, M. Moffie, A. Ribó, and G. Rote,
Counting polyominoes on twisted cylinders,
Integers: Electronic J. of Combinatorial Number Theory
(INT),
6, #A22, 37 pp., September 2006.

G. Barequet and V. Rogol,
Maximizing the area of an axiallysymmetric polygon inscribed in a
simple polygon,
Computers & Graphics
(C&G),
31 (1), 127136, January 2007.

G. Barequet and M. Moffie,
On the complexity of Jensen's algorithm for counting fixed polyominoes,
J. of Discrete Algorithms
(JDA),
5 (2), 348355, June 2007.

G. Barequet and A. Shaikhet,
The online Heilbronn's triangle problem in d dimensions,
Discrete & Computational Geometry
(DCG),
38 (1), 5160, July 2007.

G. Barequet, M.T. Dickerson, and Y. Scharf,
Covering points with a polygon,
Computational Geometry: Theory and Applications
(CGTA),
39 (3), 143162, April 2008.

G. Barequet and A. Vaxman,
Nonlinear interpolation between slices,
Int. J. of Shape Modeling
(IJSM),
14 (1), 3960, June 2008.

G. Barequet and A. Steiner,
On the matability of polygons,
Int. J. of Computational Geometry and Applications
(IJCGA),
18 (5), 469506, October 2008.

G. Aleksandrowicz and G. Barequet,
Counting ddimensional polycubes and nonrectangular planar
polyominoes,
Int. J. of Computational Geometry and Applications
(IJCGA),
19 (3), 215229, June 2009.

G. Aleksandrowicz and G. Barequet,
Counting polycubes without the dimensionality curse,
Discrete Mathematics
(DM),
309 (13), 45764583, July 2009.

G. Barequet and A. Vaxman,
Reconstruction of multilabel domains from partial planar crosssections,
Computer Graphics Forum
(CGF),
28 (5), 13271337, July 2009.

R. Barequet, G. Barequet, and G. Rote,
Formulae and growth rates of highdimensional polycubes,
Combintorica
(COMB),
30 (3), 257275, May 2010.

S. Biasotti, G. Patanè, M. Spagnuolo, B. Falcidieno, and G. Barequet,
Shape approximation by differential properties of scalar functions,
Computers & Graphics
(C&G),
34 (3), 252262, June 2010.

I. Hanniel and G. Barequet,
On the triangleperimeter twosite Voronoi diagram,
Trans. on Computational Science
(TCS), IX,
Lecture Notes in Computer Science, 6290,
SpringerVerlag, 5475, 2010.

R. Muthuganapathy, G. Elber, G. Barequet, and M.S. Kim,
Computing the minimum enclosing sphere of freeform hypersurfaces in
arbitrary dimensions,
ComputerAided Design
(CAD),
43 (3), 247257, March 2011.

K. Vyatkina and G. Barequet,
On multiplicatively weighted Voronoi diagrams for lines in the plane,
Trans. on Computational Science
(TCS), XIII,
Lecture Notes in Computer Science, 6750,
SpringerVerlag, 4471, 2011.

G. Aleksandrowicz, A. Asinowski, and G. Barequet,
A polyominoespermutations injection and treelike convex polyominoes,
J. of Combinatorial Theory, Series A
(JCTA),
119 (3), 503520, April 2012.

M. AlJubeh, G. Barequet, M. Ishaque, D.L. Souvaine, C.D. Tóth, and
A. Winslow,
Constrained triconnected planar straight line graphs,
in: Thirty Essays on Geometric Graph Theory (J. Pach, ed.),
Springer, September 2012.

A. Asinowski, G. Barequet, R. Barequet, and G. Rote,
Proper ncell polycubes in n3 dimensions,
J. of Integer Sequences
(JIS),
15, #12.8.4, 16 pp., October 2012.

G. Barequet, N. Benbernou, D. Charlton, E.D. Demaine, M.L. Demaine,
M. Ishaque, A. Lubiw, A. Schulz, D.L. Souvaine, G.T. Toussaint,
and A. Winslow,
Boundeddegree polyhedronization of point sets,
Computational Geometry: Theory and Applications
(CGTA),
46 (2), 148153, February 2013.

G. Barequet, M.T. Dickerson, D. Eppstein, D. Hodorkovsky, and K. Vyatkina,
On 2site Voronoi diagrams under geometric distance functions,
J. of Computer Science and Technology
(JCST),
28 (2), 267277, March 2013.

G. Aleksandrowicz, A. Asinowski, and G. Barequet,
Permutations with forbidden patterns and polyominoes on a twisted cylinder
of width 3,
Discrete Mathematics
(DM),
313 (10), 10781086, May 2013.

A. Asinowski, G. Barequet, M. BousquetMélou, T. Mansour,
and R.Y. Pinter,
Orders induced by segments in floorplan partitions and
(2143,3412)avoiding permutations,
Electronic J. of Combinatorics
(ElJC),
20 (2), #P35, 43 pp., May 2013.

G. Aleksandrowicz and G. Barequet,
The growth rate of highdimensional tree polycubes,
European J. of Combinatorics
(EuJC),
35, 3238, January 2014.

G. Barequet and A. Goryachev,
Offset polygon and annulus placement problems,
Computational Geometry: Theory and Applications
(CGTA),
47 (3), 407434, April 2014.

A. Asinowski, G. Barequet, T. Mansour, and R.Y. Pinter,
Structure and enumeration of cutequivalence classes of
ddimensional guillotine partitions,
Discrete Mathematics
(DM),
331, 165173, November 2014.
Refereed Conference Papers (speaker underlined)

G. Barequet and M. Sharir,
Piecewiselinear interpolation between polygonal slices,
Proc. 10th Ann. ACM Symp. on Computational Geometry
(SoCG),
Stony Brook, NY, 93102, June 1994.

G. Barequet and M. Sharir,
Partial surface and volume matching in three dimensions,
Proc. 12th Ann. IAPR and IEEE Int. Conf. on Pattern Recognition
(ICPR),
Jerusalem, Israel, vol. 2, 610614, October 1994.

G. Barequet, M. Dickerson, and P. Pau,
Translating a convex polygon to contain a maximum number of points,
7th Canadian Conf. on Computational Geometry
(CCCG),
Québec City, Québec, Canada, 6166, August 1995.

G. Barequet, M. Dickerson, and D. Eppstein,
On triangulating threedimensional polygons,
Proc. 12th Ann. ACM Symp. on Computational Geometry
(SoCG),
Philadelphia, PA, 3847, May 1996.

G. Barequet and M. Sharir,
Partial surface matching by using directed footprints,
Proc. 12th Ann. ACM Symp. on Computational Geometry
(SoCG),
Philadelphia, PA, C910, May 1996.

G. Barequet, B. Chazelle, L.J. Guibas, J.S.B. Mitchell, and A. Tal,
BOXTREE: A hierarchical representation for surfaces in 3D,
Proc. Eurographics
(EG)
(J. Rossignac and F. Sillion, eds.),
FutureoscopePoiliers, France, August 1996.

G. Barequet and B. Wolfers,
Optimizing a corridor between two polygons with an application to
polyhedral interpolation,
Proc. 8th Canadian Conf. on Computational Geometry
(CCCG),
Ottawa, Ontario, Canada, 3237, August 1996.

G. Barequet, D. Shapiro, and A. Tal,
History consideration in reconstructing polyhedral surfaces from
parallel slices,
Proc. 7th IEEE Conf. on Visualization
(VIS),
SanFrancisco, CA, 149156, October 1996.

G. Barequet and Y. Kaplan,
A data frontend for layered manufacturing,
Proc. 13th Ann. ACM Symp. on Computational Geometry
(SoCG),
Nice, France, 231239, June 1997.

G. Barequet, S.S. Bridgeman, C.A. Duncan, M.T. Goodrich, and R. Tamassia,
Classical computational geometry in GeomNet,
Proc. 13th Ann. ACM Symp. on Computational Geometry
(SoCG),
Nice, France, 412414, June 1997.

G. Barequet, M.T. Dickerson, and M.T. Goodrich,
Voronoi diagrams for polygonoffset distance functions,
Proc. 5th Workshop on Algorithms and Data Structures
(WADS),
Halifax, Nova Scotia, Canada,
Lecture Notes in Computer Science, 1272,
SpringerVerlag, 200209, August 1997.

G. Barequet, A.J. Briggs, M.T. Dickerson, and M.T. Goodrich,
Offsetpolygon annulus placement problems,
Proc. 5th Workshop on Algorithms and Data Structures
(WADS),
Halifax, Nova Scotia, Canada,
Lecture Notes in Computer Science, 1272,
SpringerVerlag, 378391, August 1997.

G. Barequet and S. Kumar,
Repairing CAD Models,
Proc. 8th IEEE Conf. on Visualization
(VIS),
Phoenix, AZ, 363370, October 1997.

G. Barequet, D.Z. Chen, O. Daescu, M.T. Goodrich, and J. Snoeyink,
Efficiently approximating polygonal paths in three and higher dimensions,
Proc. 14th Ann. ACM Symp. on Computational Geometry
(SoCG),
Minneapolis, MN, 317326, June 1998.

G. Barequet,
A lower bound for Heilbronn's triangle problem in d dimensions,
Proc. 10th Ann. ACMSIAM Symp. on Discrete Algorithms
(SODA),
Baltimore, MD, 7681, January 1999.

G. Barequet and S. HarPeled,
Efficiently approximating the minimumvolume bounding box of a point set in
three dimensions,
Proc. 10th Ann. ACMSIAM Symp. on Discrete Algorithms
(SODA),
Baltimore, MD, 8291, January 1999.

G. Barequet and S. HarPeled,
Polygoncontainment and translational minHausdorffdistance between
segment sets are 3SUMhard,
Proc. 10th Ann. ACMSIAM Symp. on Discrete Algorithms
(SODA),
Baltimore, MD, S862863, January 1999.

G. Barequet, P. Bose, and M.T. Dickerson,
Optimizing constrained offset and scaled polygonal annuli,
Proc. 6th Workshop on Algorithms and Data Structures
(WADS),
Vancouver, British Columbia, Canada,
Lecture Notes in Computer Science, 1663,
SpringerVerlag, 6273, August 1999.

G. Barequet, M.T. Dickerson, and R.L.S. Drysdale,
2point site Voronoi diagrams,
Proc. 6th Workshop on Algorithms and Data Structures
(WADS),
Vancouver, British Columbia, Canada,
Lecture Notes in Computer Science, 1663,
SpringerVerlag, 219230, August 1999.

G. Barequet,
A duality between smallface problems in arrangements
of lines and Heilbronntype problems,
Proc. 6th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Sydney, Australia,
Lecture Notes in Computer Science, 1858,
SpringerVerlag, 4352, July 2000.

G. Barequet and M.T. Dickerson,
The translationscale diagram for pointcontaining placements of a convex
polygon,
Proc. 12th Canadian Conf. on Computational Geometry
(CCCG),
Fredericton, New Brunswick, Canada, 712, August 2000.

G. Barequet,
ωsearchlight obedient graph drawings,
Proc. 8th Int. Symp. on Graph Drawing
(GD),
Colonial Williamsburg, VA,
Lecture Notes in Computer Science, 1984,
SpringerVerlag, 321327, September 2000.

M. Pop, G. Barequet, C.A. Duncan, M.T. Goodrich, W. Huang, and S. Kumar,
Efficient perspectiveaccurate silhouette computation and applications,
Proc. 17th Ann. ACM Symp. on Computational Geometry
(SoCG),
Medford, MA, 6068, June 2001.

V. Makhervaks, G. Barequet, and A. Bruckstein,
Image flows and oneliner graphical image representation,
Proc. 16th Ann. IAPR and IEEE Int. Conf. on Pattern Recognition
(ICPR),
Québec City, Québec, Canada, vol. 1, 640643, August 2002.

G. Barequet,
The online Heilbronn's triangle problem in three and four dimensions,
Proc. 8th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Singapore,
Lecture Notes in Computer Science, 2387,
SpringerVerlag, 360369, August 2002.

G. Barequet, M.T. Goodrich, A. LeviSteiner, and D. Steiner,
Straightskeleton based contour interpolation,
Proc. 14th Ann. ACMSIAM Symp. on Discrete Algorithms
(SODA),
Baltimore, MD, 119127, January 2003.

G. Barequet, M.T. Goodrich, and C. Riley,
Drawing graphs with large vertices and thick edges,
Proc. 8th Workshop on Algorithms and Data Structures
(WADS),
Ottawa, Ontario, Canada,
Lecture Notes in Computer Science, 2748,
SpringerVerlag, 281293, July 2003.

D. Brunstein, G. Barequet, and C. Gotsman,
Animating a camera for viewing a planar polygon,
Proc. 8th Int. Fall Workshop on Vision, Modeling, and Visualization
(VMV) ,
Munich, Germany, 8794, November 2003.

G. Barequet and M. Moffie,
The complexity of Jensen's algorithm for counting polyominoes,
Proc. 1st Workshop on Analytic Algorithmics and Combinatorics
(ANALCO),
New Orleans, LA, 161169, January 2004.

E. Ackerman, G. Barequet, and R.Y. Pinter,
On the number of rectangular partitions,
Proc. 15th Ann. ACMSIAM Symp. on Discrete Algorithms
(SODA),
New Orleans, LA, 729738, January 2004.

G. Barequet and V. Rogol,
Maximizing the area of an axiallysymmetric polygon inscribed by a simple
polygon,
Proc. 16th Canadian Conf. on Computational Geometry
(CCCG),
Montreal, Québec, Canada, 128131, August 2004.

G. Elber, R. Sayegh, G. Barequet, and R.R. Martin,
Twodimensional visibility atlases for continuous curves,
Proc. Int. Conf. on Shape Modeling and Applications
(SMI),
Cambridge, MA, 206215, June 2005.

G. Barequet, G. Elber, and M.S. Kim,
Computing the minimum enclosing circle of a set of planar curves,
Proc. Int. ComputerAided Design Conf.
(CAD),
Bangkok, Thailand, 301308, June 2005.

G. Barequet and J. Naor,
Large kD simplices in the ddimensional unit cube,
Proc. 17th Canadian Conf. on Computational Geometry
(CCCG),
Windsor, Ontario, Canada, 3033, August 2005.

G. Barequet and Y. Scharf,
The translationscalerotation diagram for pointcontaining placements of a
convex polygon,
Proc. 17th Canadian Conf. on Computational Geometry
(CCCG),
Windsor, Ontario, Canada, 172175, August 2005.

E. Ackerman, G. Barequet, and R.Y. Pinter,
An upper bound on the number of rectangulations of a point set,
Proc. 11th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Kunming, Yunnan, China,
Lecture Notes in Computer Science, 3595,
SpringerVerlag, 554559, August 2005.

G. Barequet, M. Moffie, A. Ribó, and G. Rote,
Counting polyominoes on twisted cylinders,
Proc. 3rd European Conf. on Combinatorics, Graph Theory, and
Applications
(EuroComb),
Berlin, Germany,
Discrete Mathematics and Theoretical Computer Science, AE,
369374, September 2005.

E.M. Arkin, G. Barequet, and J.S.B. Mitchell,
Algorithms for twobox covering,
Proc. 22nd Ann. ACM Symp. on Computational Geometry
(SoCG),
Sedona, AZ, 459467, June 2006.

A. Sidlesky, G. Barequet, and C. Gotsman,
Polygon reconstruction from line crosssections,
Proc. 18th Canadian Conf. on Computational Geometry
(CCCG),
Kingston, Ontario, Canada, 8184, August 2006.

G. Barequet and A. Shaikhet,
The online Heilbronn's triangle problem in d dimensions,
Proc. 12th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Taipei, Taiwan,
Lecture Notes in Computer Science, 4112,
SpringerVerlag, 408417, August 2006.

G. Aleksandrowicz and G. Barequet,
Counting ddimensional polycubes and nonrectangular planar
polyominoes,
Proc. 12th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Taipei, Taiwan,
Lecture Notes in Computer Science, 4112,
SpringerVerlag, 418427, August 2006.

G. Barequet and A. Zamansky,
Surface reconstruction by moving contours,
Proc. 9th IASTED Int. Conf. on Computer Graphics and Imaging
(CGIM),
Innsbruck, Austria, 714, February 2007.

G. Barequet and A. Vaxman,
Nonlinear interpolation between slices,
Proc. 3rd ACM Symp. on Solid and Physical Modeling
(SPM),
Beijing, China, 97107, June 2007.

G. Aleksandrowicz and G. Barequet,
Counting polycubes without the dimensionality curse,
Proc. 14th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Dalian, China,
Lecture Notes in Computer Science, 5092,
SpringerVerlag, 100109, June 2008.

G. Barequet, D. Eppstein, M.T. Goodrich, and A. Vaxman,
Straight skeletons of threedimensional polyhedra,
Proc. 16th Ann. European Symp. on Algorithms
(ESA),
Karlsruhe, Germany,
Lecture Notes in Computer Science, 5193,
SpringerVerlag, 148160, September 2008.

I. Hanniel and G. Barequet,
On the triangleperimeter twosite Voronoi diagram,
Proc. 6th Int. Symp. on Voronoi Diagrams in Science and Engineering
(ISVD),
Copenhagen, Denmark, 129136, June 2009.

G. Barequet and K. Vyatkina,
On Voronoi diagrams for lines in the plane,
Proc. 9th Int. Conf. on Computational Science and its Applications
(ICCSA),
Yongin, South Korea, 159168, JuneJuly 2009.

A. Asinowski, G. Barequet, T. Mansour, and R.Y. Pinter,
Order types of segments in floorplans,
Proc. 7th Ann. Int. Conf. on Permutation Patterns
(PP),
Florence, Italy, July 2009.

G. Barequet and A. Vaxman,
Reconstruction of multilabel domains from partial planar crosssections,
Proc. 7th Symp. on Geometry Processing
(SGP)
(M. Alexa and M. Kazhdan, eds.),
Berlin, Germany, July 2009.

R. Barequet, G. Barequet, and G. Rote,
Formulae and growth rates of highdimensional polycubes,
Proc. 5th European Conf. on Combinatorics, Graph Theory, and
Applications
(EuroComb),
Bordeaux, France,
Electronic Notes in Discrete Mathematics, 34,
459463, September 2009.

S. Biasotti, G. Patanè, M. Spagnuolo, B. Falcidieno, and
G. Barequet,
Shape approximation by differential properties of scalar functions,
Proc. Int. Conf. on Shape Modeling and Applications
(SMI),
AixenProvence, France, 252262, June 2010.

K. Vyatkina and G. Barequet,
On 2wite Voronoi diagrams under arithmetic combinations of pointtopoint
distances,
Proc. 7th Int. Symp. on Voronoi Diagrams in Science and Engineering
(ISVD),
Québec City, Québec, Canada, 3341, June 2010.

G. Barequet, N. Benbernou, D. Charlton, E.D. Demaine, M.L. Demaine,
M. Ishaque, A. Lubiw, A. Schulz, D.L. Souvaine, G.T. Toussaint,
and A. Winslow,
Boundeddegree polyhedronization of point sets,
Proc. 22th Canadian Conf. on Computational Geometry
(CCCG),
Winnipeg, Manitoba, Canada, 99102, August 2010.

G. Barequet and S. Tal,
Solving general lattice puzzles,
Proc. 4th Int. Frontiers of Algorithmics Workshop
(FAW),
Wuhan, China,
Lecture Notes in Computer Science, 6213,
SpringerVerlag, 124135, August 2010.

G. Aleksandrowicz and G. Barequet,
Parallel enumeration of lattice animals,
Proc. 5th Int. Frontiers of Algorithmics Workshop
(FAW),
Zhejiang, China,
Lecture Notes in Computer Science, 6681,
SpringerVerlag, 9099, May 2011.

G. Barequet, M.T. Dickerson, D. Eppstein, D. Hodorkovsky, and
K. Vyatkina,
On 2site Voronoi diagrams under geometric distance functions,
Proc. 8th Int. Symp. on Voronoi Diagrams in Science and Engineering
(ISVD),
Qingdao, China, 3138, June 2011.

A. Asinowski, G. Barequet, R. Barequet, and G. Rote,
Proper ncell polycubes in n3 dimensions,
Proc. 17th Ann. Int. Computing and Combinatorics Conf.
(COCOON),
Dallas, TX,
Lecture Notes in Computer Science, 6842,
SpringerVerlag, 180191, August 2011.

G. Aleksandrowicz and G. Barequet,
The growth rate of highdimensional tree polycubes,
Proc. 6th European Conf. on Combinatorics, Graph Theory, and
Applications
(EuroComb),
Budapest, Hungary,
Electronic Notes in Discrete Mathematics, 38,
2530, AugustSeptember 2011.

G. Barequet, S.M. Cannon, E. FoxEpstein, B. Hescott, D.L. Souvaine,
C.D. Tóth, and A. Winslow,
Diffuse reflections in simple polygons,
Proc. 7th LatinAmerican Algorithms, Graphs, and Optimization
Symposium
(LAGOS),
Playa del Carmen, Mexico,
Electronic Notes in Discrete Mathematics, 44,
345350, April 2013.

G. Barequet and E. Papadopoulou,
On the farthestneighbor Voronoi diagram of segments in three dimensions,
Proc. 10th Int. Symp. on Voronoi Diagrams in Science and Engineering
(ISVD),
St. Petersburg, Russia, 3136, July 2013.

G. Aleksandrowicz, A. Asinowski, G. Barequet, and R. Barequet,
Formulae for polyominoes on twisted cylinders,
Proc. 8th Int. Conf. on Language and Automata Theory and Applications
(LATA),
Madrid, Spain,
Lecture Notes in Computer Science, 8370,
SpringerVerlag, 7687, March 2014.

E. Ackerman, M. Allen, G. Barequet, M. Löffler, J. Mermelstein,
D.L. Souvaine, and C.D. Tóth,
The flip diameter of rectangulations and convex subdivisions,
Proc. 11th Latin American Theoretical Informatics Symp.
(LATIN),
Montevideo, Uruguay,
Lecture Notes in Computer Science, 8392,
SpringerVerlag, 478489, MarchApril 2014.
Review Papers

B. Chazelle,
N. Amenta, T. Asano, G. Barequet, M. Bern,
J.D. Boissonnat, J. Canny, K. Clarkson, D. Dobkin, B. Donald,
S. Drysdale, H. Edelsbrunner, D. Eppstein, A.R. Forrest, S. Fortune,
K. Goldberg, M.T. Goodrich, L.J. Guibas, P. Hanrahan, C.M. Hoffmann,
D. Huttenlocher, H. Iami, D. Kirkpatrick, D.T. Lee, K. Mehlhorn,
V. Milenkovic, J. Mitchell, M. Overmars, R. Pollack, R. Seidel,
M. Sharir, J. Snoeyink, G.T. Toussaint, S. Teller, H. Voelcker,
E. Welzl, and C.K. Yap,
The Computational Geometry Impact Task Force Report,
Advances in Discrete and Computational Geometry,
Contemporary Mathematics, 223, AMS,
Providence, RI, 407463, 1999.
(.html)

G. Barequet,
Cinderella: The interactive geometry software,
The Mathematical Intelligencer,
24 (4), 7475, 2002.
Patents
USA
 US Patent 5,031,120, Three dimensional modelling apparatus,
July 9, 1991.
(.tar.gz
1.98M)
 US Patent 5,263,130, Three dimensional modelling apparatus,
November 16, 1993.
(.tar.gz
1.88M)
 US Patent 5,287,435, Three dimensional modeling,
February 15, 1994.
(.tar.gz
1.78M)
 US Patent 5,386,500, Three dimensional modeling apparatus,
January 31, 1995.
(.tar.gz
1.92M)
 US Patent 5,519,816, Three dimensional modeling apparatus,
May 21, 1996.
(.tar.gz
1.90M)
Israel
 Israeli Patent 84936,
Three dimensional modeling apparatus and method,
June 28, 1989.
 Israeli Patent 95034,
Three dimensional modeling,
February 12, 1992.
Videos

G. Barequet, A.J. Briggs, M.T. Dickerson, C.S. Dima, and M.T. Goodrich,
Animating the offsetpolygon distance function,
Video Review at the 13th Ann. ACM Symp. on Computational Geometry
(SoCG),
Nice, France, 479480, June 1997.
(.pdf.gz
533K)

G. Barequet, C.A. Duncan, M.T. Goodrich, S. Kumar, and M. Pop,
Efficient perspectiveaccurate silhouette computation,
Video Review at the 15th Ann. ACM Symp. on Computational Geometry
(SoCG),
Miami, FL, 417418, June 1999.
(.ps.gz
44K)

G. Barequet, M.T. Dickerson, R.L.S. Drysdale, and D.S. Guertin,
2Point Site Voronoi Diagrams,
Video Review at the 17th Ann. ACM Symp. on Computational Geometry
(SoCG),
Medford, MA, 323324, June 2001.
(.pdf.gz
82K)

G. Barequet and E. Yakersberg,
Morphing between shapes by using their straight skeletons,
Video Review at the 19th Ann. ACM Symp. on Computational Geometry
(SoCG),
San Diego, CA, 378379, June 2003.
(.pdf.gz
99K,
.exe.gz
16.7M)

G. Barequet, Y. Scharf, and M.T. Dickerson,
Covering points with a Polygon,
Video Review at the 21th Ann. ACM Symp. on Computational Geometry
(SoCG),
Pisa, Italy, 376377, June 2005.
(.pdf.gz
83K)

G. Barequet and A. Shaikhet,
Heilbronn's triangle problem,
Video Review at the 23rd Ann. ACM Symp. on Computational Geometry
(SoCG),
Gyeongju, South Korea, 127128, June 2007.
(.pdf.gz
72K)

G. Barequet and A. Vaxman,
Straight skeletons of threedimensional polyhedra,
Video Review at the 25th Ann. ACM Symp. on Computational Geometry
(SoCG),
Aarhus, Denmark, 100101, June 2009.
(.pdf.gz
647K)

G. Aleksandrowicz and G. Barequet,
Redelmeier's algorithm for counting lattice animals,
Video Review at the 27th Ann. ACM Symp. on Computational Geometry
(SoCG),
Paris, France, 283284, June 2011.

G. Barequet and M. Shalah,
Polyominoes on twisted cylinders,
Video Review at the 29th Ann. ACM Symp. on Computational Geometry
(SoCG),
Rio de Janeiro, Brazil, 339340, June 2013.
Others

G. Barequet,
Large models: Software tools that aid their production,
Rapid Prototyping Monitor,
1 (2), 45, September 1991.
(.pdf.gz
1.08M)
Student Theses
Ph.D.:

E. Ackerman,
Counting problems for geometric structures:
Rectangulations, floorplans, and quasiplanar graphs,
Ph.D. Dissertation, Dept. of Computer Science, Technion, July 2006.
(.pdf.gz
980K)

A. Vaxman,
General techniques for interpolation, reconstruction, and morphing of
polyhedral surfaces,
Ph.D. Thesis, Dept. of Computer Science, Technion, February 2011.
(.pdf.gz
3.95M)

G. Aleksandrowicz,
Enumeration of lattice animals,
Ph.D. Thesis, Dept. of Computer Science, Technion, June 2011.
(.pdf.gz
913K)
M.Sc.:

V. Makhervaks,
Image flows and oneliner graphical image representations,
M.Sc. Thesis, Dept. of Mathematics, Technion, December 2002.
(.ps.gz
5.58M,
.pdf.gz
3.90M)

D. Brunstein,
Animating a camera for viewing a planar polygon,
M.Sc. Thesis, Dept. of Computer Science, Technion, June 2003.
(.pdf.gz
2.79M,
.rar
video 60M)

V. Rogol,
Maximizing the area of an axiallysymmetric polygon inscribed by a simple
polygon,
M.Sc. Thesis, Dept. of Electrical Engineering, Technion, June 2003.
(.pdf.gz
1.68M)

M. Moffie,
Counting polyominoes in two and three dimensions,
M.Sc. Thesis, Dept. of Computer Science, Technion, December 2003.
(.pdf.gz
463K)

Evgeny Yakersberg,
Morphing between geometric shapes using straightskeletonbased interpolation,
M.Sc. Thesis, Dept. of Computer Science, Technion, May 2004.
(.pdf.gz
1.67M)

Yuval Scharf,
Covering points with a polygon,
M.Sc. Thesis, Dept. of Computer Science, Technion, October 2004.
(.pdf.gz
312K)

A. Steiner,
Matability of polygons,
M.Sc. Thesis, Dept. of Mathematics, Technion, February 2005.
(.pdf.gz
1.16M)

A. Goryachev,
Offset polygon and annulus placement problems,
M.Sc. Thesis, Dept. of Computer Science, Technion, September 2005.
(.pdf.gz
759K)

D. Kloper,
Geometries and topologies of triangulations of point sets,
M.Sc. Thesis, Dept. of Computer Science, Technion, November 2005.

D. Hodorkovsky,
2point site Voronoi diagrams,
M.Sc. Thesis, Dept. of Mathematics, Technion, November 2005.
(.pdf.gz
903K)

J. Naor,
ddimensional variants of Heilbronn's triangle problem,
M.Sc. Thesis, Dept. of Computer Science, Technion, December 2005.
(.pdf.gz
240K)

A. Sidlesky,
Polygon reconstruction from line crosssections,
M.Sc. Thesis, Dept. of Computer Science, Technion, June 2006.
(.pdf.gz
1.92M)

A. Vaxman,
Nonlinear interpolation between slices,
M.Sc. Thesis, Dept. of Computer Science, Technion, November 2006.
(.pdf.gz
4.22M)

A. Shaikhet,
The online Heilbronn's triangle problem in d dimensions,
M.Sc. Thesis, Dept. of Computer Science, Technion, May 2007.
(.pdf.gz
541K)

A. Zamansky,
A framework for surface reconstruction of sparselysampled objects,
M.Sc. Thesis, Dept. of Computer Science, Technion, July 2007.
(.pdf.gz
1.02M)

Asenath Tal,
Algorithms for Heilbronn's triangle problem,
M.Sc. Thesis, Dept. of Computer Science, Technion, February 2009.
(.pdf.gz
738K)

Shahar Tal,
Solving general lattice puzzles,
M.Sc. Thesis, Dept. of Computer Science,
The Open University, Ra'anana, Israel, September 2010.
(.pdf.gz
3.34M)

Raeda Naamnieh,
Fair multilabel reconstruction from crosssections,
M.Sc. Thesis, Dept. of Computer Science, Technion, November 2013.
(.pdf.gz
1.34M)

Back to Gill's Home Page 