Skip to main menu (access key '1') Skip to content (access key 's') Skip to contact info (access key '2') Skip to phone directory (access key '3') Skip to site map (access key '4') Skip to accessibility information (access key '0')
You are here: › › ›
Photo of Prof. Gill Barequet

Prof. Gill Barequet

Contact information
Homepage:
http://www.cs.technion.ac.il/~barequet/
Email:
barequetcs.technion.ac.il
Office:
430
Phone:
(972)-4-829-3219
Office Hours:
By appointmen via email
Research interests
Discrete and computational geometry; geometric computing; combinatorics;computer-aided geometric design; computer graphics and visualization.
Selected publications

Book Chapters

  1. 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. 277-287, Elsevier, June 2002. (.ps.gz 85K)
  2. 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. 281-295, World Scientific Publishing Co., September 2003. (.ps.gz 247K)
  3. G. Barequet, S.W. Golomb, and D.A. Klarner, Polyominoes, in: Handbook of Discrete and Computational Geometry (E. Goodman, J. O'Rourke, and C.D. Tóth, eds.), 3rd ed., Chapman and Hall/CRC Press, November 2017.

Journal Papers

  1. G. Barequet and M. Sharir, Filling gaps in the boundary of a polyhedron, Computer-Aided Geometric Design (CAGD), 12 (2), 207-229, March 1995.
  2. G. Barequet and M. Sharir, Piecewise-linear interpolation between polygonal slices, Computer Vision and Image Understanding (CVIU), 63 (2), 251-272, March 1996.
  3. 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), C387-396, August 1996.
  4. G. Barequet and M. Sharir, Partial surface and volume matching in three dimensions, IEEE Trans. on Pattern Analysis and Machine Intelligence (T-PAMI), 19 (9), 929-948, September 1997.
  5. 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), 167-179, September 1997.
  6. G. Barequet, Using geometric hashing to repair CAD objects, IEEE Computational Science & Engineering (CS&E), 4 (4), 22-28, October-December 1997.
  7. G. Barequet and Y. Kaplan, A data front-end for layered manufacturing, Computer-Aided Design (CAD), 30 (4), 231-243, April 1998.
  8. 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), 162-177, April-June 1998.
  9. G. Barequet and B. Wolfers, Optimizing a strip separating two polygons, Graphical Models and Image Processing (GMIP), 60 (3), 214-221, May 1998.
  10. G. Barequet, M. Dickerson, and D. Eppstein, On triangulating three-dimensional polygons, Computational Geometry: Theory and Applications (CGTA), 10 (3), 155-170, June 1998.
  11. G. Barequet, DCEL: A polyhedral database and programming environment, Int. J. of Computational Geometry and Applications (IJCGA), 8 (5-6), 619-636, October-December 1998.
  12. G. Barequet, A.J. Briggs, M.T. Dickerson, and M.T. Goodrich, Offset-polygon annulus placement problems, Computational Geometry: Theory and Applications (CGTA), 11 (3-4), 125-141, December 1998.
  13. G. Barequet and M. Sharir, Partial surface matching by using directed footprints, Computational Geometry: Theory and Applications (CGTA), 12 (1-2), 45-62, February 1999.
  14. 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), 21-29, March-April 1999.
  15. G. Barequet, D. Shapiro, and A. Tal, Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices, The Visual Computer (TVC), 16 (2), 116-133, March 2000.
  16. G. Barequet and S. Har-Peled, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, J. of Algorithms (JoA), 38 (1), 91-109, January 2001.
  17. G. Barequet, M.T. Dickerson, and M.T. Goodrich, Voronoi diagrams for polygon-offset distance functions, Discrete & Computational Geometry (DCG), 25 (2), 271-291, January 2001.
  18. T. Surazhsky, V. Surazhsky, G. Barequet, and A. Tal, Metamorphosis of polygonal shapes with different topologies, Computers & Graphics (C&G), 25 (1), 29-39, February 2001.
  19. G. Barequet, A lower bound for Heilbronn's triangle problem in d dimensions, SIAM J. on Discrete Mathematics (SIDMA), 14 (2), 230-236, 2001.
  20. G. Barequet, A duality between small-face problems in arrangements of lines and Heilbronn-type problems, Discrete Mathematics (DM), 237 (1-3), 1-12, June 2001.
  21. 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, 73-88, 2001, Springer-Verlag, Wien.
  22. G. Barequet and S. Har-Peled, Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard, Int. J. of Computational Geometry and Applications (IJCGA), 11 (4), 465-474, August 2001.
  23. 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), 150-167, January 2002.
  24. V. Makhervaks, G. Barequet, and A. Bruckstein, Image flows and one-liner 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, 10-18, October 2002.
  25. G. Barequet, M.T. Dickerson, and R.L.S. Drysdale, 2-point site Voronoi diagrams, Discrete Applied Mathematics (DAM), 122 (1-3), 37-54, October 2002.
  26. G. Barequet, The on-line Heilbronn's triangle problem, Discrete Mathematics (DM), 283 (1-3), 7-14, June 2004.
  27. G. Barequet, M.T. Goodrich, A. Levi-Steiner, and D. Steiner, Contour interpolation by straight skeletons, Graphical Models (GM), 66 (4), 245-260, July 2004.
  28. 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), 3-20, 2004.
  29. G. Barequet and G. Elber, Optimal bounding cones of vectors in three dimensions, Information Processing Letters (IPL), 93 (1), 83-89, January 2005.
  30. G. Barequet, P. Bose, M.T. Dickerson, and M.T. Goodrich, Optimizing a constrained convex polygonal annulus, J. of Discrete Algorithms (JDA), 3 (1), 1-26, March 2005.
  31. G. Barequet, G. Elber, and M.-S. Kim, Computing the minimum enclosing circle of a set of planar curves, Computer-Aided Design and Applications (CADA), 2 (1-4), 301-308, June 2005.
  32. E. Ackerman, G. Barequet, R.Y. Pinter, and D. Romik, The number of guillotine partitions in d dimensions, Information Processing Letters (IPL), 98 (4), 162-167, May 2006.
  33. E. Ackerman, G. Barequet, and R.Y. Pinter, A bijection between permutations and floorplans, and its applications, Discrete Applied Mathematics (DAM), 154 (12), 1674-1685, July 2006.
  34. E. Ackerman, G. Barequet, and R.Y. Pinter, On the number of rectangulations of a planar point set, J. of Combinatorial Theory, Series A (JCT-A), 113 (6), 1072-1091, August 2006.
  35. G. Barequet and J. Naor, Large k-D simplices in the d-dimensional unit cube, Far East J. of Applied Mathematics (FJAM), 24 (3), 343-354, September 2006.
  36. 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.
  37. G. Barequet and V. Rogol, Maximizing the area of an axially-symmetric polygon inscribed in a simple polygon, Computers & Graphics (C&G), 31 (1), 127-136, January 2007.
  38. G. Barequet and M. Moffie, On the complexity of Jensen's algorithm for counting fixed polyominoes, J. of Discrete Algorithms (JDA), 5 (2), 348-355, June 2007.
  39. G. Barequet and A. Shaikhet, The on-line Heilbronn's triangle problem in d dimensions, Discrete & Computational Geometry (DCG), 38 (1), 51-60, July 2007.
  40. G. Barequet, M.T. Dickerson, and Y. Scharf, Covering points with a polygon, Computational Geometry: Theory and Applications (CGTA), 39 (3), 143-162, April 2008.
  41. G. Barequet and A. Vaxman, Nonlinear interpolation between slices, Int. J. of Shape Modeling (IJSM), 14 (1), 39-60, June 2008.
  42. G. Barequet and A. Steiner, On the matability of polygons, Int. J. of Computational Geometry and Applications (IJCGA), 18 (5), 469-506, October 2008.
  43. G. Aleksandrowicz and G. Barequet, Counting d-dimensional polycubes and nonrectangular planar polyominoes, Int. J. of Computational Geometry and Applications (IJCGA), 19 (3), 215-229, June 2009.
  44. G. Aleksandrowicz and G. Barequet, Counting polycubes without the dimensionality curse, Discrete Mathematics (DM), 309 (13), pp. 4576-4583, July 2009.
  45. G. Barequet and A. Vaxman, Reconstruction of multi-label domains from partial planar cross-sections, Computer Graphics Forum (CGF), 28 (5), 1327-1337, July 2009.
  46. R. Barequet, G. Barequet, and G. Rote, Formulae and growth rates of high-dimensional polycubes, Combintorica (COMB), 30 (3), 257-275, May 2010.
  47. 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) 252-262, June 2010.
  48. I. Hanniel and G. Barequet, On the triangle-perimeter two-site Voronoi diagram, Trans. on Computational Science (TCS), IX, Lecture Notes in Computer Science, 6290, Springer-Verlag, 54-75, 2010.
  49. R. Muthuganapathy, G. Elber, G. Barequet, and M.-S. Kim, Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions, Computer-Aided Design (CAD), 43 (3), 247-257, March 2011.
  50. 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, Springer-Verlag, 44-71, 2011.
  51. G. Aleksandrowicz, A. Asinowski, and G. Barequet, A polyominoes-permutations injection and tree-like convex polyominoes, J. of Combinatorial Theory, Series A (JCT-A), 119 (3), 503-520, April 2012.
  52. A. Asinowski, G. Barequet, R. Barequet, and G. Rote, Proper n-cell polycubes in n-3 dimensions, J. of Integer Sequences (JIS), 15, #12.8.4, 16 pp., October 2012.
  53. M. Al-Jubeh, G. Barequet, M. Ishaque, D.L. Souvaine, C.D. Tóth, and A. Winslow, Constrained tri-connected planar straight line graphs, in: Thirty Essays on Geometric Graph Theory (J. Pach, ed.), Springer, 49-70, 2013.
  54. 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, Bounded-degree polyhedronization of point sets, Computational Geometry: Theory and Applications (CGTA), 46 (2), 148-153, February 2013.
  55. G. Barequet, M.T. Dickerson, D. Eppstein, D. Hodorkovsky, and K. Vyatkina, On 2-site Voronoi diagrams under geometric distance functions, J. of Computer Science and Technology (JCST), 28 (2), 267-277, March 2013.
  56. 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), 1078-1086, May 2013.
  57. A. Asinowski, G. Barequet, M. Bousquet-Mélou, T. Mansour, and R.Y. Pinter, Orders induced by segments in floorplan partitions and (2-14-3,3-41-2)-avoiding permutations, Electronic J. of Combinatorics (ElJC), 20 (2), #P35, 43 pp., May 2013.
  58. G. Aleksandrowicz and G. Barequet, The growth rate of high-dimensional tree polycubes, European J. of Combinatorics (EuJC), 35, 32-38, January 2014.
  59. G. Barequet and A. Goryachev, Offset polygon and annulus placement problems, Computational Geometry: Theory and Applications (CGTA), 47 (3), 407-434, April 2014.
  60. A. Asinowski, G. Barequet, T. Mansour, and R.Y. Pinter, Cut equivalence of d-dimensional guillotine partitions, Discrete Mathematics (DM), 331, 165-173, November 2014.
  61. 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, Discrete Mathematics and Theoretical Computer Science (DMTCS), 18 (3), 17 pp., March 2016.
  62. G. Barequet, G. Rote, and M. Shalah, λ > 4: An improved lower bound on the growth constant of polyominoes, Comm. of the ACM (CACM), 59 (7), 88-95, July 2016.
  63. G. Barequet, S.M. Cannon, E. Fox-Epstein, B. Hescott, D.L. Souvaine, C.D. Tóth, and A. Winslow, Diffuse reflection diameter in simple polygons, Discrete Applied Mathematics (DAM), 210, 123-132, September 2016.
  64. G. Barequet and M. Shalah, Counting n-cell polycubes proper in n-k dimensions, European J. of Combinatorics (EuJC), 63, 146-163, June 2017.
  65. G. Aleksandrowicz, A. Asinowski, G. Barequet, and R. Barequet, Recovering highly-complex linear recurrences of integer sequences, Information Processing Letters (IPL), 127, 62-66, November 2017.
  66. G. Barequet, M. Shalah, and Y. Zheng, An improved lower bound on the growth constant of polyiamonds, J. of Combinatorial Optimization (JCO), 37 (2), 424-438, February 2019.
Center for Graphics and Geometric Computing
Head of the CGGC (Center for Graphics and Geometric Computing) from October 2001 to March 2014.