The following pages link to Gill Barequet (Q299062):
Displaying 50 items.
- (Q178858) (redirect page) (← links)
- Diffuse reflection diameter in simple polygons (Q299067) (← links)
- Automatic proofs for formulae enumerating proper polycubes (Q322211) (← links)
- An improved upper bound on the growth constant of polyominoes (Q322215) (← links)
- Offset polygon and annulus placement problems (Q390158) (← links)
- Cut equivalence of \(d\)-dimensional guillotine partitions (Q397169) (← links)
- Formulae and growth rates of high-dimensional polycubes (Q555508) (← links)
- A polyominoes-permutations injection and tree-like convex polyominoes (Q662025) (← links)
- Filling gaps in the boundary of a polyhedron (Q673983) (← links)
- Bounded-degree polyhedronization of point sets (Q691768) (← links)
- Optimal bounding cones of vectors in three dimensions (Q834998) (← links)
- The number of guillotine partitions in \(d\) dimensions (Q844186) (← links)
- Counting polycubes without the dimensionality curse (Q1043990) (← links)
- Offset-polygon annulus placement problems (Q1276941) (← links)
- Partial surface matching by using directed footprints (Q1286473) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- A data front-end for layered manufacturing. (Q1401871) (← links)
- Efficiently approximating polygonal paths in three and higher dimensions (Q1601006) (← links)
- 2-point site Voronoi diagrams (Q1613413) (← links)
- Enumerating polyominoes with fixed perimeter defect (Q1689885) (← links)
- Optimizing a constrained convex polygonal annulus (Q1775012) (← links)
- Properties of minimal-perimeter polyominoes (Q1790961) (← links)
- Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q1790962) (← links)
- The on-line Heilbronn's triangle problem (Q1827762) (← links)
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 (Q1945952) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Convex-straight-skeleton Voronoi diagrams for segments and convex polygons (Q2037112) (← links)
- On minimal-perimeter lattice animals (Q2081650) (← links)
- Automatic generation of formulae for polyominoes with a fixed perimeter defect (Q2088891) (← links)
- Polycubes with small perimeter defect (Q2093266) (← links)
- Minimum-perimeter lattice animals and the constant-isomer conjecture (Q2170800) (← links)
- Concatenation arguments and their applications to polyominoes and polycubes (Q2230414) (← links)
- A lower bound on the growth constant of polyaboloes on the Tetrakis lattice (Q2300025) (← links)
- Minimal-perimeter polyominoes: chains, roots, and algorithms (Q2326570) (← links)
- Counting \(n\)-cell polycubes proper in \(n - k\) dimensions (Q2357227) (← links)
- The on-line Heilbronn's triangle problem in \(d\) dimensions (Q2385144) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- On 2-site Voronoi diagrams under geometric distance functions (Q2434572) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- Covering points with a polygon (Q2477192) (← links)
- Translating a convex polygon to contain a maximum number of points. (Q2482905) (← links)
- A bijection between permutations and floorplans, and its applications (Q2499588) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- The growth rate of high-dimensional tree polycubes (Q2509733) (← links)
- Algorithms for counting minimum-perimeter lattice animals (Q2700382) (← links)
- Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions (Q2709794) (← links)
- A Lower Bound for Heilbronn's Triangle Problem in <i>d</i> Dimensions (Q2719164) (← links)
- (Q2766813) (← links)
- (Q2767876) (← links)
- Constrained Tri-Connected Planar Straight Line Graphs (Q2849798) (← links)
