Publications

Request a copy

Theses

  1. 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.
  2. G. Barequet, Applications of geometric hashing to the repair, reconstruction, and matching of three-dimensional 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

  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.
  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.

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 (JAGM), 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, Blending 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), 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. 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, September 2012.
  53. 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.
  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.

Refereed Conference Papers   (speaker underlined)

  1. G. Barequet and M. Sharir, Piecewise-linear interpolation between polygonal slices, Proc. 10th Ann. ACM Symp. on Computational Geometry (SoCG), Stony Brook, NY, 93-102, June 1994.
  2. 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, 610-614, October 1994.
  3. 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, 61-66, August 1995.
  4. G. Barequet, M. Dickerson, and D. Eppstein, On triangulating three-dimensional polygons, Proc. 12th Ann. ACM Symp. on Computational Geometry (SoCG), Philadelphia, PA, 38-47, May 1996.
  5. G. Barequet and M. Sharir, Partial surface matching by using directed footprints, Proc. 12th Ann. ACM Symp. on Computational Geometry (SoCG), Philadelphia, PA, C9-10, May 1996.
  6. 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.), Futureoscope-Poiliers, France, August 1996.
  7. 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, 32-37, August 1996.
  8. G. Barequet, D. Shapiro, and A. Tal, History consideration in reconstructing polyhedral surfaces from parallel slices, Proc. 7th IEEE Conf. on Visualization (VIS), San-Francisco, CA, 149-156, October 1996.
  9. G. Barequet and Y. Kaplan, A data front-end for layered manufacturing, Proc. 13th Ann. ACM Symp. on Computational Geometry (SoCG), Nice, France, 231-239, June 1997.
  10. 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, 412-414, June 1997.
  11. G. Barequet, M.T. Dickerson, and M.T. Goodrich, Voronoi diagrams for polygon-offset distance functions, Proc. 5th Workshop on Algorithms and Data Structures (WADS), Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, 1272, Springer-Verlag, 200-209, August 1997.
  12. G. Barequet, A.J. Briggs, M.T. Dickerson, and M.T. Goodrich, Offset-polygon annulus placement problems, Proc. 5th Workshop on Algorithms and Data Structures (WADS), Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science, 1272, Springer-Verlag, 378-391, August 1997.
  13. G. Barequet and S. Kumar, Repairing CAD Models, Proc. 8th IEEE Conf. on Visualization (VIS), Phoenix, AZ, 363-370, October 1997.
  14. 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, 317-326, June 1998.
  15. G. Barequet, A lower bound for Heilbronn's triangle problem in d dimensions, Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), Baltimore, MD, 76-81, January 1999.
  16. G. Barequet and S. Har-Peled, Efficiently approximating the minimum-volume bounding box of a point set in three dimensions, Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), Baltimore, MD, 82-91, January 1999.
  17. G. Barequet and S. Har-Peled, Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard, Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), Baltimore, MD, S862-863, January 1999.
  18. 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, Springer-Verlag, 62-73, August 1999.
  19. G. Barequet, M.T. Dickerson, and R.L.S. Drysdale, 2-point site Voronoi diagrams, Proc. 6th Workshop on Algorithms and Data Structures (WADS), Vancouver, British Columbia, Canada, Lecture Notes in Computer Science, 1663, Springer-Verlag, 219-230, August 1999.
  20. G. Barequet, A duality between small-face problems in arrangements of lines and Heilbronn-type problems, Proc. 6th Ann. Int. Computing and Combinatorics Conf. (COCOON), Sydney, Australia, Lecture Notes in Computer Science, 1858, Springer-Verlag, 43-52, July 2000.
  21. G. Barequet and M.T. Dickerson, The translation-scale diagram for point-containing placements of a convex polygon, Proc. 12th Canadian Conf. on Computational Geometry (CCCG), Fredericton, New Brunswick, Canada, 7-12, August 2000.
  22. G. Barequet, ω-searchlight obedient graph drawings, Proc. 8th Int. Symp. on Graph Drawing (GD), Colonial Williamsburg, VA, Lecture Notes in Computer Science, 1984, Springer-Verlag, 321-327, September 2000.
  23. M. Pop, G. Barequet, C.A. Duncan, M.T. Goodrich, W. Huang, and S. Kumar, Efficient perspective-accurate silhouette computation and applications, Proc. 17th Ann. ACM Symp. on Computational Geometry (SoCG), Medford, MA, 60-68, June 2001.
  24. V. Makhervaks, G. Barequet, and A. Bruckstein, Image flows and one-liner graphical image representation, Proc. 16th Ann. IAPR and IEEE Int. Conf. on Pattern Recognition (ICPR), Québec City, Québec, Canada, vol. 1, 640-643, August 2002.
  25. G. Barequet, The on-line 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, Springer-Verlag, 360-369, August 2002.
  26. G. Barequet, M.T. Goodrich, A. Levi-Steiner, and D. Steiner, Straight-skeleton based contour interpolation, Proc. 14th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), Baltimore, MD, 119-127, January 2003.
  27. 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, Springer-Verlag, 281-293, July 2003.
  28. 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, 87-94, November 2003.
  29. 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, 161-169, January 2004.
  30. E. Ackerman, G. Barequet, and R.Y. Pinter, On the number of rectangular partitions, Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), New Orleans, LA, 729-738, January 2004.
  31. G. Barequet and V. Rogol, Maximizing the area of an axially-symmetric polygon inscribed by a simple polygon, Proc. 16th Canadian Conf. on Computational Geometry (CCCG), Montreal, Québec, Canada, 128-131, August 2004.
  32. G. Elber, R. Sayegh, G. Barequet, and R.R. Martin, Two-dimensional visibility atlases for continuous curves, Proc. Int. Conf. on Shape Modeling and Applications (SMI), Cambridge, MA, 206-215, June 2005.
  33. G. Barequet, G. Elber, and M.-S. Kim, Computing the minimum enclosing circle of a set of planar curves, Proc. Int. Computer-Aided Design Conf. (CAD), Bangkok, Thailand, 301-308, June 2005.
  34. G. Barequet and J. Naor, Large k-D simplices in the d-dimensional unit cube, Proc. 17th Canadian Conf. on Computational Geometry (CCCG), Windsor, Ontario, Canada, 30-33, August 2005.
  35. G. Barequet and Y. Scharf, The translation-scale-rotation diagram for point-containing placements of a convex polygon, Proc. 17th Canadian Conf. on Computational Geometry (CCCG), Windsor, Ontario, Canada, 172-175, August 2005.
  36. 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, Springer-Verlag, 554-559, August 2005.
  37. 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, 369-374, September 2005.
  38. E.M. Arkin, G. Barequet, and J.S.B. Mitchell, Algorithms for two-box covering, Proc. 22nd Ann. ACM Symp. on Computational Geometry (SoCG), Sedona, AZ, 459-467, June 2006.
  39. A. Sidlesky, G. Barequet, and C. Gotsman, Polygon reconstruction from line cross-sections, Proc. 18th Canadian Conf. on Computational Geometry (CCCG), Kingston, Ontario, Canada, 81-84, August 2006.
  40. G. Barequet and A. Shaikhet, The on-line Heilbronn's triangle problem in d dimensions, Proc. 12th Ann. Int. Computing and Combinatorics Conf. (COCOON), Taipei, Taiwan, Lecture Notes in Computer Science, 4112, Springer-Verlag, 408-417, August 2006.
  41. G. Aleksandrowicz and G. Barequet, Counting d-dimensional polycubes and nonrectangular planar polyominoes, Proc. 12th Ann. Int. Computing and Combinatorics Conf. (COCOON), Taipei, Taiwan, Lecture Notes in Computer Science, 4112, Springer-Verlag, 418-427, August 2006.
  42. G. Barequet and A. Zamansky, Surface reconstruction by moving contours, Proc. 9th IASTED Int. Conf. on Computer Graphics and Imaging (CGIM), Innsbruck, Austria, 7-14, February 2007.
  43. G. Barequet and A. Vaxman, Nonlinear interpolation between slices, Proc. 3rd ACM Symp. on Solid and Physical Modeling (SPM), Beijing, China, 97-107, June 2007.
  44. 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, Springer-Verlag, 100-109, June 2008.
  45. G. Barequet, D. Eppstein, M.T. Goodrich, and A. Vaxman, Straight skeletons of three-dimensional polyhedra, Proc. 16th Ann. European Symp. on Algorithms (ESA), Karlsruhe, Germany, Lecture Notes in Computer Science, 5193, Springer-Verlag, 148-160, September 2008.
  46. I. Hanniel and G. Barequet, On the triangle-perimeter two-site Voronoi diagram, Proc. 6th Int. Symp. on Voronoi Diagrams in Science and Engineering (ISVD), Copenhagen, Denmark, 129-136, June 2009.
  47. 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, 159-168, June-July 2009.
  48. 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.
  49. G. Barequet and A. Vaxman, Reconstruction of multi-label domains from partial planar cross-sections, Proc. 7th Symp. on Geometry Processing (SGP) (M. Alexa and M. Kazhdan, eds.), Berlin, Germany, July 2009.
  50. R. Barequet, G. Barequet, and G. Rote, Formulae and growth rates of high-dimensional polycubes, Proc. 5th European Conf. on Combinatorics, Graph Theory, and Applications (EuroComb), Bordeaux, France, Electronic Notes in Discrete Mathematics, 34, 459-463, September 2009.
  51. 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), Aix-en-Provence, France, 252-262, June 2010.
  52. K. Vyatkina and G. Barequet, On 2-wite Voronoi diagrams under arithmetic combinations of point-to-point distances, Proc. 7th Int. Symp. on Voronoi Diagrams in Science and Engineering (ISVD), Québec City, Québec, Canada, 33-41, June 2010.
  53. 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, Proc. 22th Canadian Conf. on Computational Geometry (CCCG), Winnipeg, Manitoba, Canada, 99-102, August 2010.
  54. 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, Springer-Verlag, 124-135, August 2010.
  55. 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, Springer-Verlag, 90-99, May 2011.
  56. G. Barequet, M.T. Dickerson, D. Eppstein, D. Hodorkovsky, and K. Vyatkina, On 2-site Voronoi diagrams under geometric distance functions, Proc. 8th Int. Symp. on Voronoi Diagrams in Science and Engineering (ISVD), Qingdao, China, 31-38, June 2011.
  57. A. Asinowski, G. Barequet, R. Barequet, and G. Rote, Proper n-cell polycubes in n-3 dimensions, Proc. 17th Ann. Int. Computing and Combinatorics Conf. (COCOON), Dallas, TX, Lecture Notes in Computer Science, 6842, Springer-Verlag, 180-191, August 2011.
  58. G. Aleksandrowicz and G. Barequet, The growth rate of high-dimensional tree polycubes, Proc. 6th European Conf. on Combinatorics, Graph Theory, and Applications (EuroComb), Budapest, Hungary, Electronic Notes in Discrete Mathematics, 38, 25-30, August-September 2011.
  59. G. Barequet, S.M. Cannon, E. Fox-Epstein, B. Hescott, D.L. Souvaine, C.D. Tóth, and A. Winslow, Diffuse reflections in simple polygons, Proc. 7th Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS), Playa del Carmen, Mexico, Electronic Notes in Discrete Mathematics, 44, 345-350, April 2013.
  60. G. Barequet and E. Papadopoulou, On the farthest-neighbor Voronoi diagram of segments in three dimensions, Proc. 10th Int. Symp. on Voronoi Diagrams in Science and Engineering (ISVD), St. Petersburg, Russia, 31-36, July 2013.
  61. 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, Springer-Verlag, 76-87, March 2014.
  62. 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, Springer-Verlag, 478-489, March-April 2014.

