8 citations · 24 across the 12 of their papers we have counts for
12 papers
Counting Polyominoes, Revisited: Corrigendum and Addendum
Gill Barequet, Gil Ben-Shachar
This is a Corrigendum and Addendum to Algorithmica paper (2026) 88:51.
Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
Gill Barequet, Sariel Har-Peled
The 3SUM problem represents a class of problems conjectured to require time to solve, where is the size of the input. Given two polygons and in the plane, we s…
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Gill Barequet, Sariel Har-Peled
We present an efficient -time algorithm for computing a )-approximation of the minimum-volume bounding…
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching
Gill Barequet, Shion Fukuzawa, Michael T. Goodrich +3
Motivated by blockchain technology for supply-chain tracing of ethically sourced diamonds, we study geometric polyhedral point-set pattern matching as minimum-width polyhedral annu…
Minimal-Perimeter Lattice Animals and the Constant-Isomer Conjecture
Gill Barequet, Gil Ben-Shachar
We consider minimal-perimeter lattice animals, providing a set of conditions which are sufficient for a lattice to have the property that inflating all minimal-perimeter animals of…
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes
Gill Barequet, Mira Shalah
A -dimensional polycube is a facet-connected set of cells (cubes) on the -dimensional cubical lattice . Let denote the number of -dimensional polycu…