Piecewise-Linear Interpolation Between Polygonal Slices. - Gill Barequet; Micha Sharir (SCG, 1994)

Partial surface and volume matching in three dimensions. - Gill Barequet; Micha Sharir (ICPR (2), 1994)

Applications of geometric hashing to the repair, reconstruction, and matching of three-dimensional objects - Gill Barequet (1994)

Translating a convex polygon to contain maximum number of points. - Gill Barequet; Matthew Dickerson; Petru Pau (CCCG, 1995)

Filling gaps in the boundary of a polyhedron. - Gill Barequet; Micha Sharir (Comput. Aided Geom. Des., 1995)

Optimizing a Corridor Between Two Polygons with an Application to Polyhedral Interpolation. - Gill Barequet; Barbara Wolfers (CCCG, 1996)

On Triangulating Three-Dimensional Polygons. - Gill Barequet; Matthew Dickerson; David Eppstein (SCG, 1996)

Partial Surface Matching by Using Directed Footprints. - Gill Barequet; Micha Sharir (SCG, 1996)

History Consideration in Reconstructuring Polythedral Surfaces from Parallel Slices. - Gill Barequet; Daniel Shapiro; Ayellet Tal (IEEE Visualization, 1996)

BOXTREE: A Hierarchical Representation for Surfaces in 3D. - Gill Barequet; Bernard Chazelle; Leonidas J. Guibas; Joseph S. B. Mitchell; Ayellet Tal (Comput. Graph. Forum, 1996)

Animating the Polygon-Offset Distance Function. - Gill Barequet; Amy J. Briggs; Matthew Dickerson; Cristian Dima; Michael T. Goodrich (SCG, 1997)

Classical Computational Geometry in GeomNet. - Gill Barequet; Stina S. Bridgeman; Christian A. Duncan; Michael T. Goodrich; Roberto Tamassia (SCG, 1997)

A Data Front-End for Layered Manufacturing. - Gill Barequet; Yuval Kaplan (SCG, 1997)

Repairing CAD models. - Gill Barequet; Subodh Kumar 001 (IEEE Visualization, 1997)

Offset-Polygon Annulus Placement Problems. - Gill Barequet; Amy J. Briggs; Matthew Dickerson; Michael T. Goodrich (WADS, 1997)

Voronoi Diagrams for Polygon-Offset Distance Functions. - Gill Barequet; Matthew Dickerson; Michael T. Goodrich (WADS, 1997)

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. - Gill Barequet; Michael T. Goodrich; Danny Z. Chen; Ovidiu Daescu; Jack Snoeyink (SCG, 1998)

Optimizing a Strip Separating Two Polygons. - Gill Barequet; Barbara Wolfers (Graph. Model. Image Process., 1998)

DCEL: A Polyhedral Database and Programming Environment. - Gill Barequet (Int. J. Comput. Geom. Appl., 1998)

RSVP: A Geometric Toolkit for Controlled Repair of Solid Models. - Gill Barequet; Christian A. Duncan; Subodh Kumar 001 (IEEE Trans. Vis. Comput. Graph., 1998)

Efficient Perspective-Accurate Silhouette Computation. - Gill Barequet; Christian A. Duncan; Michael T. Goodrich; Subodh Kumar 001; Mihai Pop (SCG, 1999)

Bisectors and alpha-Sectors of Rational Varieties. - Gershon Elber; Gill Barequet; Myung-Soo Kim (Geometric Modelling, 1999)

A Lower Bound for Hellbronn's Triangle Problem in d Dimensions. - Gill Barequet (SODA, 1999)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. - Gill Barequet; Sariel Har-Peled (SODA, 1999)

Polygon-containment and Translational min-Hausdorff-Distance between segment Sets are 3SUM-hard. - Gill Barequet; Sariel Har-Peled (SODA, 1999)

Optimizing Constrained Offset and Scaled Polygonal Annuli. - Gill Barequet; Prosenjit Bose; Matthew Dickerson (WADS, 1999)