Review Papers

  1. 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, 407-463, 1999. (.html)
  2. G. Barequet, Cinderella: The interactive geometry software, The Mathematical Intelligencer, 24 (4), 74-75, 2002.

Patents

    USA
  1. US Patent 5,031,120, Three dimensional modelling apparatus, July 9, 1991. (.tar.gz 1.98M)
  2. US Patent 5,263,130, Three dimensional modelling apparatus, November 16, 1993. (.tar.gz 1.88M)
  3. US Patent 5,287,435, Three dimensional modeling, February 15, 1994. (.tar.gz 1.78M)
  4. US Patent 5,386,500, Three dimensional modeling apparatus, January 31, 1995. (.tar.gz 1.92M)
  5. US Patent 5,519,816, Three dimensional modeling apparatus, May 21, 1996. (.tar.gz 1.90M)

    Israel
  6. Israeli Patent 84936, Three dimensional modeling apparatus and method, June 28, 1989.
  7. Israeli Patent 95034, Three dimensional modeling, February 12, 1992.

Videos

  1. G. Barequet, A.J. Briggs, M.T. Dickerson, C.S. Dima, and M.T. Goodrich, Animating the offset-polygon distance function, Video Review at the 13th Ann. ACM Symp. on Computational Geometry (SoCG), Nice, France, 479-480, June 1997. (.pdf.gz 533K)
  2. G. Barequet, C.A. Duncan, M.T. Goodrich, S. Kumar, and M. Pop, Efficient perspective-accurate silhouette computation, Video Review at the 15th Ann. ACM Symp. on Computational Geometry (SoCG), Miami, FL, 417-418, June 1999. (.ps.gz 44K)
  3. G. Barequet, M.T. Dickerson, R.L.S. Drysdale, and D.S. Guertin, 2-Point Site Voronoi Diagrams, Video Review at the 17th Ann. ACM Symp. on Computational Geometry (SoCG), Medford, MA, 323-324, June 2001. (.pdf.gz 82K)
  4. 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, 378-379, June 2003. (.pdf.gz 99K, .exe.gz 16.7M)
  5. 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, 376-377, June 2005. (.pdf.gz 83K)
  6. G. Barequet and A. Shaikhet, Heilbronn's triangle problem, Video Review at the 23rd Ann. ACM Symp. on Computational Geometry (SoCG), Gyeongju, South Korea, 127-128, June 2007. (.pdf.gz 72K)
  7. G. Barequet and A. Vaxman, Straight skeletons of three-dimensional polyhedra, Video Review at the 25th Ann. ACM Symp. on Computational Geometry (SoCG), Aarhus, Denmark, 100-101, June 2009. (.pdf.gz 647K)
  8. 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, 283-284, June 2011.
  9. 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, 339-340, June 2013.

