3 citations · 3 across the 6 of their papers we have counts for
1 paper · 1 filter
Beniamin Bogosel, Dorin Bucur, Ilaria Fragalà
We consider Pólya's problem of finding, among convex sets of prescribed area, the one with the longest shortest fence, in the polygonal setting, namely when the class of competitor…