2-Point Site Voronoi Diagrams. - Gill Barequet; Matthew Dickerson; Robert L. (Scot) Drysdale III (WADS, 1999)

GeomNet: Geometric Computing Over the Internet. - Gill Barequet; Christian A. Duncan; Michael T. Goodrich; Stina S. Bridgeman; Roberto Tamassia (IEEE Internet Comput., 1999)

The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. - Gill Barequet; Matthew Dickerson (CCCG, 2000)

A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. - Gill Barequet (COCOON, 2000)

alpha-Sector of Rational Varieties. - Gill Barequet; Gershon Elber (EuroCG, 2000)

Smooth Blending of Polygonal Slices with Different Topologies. - Tatiana Surazhsky; Vitaly Surazhsky; Gill Barequet; Ayellet Tal (EuroCG, 2000)

w-Searchlight Obedient Graph Drawings. - Gill Barequet (GD, 2000)

Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. - Gill Barequet; Daniel Shapiro; Ayellet Tal (Vis. Comput., 2000)

2-point site Voronoi diagrams. - Gill Barequet; Robert L. Scot Drysdale; Matthew Dickerson; David S. Guertin (SCG, 2001)

Efficient perspective-accurate silhouette computation and applications. - Mihai Pop; Christian A. Duncan; Gill Barequet; Michael T. Goodrich; Wenjing Huang; Subodh Kumar 001 (SCG, 2001)

Blending polygonal shapes with different topologies. - Tatiana Surazhsky; Vitaly Surazhsky; Gill Barequet; Ayellet Tal (Comput. Graph., 2001)

Voronoi Diagrams for Convex Polygon-Offset Distance Functions. - Gill Barequet; Matthew Dickerson; Michael T. Goodrich (Discret. Comput. Geom., 2001)

A Lower Bound for Heilbronn's Triangle Problem in d Dimensions. - Gill Barequet (SIAM J. Discret. Math., 2001)

The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. - Gill Barequet (COCOON, 2002)

Image Flows and One-Liner Graphical Image Representation. - Vadim Makhervaks; Gill Barequet; Alfred M. Bruckstein (ICPR (1), 2002)

Morphing between shapes by using their straight skeletons. - Gill Barequet; Evgeny Yakersberg (SCG, 2003)

Straight-skeleton based contour interpolation. - Gill Barequet; Michael T. Goodrich; Aya Levi-Steiner; Dvir Steiner (SODA, 2003)

Animating a Camera for Viewing a Planar Polygon. - Daniel Brunstein; Gill Barequet; Craig Gotsman (VMV, 2003)

Drawing Graphs with Large Vertices and Thick Edges. - Gill Barequet; Michael T. Goodrich; Chris Riley (WADS, 2003)

The Complexity of Jensen's Algorithm for Counting Polyominoes. - Gill Barequet; Micha Moffie (ALENEX/ANALC, 2004)

Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon. - Gill Barequet; Vadim Rogol (CCCG, 2004)

On the number of rectangular partitions. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (SODA, 2004)

Contour interpolation by straight skeletons. - Gill Barequet; Michael T. Goodrich; Aya Levi-Steiner; Dvir Steiner (Graph. Model., 2004)

The on-line Heilbronn's triangle problem. - Gill Barequet (Discret. Math., 2004)

Drawing Planar Graphs with Large Vertices and Thick Edges. - Gill Barequet; Michael T. Goodrich; Chris Riley (J. Graph Algorithms Appl., 2004)

Large k-D Simplices in the d-Dimensional Cube. - Gill Barequet; Jonathan Naor (CCCG, 2005)

The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon. - Gill Barequet; Yuval Scharf (CCCG, 2005)

An Upper Bound on the Number of Rectangulations of a Point Set. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (COCOON, 2005)

Covering points with a polygon. - Gill Barequet; Yuval Scharf; Matthew T. Dickerson (SCG, 2005)

