8 citations · 24 across the 12 of their papers we have counts for
8 papers · 1 filter
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…
Stable-Matching Voronoi Diagrams: Combinatorial Complexity and Algorithms
Gill Barequet, David Eppstein, Michael T. Goodrich +1
We study algorithms and combinatorial complexity bounds for \emph{stable-matching Voronoi diagrams}, where a set, , of point sites in the plane determines a stable matching…
Diffuse Reflection Diameter in Simple Polygons
Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein +4
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with walls from a…