Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDGill Barequet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[i9]Gill Barequet, Gil Ben-Shachar:
Minimal-Perimeter Lattice Animals and the Constant-Isomer Conjecture. CoRR abs/2205.07025 (2022)- 2021
- [j70]Gill Barequet, Minati De
, Michael T. Goodrich:
Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. Algorithmica 83(7): 2245-2272 (2021) - [j69]Gill Barequet, Gil Ben-Shachar, Martha C. Osegueda:
Concatenation arguments and their applications to polyominoes and polycubes. Comput. Geom. 98: 101790 (2021) - 2020
- [j68]Gill Barequet, Yusu Wang:
Guest Editors' Foreword. Discret. Comput. Geom. 64(4): 1123-1124 (2020) - [j67]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-matching Voronoi diagrams: Combinatorial complexity and algorithms. J. Comput. Geom. 11(1): 26-59 (2020) - [c76]Gill Barequet, Gil Ben-Shachar:
On Minimal-Perimeter Lattice Animals. LATIN 2020: 519-531 - [c75]Gill Barequet, Mira Shalah:
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. LATIN 2020: 532-545
2010 – 2019
- 2019
- [j66]Gill Barequet, Mira Shalah, Yufei Zheng:
An improved lower bound on the growth constant of polyiamonds. J. Comb. Optim. 37(2): 424-438 (2019) - [c74]Gill Barequet, Gil Ben-Shachar:
Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms. CALDAM 2019: 109-123 - [c73]Gill Barequet, Minati De:
A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice. COCOON 2019: 13-24 - [c72]Gill Barequet, Gil Ben-Shachar:
Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition). SoCG 2019: 64:1-64:4 - [c71]Gill Barequet, Evanthia Papadopoulou, Martin Suderland:
Unbounded Regions of High-Order Voronoi Diagrams of Lines and Segments in Higher Dimensions. ISAAC 2019: 62:1-62:15 - [e1]Gill Barequet, Yusu Wang:
35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA. LIPIcs 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-104-7 [contents] - [i8]Gill Barequet, Mira Shalah:
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes. CoRR abs/1906.11447 (2019) - 2018
- [c70]Gill Barequet, Gil Ben-Shachar:
Properties of Minimal-Perimeter Polyominoes. COCOON 2018: 120-129 - [c69]Gill Barequet, Minati De, Michael T. Goodrich:
Computing Convex-Straight-Skeleton Voronoi Diagrams for Segments and Convex Polygons. COCOON 2018: 130-142 - [c68]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. ICALP 2018: 89:1-89:14 - [c67]Andrei Asinowski, Gill Barequet, Yufei Zheng:
Polycubes with Small Perimeter Defect. SODA 2018: 93-100 - [i7]Gill Barequet, David Eppstein, Michael T. Goodrich, Nil Mamano:
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms. CoRR abs/1804.09411 (2018) - 2017
- [j65]Gill Barequet, Mira Shalah:
Counting n-cell polycubes proper in n-k dimensions. Eur. J. Comb. 63: 146-163 (2017) - [j64]Andrei Asinowski, Gill Barequet, Yufei Zheng:
Enumerating Polyominoes with Fixed Perimeter Defect. Electron. Notes Discret. Math. 61: 61-67 (2017) - [j63]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet:
Recovering highly-complex linear recurrences of integer sequences. Inf. Process. Lett. 127: 62-66 (2017) - [c66]Gill Barequet, Minati De:
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function. CALDAM 2017: 24-36 - [c65]Gill Barequet, Mira Shalah, Yufei Zheng:
An Improved Lower Bound on the Growth Constant of Polyiamonds. COCOON 2017: 50-61 - 2016
- [j62]Gill Barequet, Günter Rote, Mira Shalah:
λ > 4: an improved lower bound on the growth constant of polyominoes. Commun. ACM 59(7): 88-95 (2016) - [j61]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse reflection diameter in simple polygons. Discret. Appl. Math. 210: 123-132 (2016) - [j60]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - 2015
- [j59]Gill Barequet, Mira Shalah:
Automatic Proofs for Formulae Enumerating Proper Polycubes. Electron. Notes Discret. Math. 49: 145-151 (2015) - [j58]Gill Barequet, Ronnie Barequet:
An Improved Upper Bound on the Growth Constant of Polyominoes. Electron. Notes Discret. Math. 49: 167-172 (2015) - [c64]Gill Barequet, Mira Shalah:
Automatic Proofs for Formulae Enumerating Proper Polycubes. SoCG 2015: 19-22 - [c63]Gill Barequet, Günter Rote, Mira Shalah:
λ > 4. ESA 2015: 83-94 - 2014
- [j57]Gill Barequet, Alex Goryachev:
Offset polygon and annulus placement problems. Comput. Geom. 47(3): 407-434 (2014) - [j56]Andrei Asinowski, Gill Barequet, Toufik Mansour, Ron Y. Pinter:
Cut equivalence of d-dimensional guillotine partitions. Discret. Math. 331: 165-174 (2014) - [j55]Gadi Aleksandrowicz, Gill Barequet:
The growth rate of high-dimensional tree polycubes. Eur. J. Comb. 35: 32-38 (2014) - [c62]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet, Ronnie Barequet:
Formulae for Polyominoes on Twisted Cylinders. LATA 2014: 76-87 - [c61]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. LATIN 2014: 478-489 - 2013
- [j54]Andrei Asinowski, Gill Barequet, Mireille Bousquet-Mélou, Toufik Mansour, Ron Y. Pinter:
Orders Induced by Segments in Floorplans and (2 - 14 - 3, 3 - 41 - 2)-Avoiding Permutations. Electron. J. Comb. 20(2): 35 (2013) - [j53]Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. Comput. Geom. 46(2): 148-153 (2013) - [j52]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet:
Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3. Discret. Math. 313(10): 1078-1086 (2013) - [j51]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. Electron. Notes Discret. Math. 44: 345-350 (2013) - [j50]Gill Barequet:
Editor's Foreword. Int. J. Comput. Geom. Appl. 23(4-5): 231-232 (2013) - [j49]Gill Barequet, Matthew Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina:
On 2-Site Voronoi Diagrams Under Geometric Distance Functions. J. Comput. Sci. Technol. 28(2): 267-277 (2013) - [c60]Gill Barequet, Mira Shalah:
Polyominoes on twisted cylinders. SoCG 2013: 339-340 - [c59]Gill Barequet, Evanthia Papadopoulou:
On the Farthest-Neighbor Voronoi Diagram of Segments in Three Dimensions. ISVD 2013: 31-36 - [i6]Gill Barequet, Sarah Cannon, Eli Fox-Epstein, Benjamin Hescott, Diane L. Souvaine, Csaba D. Tóth, Andrew Winslow:
Diffuse Reflections in Simple Polygons. CoRR abs/1302.2271 (2013) - [i5]Eyal Ackerman, Michelle M. Allen, Gill Barequet, Maarten Löffler, Joshua Mermelstein, Diane L. Souvaine, Csaba D. Tóth:
The Flip Diameter of Rectangulations and Convex Subdivisions. CoRR abs/1312.4429 (2013) - 2012
- [j48]Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet:
A polyominoes-permutations injection and tree-like convex polyominoes. J. Comb. Theory, Ser. A 119(3): 503-520 (2012) - 2011
- [j47]Ramanathan Muthuganapathy, Gershon Elber, Gill Barequet, Myung-Soo Kim:
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions. Comput. Aided Des. 43(3): 247-257 (2011) - [j46]Gadi Aleksandrowicz, Gill Barequet:
The Growth Rate of High-Dimensional Tree Polycubes. Electron. Notes Discret. Math. 38: 25-30 (2011) - [j45]Kira Vyatkina, Gill Barequet:
On Multiplicatively Weighted Voronoi Diagrams for Lines in the Plane. Trans. Comput. Sci. 13: 44-71 (2011) - [c58]Gadi Aleksandrowicz, Gill Barequet:
Parallel Enumeration of Lattice Animals. FAW-AAIM 2011: 90-99 - [c57]Andrei Asinowski, Gill Barequet, Ronnie Barequet, Günter Rote:
Proper n-Cell Polycubes in n - 3 Dimensions. COCOON 2011: 180-191 - [c56]Gadi Aleksandrowicz, Gill Barequet:
Redelmeier's algorithm for counting lattice animals. SCG 2011: 283-284 - [c55]Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina:
On 2-Site Voronoi Diagrams under Geometric Distance Functions. ISVD 2011: 31-38 - [i4]Gill Barequet, Matthew T. Dickerson, David Eppstein, David Hodorkovsky, Kira Vyatkina:
On 2-Site Voronoi Diagrams under Geometric Distance Functions. CoRR abs/1105.4130 (2011) - 2010
- [j44]Silvia Biasotti, Giuseppe Patanè, Michela Spagnuolo, Bianca Falcidieno, Gill Barequet:
Shape approximation by differential properties of scalar functions. Comput. Graph. 34(3): 252-262 (2010) - [j43]Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and growth rates of high-dimensional polycubes. Comb. 30(3): 257-275 (2010) - [j42]Iddo Hanniel, Gill Barequet:
On the Triangle-Perimeter Two-Site Voronoi Diagram. Trans. Comput. Sci. 9: 54-75 (2010) - [c54]Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow:
Bounded-degree polyhedronization of point sets. CCCG 2010: 99-102 - [c53]Gill Barequet, Shahar Tal:
Solving General Lattice Puzzles. FAW 2010: 124-135 - [c52]Kira Vyatkina, Gill Barequet:
On 2-Site Voronoi Diagrams under Arithmetic Combinations of Point-to-Point Distances. ISVD 2010: 33-41
2000 – 2009
- 2009
- [j41]Gill Barequet, Amir Vaxman:
Reconstruction of Multi-Label Domains from Partial Planar Cross-Sections. Comput. Graph. Forum 28(5): 1327-1337 (2009) - [j40]Gadi Aleksandrowicz, Gill Barequet:
Counting polycubes without the dimensionality curse. Discret. Math. 309(13): 4576-4583 (2009) - [j39]Ronnie Barequet, Gill Barequet, Günter Rote:
Formulae and Growth Rates of High-Dimensional Polycubes. Electron. Notes Discret. Math. 34: 459-463 (2009) - [j38]Gadi Aleksandrowicz, Gill Barequet:
Counting d-Dimensional Polycubes and nonrectangular Planar polyominoes. Int. J. Comput. Geom. Appl. 19(3): 215-229 (2009) - [c51]Gill Barequet, Amir Vaxman:
Straight skeletons of three-dimensional polyhedra. SCG 2009: 100-101 - [c50]Gill Barequet, Kira Vyatkina:
On Voronoi Diagrams for Lines in the Plane. ICCSA Workshops 2009: 159-168 - [c49]Iddo Hanniel, Gill Barequet:
On the Triangle-Perimeter Two-Site Voronoi Diagram. ISVD 2009: 129-136 - 2008
- [j37]Gill Barequet, Matthew T. Dickerson, Yuval Scharf:
Covering points with a polygon. Comput. Geom. 39(3): 143-162 (2008) - [j36]Gill Barequet, Aya Steiner:
On the Matability of Polygons. Int. J. Comput. Geom. Appl. 18(5): 469-506 (2008) - [j35]Gill Barequet, Amir Vaxman:
Nonlinear Interpolation between Slices. Int. J. Shape Model. 14(1): 39-60 (2008) - [j34]Gill Barequet, Young J. Kim:
Guest editor's foreword. Vis. Comput. 24(4): 227 (2008) - [c48]Gadi Aleksandrowicz, Gill Barequet:
Counting Polycubes without the Dimensionality Curse. COCOON 2008: 100-109 - [c47]Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. ESA 2008: 148-160 - [i3]Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman:
Straight Skeletons of Three-Dimensional Polyhedra. CoRR abs/0805.0022 (2008) - 2007
- [j33]Gill Barequet, Vadim Rogol:
Maximizing the area of an axially symmetric polygon inscribed in a simple polygon. Comput. Graph. 31(1): 127-136 (2007) - [j32]Gill Barequet, Alina Shaikhet:
The On-Line Heilbronn's Triangle Problem in d Dimensions. Discret. Comput. Geom. 38(1): 51-60 (2007) - [j31]Gill Barequet, Micha Moffie:
On the complexity of Jensen's algorithm for counting fixed polyominoes. J. Discrete Algorithms 5(2): 348-355 (2007) - [c46]Gill Barequet, Alina Shaikhet:
Heilbronn's triangle problem. SCG 2007: 127-128 - [c45]Gill Barequet, Amir Vaxman:
Nonlinear interpolation between slices. Symposium on Solid and Physical Modeling 2007: 97-107 - 2006
- [j30]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
A bijection between permutations and floorplans, and its applications. Discret. Appl. Math. 154(12): 1674-1684 (2006) - [j29]Eyal Ackerman, Gill Barequet, Ron Y. Pinter, Dan Romik:
The number of guillotine partitions in d dimensions. Inf. Process. Lett. 98(4): 162-167 (2006) - [j28]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
On the number of rectangulations of a planar point set. J. Comb. Theory, Ser. A 113(6): 1072-1091 (2006) - [c44]Gill Barequet, Craig Gotsman, Avishay Sidlesky:
Polygon Reconstruction from Line Cross-Sections. CCCG 2006 - [c43]Gill Barequet, Alina Shaikhet:
The On-Line Heilbronn's Triangle Problem in d Dimensions. COCOON 2006: 408-417 - [c42]Gadi Aleksandrowicz, Gill Barequet:
Counting d-Dimensional Polycubes and Nonrectangular Planar Polyominoes. COCOON 2006: 418-427 - [c41]Esther M. Arkin, Gill Barequet, Joseph S. B. Mitchell:
Algorithms for two-box covering. SCG 2006: 459-467 - 2005
- [j27]Gill Barequet:
Guest Editor's Foreword. Int. J. Comput. Geom. Appl. 15(4): 325-326 (2005) - [j26]Gill Barequet, Gershon Elber:
Optimal bounding cones of vectors in three dimensions. Inf. Process. Lett. 93(2): 83-89 (2005) - [j25]Gill Barequet, Prosenjit Bose, Matthew T. Dickerson, Michael T. Goodrich:
Optimizing a constrained convex polygonal annulus. J. Discrete Algorithms 3(1): 1-26 (2005) - [c40]Gill Barequet, Jonathan Naor:
Large k-D Simplices in the d-Dimensional Cube. CCCG 2005: 31-34 - [c39]Gill Barequet, Yuval Scharf:
The Translation-Scale-Rotation Diagram for Point-Containing Placements of a Convex Polygon. CCCG 2005: 175-178 - [c38]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
An Upper Bound on the Number of Rectangulations of a Point Set. COCOON 2005: 554-559 - [c37]Gill Barequet, Yuval Scharf, Matthew T. Dickerson:
Covering points with a polygon. SCG 2005: 376-377 - [c36]Gershon Elber, Robert Sayegh, Gill Barequet, Ralph R. Martin:
Two-Dimensional Visibility Charts for Continuous Curves. SMI 2005: 208-217 - 2004
- [j24]Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner:
Contour interpolation by straight skeletons. Graph. Model. 66(4): 245-260 (2004) - [j23]Gill Barequet:
The on-line Heilbronn's triangle problem. Discret. Math. 283(1-3): 7-14 (2004) - [j22]Gill Barequet, Michael T. Goodrich, Chris Riley:
Drawing Planar Graphs with Large Vertices and Thick Edges. J. Graph Algorithms Appl. 8: 3-20 (2004) - [c35]Gill Barequet, Micha Moffie:
The Complexity of Jensen's Algorithm for Counting Polyominoes. ALENEX/ANALC 2004: 161-169 - [c34]Gill Barequet, Vadim Rogol:
Maximizing the area of an axis-symmetric polygon inscribed by a convex polygon. CCCG 2004: 128-131 - [c33]Eyal Ackerman, Gill Barequet, Ron Y. Pinter:
On the number of rectangular partitions. SODA 2004: 736-745 - 2003
- [c32]Gill Barequet, Evgeny Yakersberg:
Morphing between shapes by using their straight skeletons. SCG 2003: 378-379 - [c31]Gill Barequet, Michael T. Goodrich, Aya Levi-Steiner, Dvir Steiner:
Straight-skeleton based contour interpolation. SODA 2003: 119-127 - [c30]Daniel Brunstein, Gill Barequet, Craig Gotsman:
Animating a Camera for Viewing a Planar Polygon. VMV 2003: 87-94 - [c29]Gill Barequet, Michael T. Goodrich, Chris Riley:
Drawing Graphs with Large Vertices and Thick Edges. WADS 2003: 281-293 - 2002
- [j21]Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich, Jack Snoeyink:
Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Algorithmica 33(2): 150-167 (2002) - [j20]Gill Barequet, Matthew T. Dickerson, Robert L. (Scot) Drysdale III:
2-Point site Voronoi diagrams. Discret. Appl. Math. 122(1-3): 37-54 (2002) - [c28]Gill Barequet:
The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. COCOON 2002: 360-369 - [c27]Vadim Makhervaks, Gill Barequet, Alfred M. Bruckstein:
Image Flows and One-Liner Graphical Image Representation. ICPR (1) 2002: 640-643 - 2001
- [j19]Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal:
Blending polygonal shapes with different topologies. Comput. Graph. 25(1): 29-39 (2001) - [j18]Gill Barequet, Matthew Dickerson, Michael T. Goodrich:
Voronoi Diagrams for Convex Polygon-Offset Distance Functions. Discret. Comput. Geom. 25(2): 271-291 (2001) - [j17]Gill Barequet:
A duality between small-face problems in arrangements of lines and Heilbronn-type problems. Discret. Math. 237(1-3): 1-12 (2001) - [j16]Gill Barequet, Sariel Har-Peled:
Polygon Containment and Translational Min-Hausdorff-Distance Between Segment Sets are 3SUM-Hard. Int. J. Comput. Geom. Appl. 11(4): 465-474 (2001) - [j15]Gill Barequet, Sariel Har-Peled:
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms 38(1): 91-109 (2001) - [j14]Gill Barequet:
A Lower Bound for Heilbronn's Triangle Problem in d Dimensions. SIAM J. Discret. Math. 14(2): 230-236 (2001) - [c26]Mihai Pop, Christian A. Duncan, Gill Barequet, Michael T. Goodrich, Wenjing Huang, Subodh Kumar:
Efficient perspective-accurate silhouette computation and applications. SCG 2001: 60-68 - [c25]Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin:
2-point site Voronoi diagrams. SCG 2001: 323-324 - 2000
- [j13]Gill Barequet, Daniel Shapiro, Ayellet Tal:
Multilevel sensitive reconstruction of polyhedral surfaces from parallel slices. Vis. Comput. 16(2): 116-133 (2000) - [c24]Gill Barequet, Matthew Dickerson:
The Translation-Scale Diagram for Point-Containing Placements of a Convex Polygon. CCCG 2000 - [c23]Gill Barequet:
A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. COCOON 2000: 44-53 - [c22]Gill Barequet:
w-Searchlight Obedient Graph Drawings. Graph Drawing 2000: 321-327 - [i2]Gill Barequet, Gershon Elber:
alpha-Sector of Rational Varieties. EuroCG 2000: 35-39 - [i1]Tatiana Surazhsky, Vitaly Surazhsky, Gill Barequet, Ayellet Tal:
Smooth Blending of Polygonal Slices with Different Topologies. EuroCG 2000: 40-44
1990 – 1999
- 1999
- [j12]Gill Barequet, Micha Sharir:
Partial surface matching by using directed footprints. Comput. Geom. 12(1-2): 45-62 (1999) - [j11]