Two-Dimensional Visibility Charts for Continuous Curves. - Gershon Elber; Robert Sayegh; Gill Barequet; Ralph R. Martin (SMI, 2005)

Guest Editor's Foreword. - Gill Barequet (Int. J. Comput. Geom. Appl., 2005)

Optimal bounding cones of vectors in three dimensions. - Gill Barequet; Gershon Elber (Inf. Process. Lett., 2005)

Optimizing a constrained convex polygonal annulus. - Gill Barequet; Prosenjit Bose; Matthew T. Dickerson; Michael T. Goodrich (J. Discrete Algorithms, 2005)

Polygon Reconstruction from Line Cross-Sections. - Gill Barequet; Craig Gotsman; Avishay Sidlesky (CCCG, 2006)

Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes. - Gadi Aleksandrowicz; Gill Barequet (COCOON, 2006)

The On-Line Heilbronn's Triangle Problem in d Dimensions. - Gill Barequet; Alina Shaikhet (COCOON, 2006)

Algorithms for two-box covering. - Esther M. Arkin; Gill Barequet; Joseph S. B. Mitchell (SCG, 2006)

A bijection between permutations and floorplans, and its applications. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (Discret. Appl. Math., 2006)

The number of guillotine partitions in d dimensions. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter; Dan Romik (Inf. Process. Lett., 2006)

On the number of rectangulations of a planar point set. - Eyal Ackerman; Gill Barequet; Ron Y. Pinter (J. Comb. Theory A, 2006)

Heilbronn's triangle problem. - Gill Barequet; Alina Shaikhet (SCG, 2007)

Nonlinear interpolation between slices. - Gill Barequet; Amir Vaxman (Symposium on Solid and Physical Modeling, 2007)

Maximizing the area of an axially symmetric polygon inscribed in a simple polygon. - Gill Barequet; Vadim Rogol (Comput. Graph., 2007)

The On-Line Heilbronn's Triangle Problem in d Dimensions. - Gill Barequet; Alina Shaikhet (Discret. Comput. Geom., 2007)

On the complexity of Jensen's algorithm for counting fixed polyominoes. - Gill Barequet; Micha Moffie (J. Discrete Algorithms, 2007)

Counting Polycubes without the Dimensionality Curse. - Gadi Aleksandrowicz; Gill Barequet (COCOON, 2008)

Straight Skeletons of Three-Dimensional Polyhedra. - Gill Barequet; David Eppstein; Michael T. Goodrich; Amir Vaxman (ESA, 2008)

On the Matability of Polygons. - Gill Barequet; Aya Steiner (Int. J. Comput. Geom. Appl., 2008)

Guest editor's foreword. - Gill Barequet; Young J. Kim (Vis. Comput., 2008)

Straight skeletons of three-dimensional polyhedra. - Gill Barequet; Amir Vaxman (SCG, 2009)

On Voronoi Diagrams for Lines in the Plane. - Gill Barequet; Kira Vyatkina (ICCSA Workshops, 2009)

On the Triangle-Perimeter Two-Site Voronoi Diagram. - Iddo Hanniel; Gill Barequet (ISVD, 2009)

Reconstruction of Multi-Label Domains from Partial Planar Cross-Sections. - Gill Barequet; Amir Vaxman (Comput. Graph. Forum, 2009)

Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes. - Gadi Aleksandrowicz; Gill Barequet (Int. J. Comput. Geom. Appl., 2009)

Bounded-degree polyhedronization of point sets. - Gill Barequet; Nadia M. Benbernou; David Charlton; Erik D. Demaine; Martin L. Demaine; Mashhood Ishaque; Anna Lubiw; André Schulz 001; Diane L. Souvaine; Godfried T. Toussaint; Andrew Winslow (CCCG, 2010)

Solving General Lattice Puzzles. - Gill Barequet; Shahar Tal (FAW, 2010)