Others

  1. G. Barequet, Large models: Software tools that aid their production, Rapid Prototyping Monitor, 1 (2), 4-5, September 1991. (.pdf.gz 1.08M)

Student Theses

Ph.D.:
  1. E. Ackerman, Counting problems for geometric structures: Rectangulations, floorplans, and quasi-planar graphs, Ph.D. Dissertation, Dept. of Computer Science, Technion, July 2006. (.pdf.gz 980K)
  2. 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)
  3. G. Aleksandrowicz, Enumeration of lattice animals, Ph.D. Thesis, Dept. of Computer Science, Technion, June 2011. (.pdf.gz 913K)
M.Sc.:
  1. V. Makhervaks, Image flows and one-liner graphical image representations, M.Sc. Thesis, Dept. of Mathematics, Technion, December 2002. (.ps.gz 5.58M, .pdf.gz 3.90M)
  2. 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)
  3. V. Rogol, Maximizing the area of an axially-symmetric polygon inscribed by a simple polygon, M.Sc. Thesis, Dept. of Electrical Engineering, Technion, June 2003. (.pdf.gz 1.68M)
  4. M. Moffie, Counting polyominoes in two and three dimensions, M.Sc. Thesis, Dept. of Computer Science, Technion, December 2003. (.pdf.gz 463K)
  5. Evgeny Yakersberg, Morphing between geometric shapes using straight-skeleton-based interpolation, M.Sc. Thesis, Dept. of Computer Science, Technion, May 2004. (.pdf.gz 1.67M)
  6. Yuval Scharf, Covering points with a polygon, M.Sc. Thesis, Dept. of Computer Science, Technion, October 2004. (.pdf.gz 312K)
  7. A. Steiner, Matability of polygons, M.Sc. Thesis, Dept. of Mathematics, Technion, February 2005. (.pdf.gz 1.16M)
  8. A. Goryachev, Offset polygon and annulus placement problems, M.Sc. Thesis, Dept. of Computer Science, Technion, September 2005. (.pdf.gz 759K)
  9. D. Kloper, Geometries and topologies of triangulations of point sets, M.Sc. Thesis, Dept. of Computer Science, Technion, November 2005.
  10. D. Hodorkovsky, 2-point site Voronoi diagrams, M.Sc. Thesis, Dept. of Mathematics, Technion, November 2005. (.pdf.gz 903K)
  11. J. Naor, d-dimensional variants of Heilbronn's triangle problem, M.Sc. Thesis, Dept. of Computer Science, Technion, December 2005. (.pdf.gz 240K)
  12. A. Sidlesky, Polygon reconstruction from line cross-sections, M.Sc. Thesis, Dept. of Computer Science, Technion, June 2006. (.pdf.gz 1.92M)
  13. A. Vaxman, Nonlinear interpolation between slices, M.Sc. Thesis, Dept. of Computer Science, Technion, November 2006. (.pdf.gz 4.22M)
  14. A. Shaikhet, The on-line Heilbronn's triangle problem in d dimensions, M.Sc. Thesis, Dept. of Computer Science, Technion, May 2007. (.pdf.gz 541K)
  15. A. Zamansky, A framework for surface reconstruction of sparsely-sampled objects, M.Sc. Thesis, Dept. of Computer Science, Technion, July 2007. (.pdf.gz 1.02M)
  16. Asenath Tal, Algorithms for Heilbronn's triangle problem, M.Sc. Thesis, Dept. of Computer Science, Technion, February 2009. (.pdf.gz 738K)
  17. 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)
  18. Raeda Naamnieh, Fair multi-label reconstruction from cross-sections, M.Sc. Thesis, Dept. of Computer Science, Technion, November 2013. (.pdf.gz ?.??M)
Back to Gill's Home Page