- in 2004 up to n = 56 by Iwan Jensen, and in 2024 up to n = 70 by Gill
Barequet and Gil Ben-Shachar. Free
polyominoes were
enumerated in 2007 up to n =...
-
given direction and for
finding the
intersection of the
shape with a line.
Barequet &
Rogol (2007)
consider the
problem of
computing the
axiality exactly,...
-
straight cut (the fold-and-cut theorem), and
related origami design problems.
Barequet et al. use
straight skeletons in an
algorithm for
finding a three-dimensional...
-
boundary connectivity property to higher-dimensional polycubes.
Barequet, Ronnie;
Barequet, Gill; Rote, Günter (2010), "Formulae and
growth rates of high-dimensional...
- 1.6 megabytes).
Includes a
summary of Scott's and Fletcher's articles.
Barequet, Gill; Tal,
Shahar (2010). "Solving
General Lattice Puzzles". In Lee, Der-Tsai;...
- 1968, and as a
result had
started to take an
interest in
sieve theory."
Barequet, Gill (2001). "A
lower bound for Heilbronn's
triangle problem in d dimensions"...
- Knuth. the
exact number is the Schröder number. In d dimensions, Ackerman,
Barequet,
Pinter and
Romik give an
exact summation formula, and
prove that it is...
- Sciences, 14 (3): 183–199, doi:10.1007/BF00991005, MR 0824371, S2CID 8311538.
Barequet, Gill; Har-Peled,
Sariel (2001), "Efficiently
approximating the minimum-volume...
- Com****tional Geometry, 40 (3): 401–413, doi:10.1007/s00454-007-9041-y, MR 2443292
Barequet, Gill; Naor,
Jonathan (2006), "Large k {\displaystyle k} -D
simplices in...
- Systems. 4 (2): 126–127. doi:10.1080/03081077808960672. ISSN 0308-1079.
Barequet and
Wolfers (1998). "Optimizing a
Strip Separating Two Polygons". Graphical...