On 2-Site Voronoi Diagrams under Arithmetic Combinations of Point-to-Point Distances. - Kira Vyatkina; Gill Barequet (ISVD, 2010)

Shape approximation by differential properties of scalar functions. - Silvia Biasotti; Giuseppe Patanè 001; Michela Spagnuolo; Bianca Falcidieno; Gill Barequet (Comput. Graph., 2010)

Formulae and growth rates of high-dimensional polycubes. - Ronnie Barequet; Gill Barequet; Günter Rote (Comb., 2010)

Parallel Enumeration of Lattice Animals. - Gadi Aleksandrowicz; Gill Barequet (FAW-AAIM, 2011)

Proper n-Cell Polycubes in n - 3 Dimensions. - Andrei Asinowski; Gill Barequet; Ronnie Barequet; Günter Rote (COCOON, 2011)

Redelmeier's algorithm for counting lattice animals. - Gadi Aleksandrowicz; Gill Barequet (SCG, 2011)

On 2-Site Voronoi Diagrams under Geometric Distance Functions. - Gill Barequet; Matthew T. Dickerson; David Eppstein; David Hodorkovsky; Kira Vyatkina (ISVD, 2011)

Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions. - Ramanathan Muthuganapathy; Gershon Elber; Gill Barequet; Myung-Soo Kim (Comput. Aided Des., 2011)

The Growth Rate of High-Dimensional Tree Polycubes. - Gadi Aleksandrowicz; Gill Barequet (Electron. Notes Discret. Math., 2011)

On Multiplicatively Weighted Voronoi Diagrams for Lines in the Plane. - Kira Vyatkina; Gill Barequet (Trans. Comput. Sci., 2011)

A polyominoes-permutations injection and tree-like convex polyominoes. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet (J. Comb. Theory A, 2012)

Polyominoes on twisted cylinders. - Gill Barequet; Mira Shalah (SoCG, 2013)

On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions. - Gill Barequet; Evanthia Papadopoulou (ISVD, 2013)

Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. - Andrei Asinowski; Gill Barequet; Mireille Bousquet-Mélou; Toufik Mansour; Ron Y. Pinter (Electron. J. Comb., 2013)

Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet (Discret. Math., 2013)

Diffuse Reflections in Simple Polygons. - Gill Barequet; Sarah Cannon; Eli Fox-Epstein; Benjamin Hescott; Diane L. Souvaine; Csaba D. Tóth; Andrew Winslow (Electron. Notes Discret. Math., 2013)

Editor's Foreword. - Gill Barequet (Int. J. Comput. Geom. Appl., 2013)

Formulae for Polyominoes on Twisted Cylinders. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet; Ronnie Barequet (LATA, 2014)

The Flip Diameter of Rectangulations and Convex Subdivisions. - Eyal Ackerman; Michelle M. Allen; Gill Barequet; Maarten Löffler; Joshua Mermelstein; Diane L. Souvaine; Csaba D. Tóth (LATIN, 2014)

Offset polygon and annulus placement problems. - Gill Barequet; Alex Goryachev (Comput. Geom., 2014)

Cut equivalence of d-dimensional guillotine partitions. - Andrei Asinowski; Gill Barequet; Toufik Mansour; Ron Y. Pinter (Discret. Math., 2014)

Automatic Proofs for Formulae Enumerating Proper Polycubes. - Gill Barequet; Mira Shalah (SoCG, 2015)

λ > 4. - Gill Barequet; Günter Rote; Mira Shalah (ESA, 2015)

An Improved Upper Bound on the Growth Constant of Polyominoes. - Gill Barequet; Ronnie Barequet (Electron. Notes Discret. Math., 2015)

λ > 4: an improved lower bound on the growth constant of polyominoes. - Gill Barequet; Günter Rote; Mira Shalah (Commun. ACM, 2016)

Diffuse reflection diameter in simple polygons. - Gill Barequet; Sarah Cannon; Eli Fox-Epstein; Benjamin Hescott; Diane L. Souvaine; Csaba D. Tóth; Andrew Winslow (Discret. Appl. Math., 2016)

Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. - Gill Barequet; Minati De (CALDAM, 2017)

An Improved Lower Bound on the Growth Constant of Polyiamonds. - Gill Barequet; Mira Shalah; Yufei Zheng (COCOON, 2017)

Counting n-cell polycubes proper in n-k dimensions. - Gill Barequet; Mira Shalah (Eur. J. Comb., 2017)

Enumerating Polyominoes with Fixed Perimeter Defect. - Andrei Asinowski; Gill Barequet; Yufei Zheng (Electron. Notes Discret. Math., 2017)

Recovering highly-complex linear recurrences of integer sequences. - Gadi Aleksandrowicz; Andrei Asinowski; Gill Barequet; Ronnie Barequet (Inf. Process. Lett., 2017)

Properties of Minimal-Perimeter Polyominoes. - Gill Barequet; Gil Ben-Shachar (COCOON, 2018)

Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. - Gill Barequet; Minati De; Michael T. Goodrich (COCOON, 2018)

Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. - Gill Barequet; David Eppstein; Michael T. Goodrich; Nil Mamano (ICALP, 2018)

Polycubes with Small Perimeter Defect. - Andrei Asinowski; Gill Barequet; Yufei Zheng (SODA, 2018)

Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms. - Gill Barequet; Gil Ben-Shachar (CALDAM, 2019)

A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. - Gill Barequet; Minati De (COCOON, 2019)

Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition). - Gill Barequet; Gil Ben-Shachar (SoCG, 2019)

Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. - Gill Barequet; Evanthia Papadopoulou; Martin Suderland (ISAAC, 2019)

On Minimal-Perimeter Lattice Animals. - Gill Barequet; Gil Ben-Shachar (LATIN, 2020)

Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. - Gill Barequet; Mira Shalah (LATIN, 2020)

Guest Editors' Foreword. - Gill Barequet; Yusu Wang 001 (Discret. Comput. Geom., 2020)

Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. - Gill Barequet; Minati De; Michael T. Goodrich (Algorithmica, 2021)

Concatenation arguments and their applications to polyominoes and polycubes. - Gill Barequet; Gil Ben-Shachar; Martha C. Osegueda (Comput. Geom., 2021)

Optimally Confining Lattice Polymers. - Gill Barequet; Shion Fukuzawa; Michael T. Goodrich; David M. Mount; Martha C. Osegueda; Evrim Ozel (CCCG, 2022)

Minimum-Perimeter Lattice Animals and the Constant-Isomer Conjecture. - Gill Barequet; Gil Ben-Shachar (Electron. J. Comb., 2022)

Minimal-Perimeter Lattice Animals and the Constant-Isomer Conjecture. - Gill Barequet; Gil Ben-Shachar (CoRR, 2022)

Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching. - Gill Barequet; Shion Fukuzawa; Michael T. Goodrich; David M. Mount; Martha C. Osegueda; Evrim Ozel (CoRR, 2022)

Topology-Controlled Reconstruction from Partial Cross-Sections. - Amani Shhadi; Gill Barequet (VMV, 2023)

Algorithms for Counting Minimum-Perimeter Lattice Animals. - Gill Barequet; Gil Ben-Shachar (Algorithmica, 2023)

Automatic generation of formulae for polyominoes with a fixed perimeter defect. - Gill Barequet; Bar Magal (Comput. Geom., 2023)

Counting Polyominoes, Revisited. - Gill Barequet; Gil Ben-Shachar (ALENEX, 2024)

On Totally-Concave Polyominoes. - Gill Barequet; Noga Keren; Neal Madras; Johann Peters; Adi Rivkin (CCCG, 2024)

Unbounded Regions of High-Order Voronoi Diagrams of Lines and Line Segments in Higher Dimensions. - Gill Barequet; Evanthia Papadopoulou; Martin Suderland (Discret. Comput. Geom., 2024)