References
Ellipse
Sessile
D.L. Finn. The Shape of a Slice of French Bread, in preparation
We plot the points from our curvature estimates and find a linear best fit line.
The curvature of a sessile is given by . Therefore, from our linear fit we obtain and .
The Curvature is then given by...
Base 20
Base 5
0.012743
0.053716
0.014032
0.06372
0.012634
0.052981
0.014271
0.06490
(cc) image by anemoneprojectors on Flickr
Neither! They both provide equally good fits; however, the sessile fit comes with physical reasoning.
There are two types:
Signed Curvature
Here we look at the breads extrinsic curvature defined by...
Convex Set: A set which contains all line segments connecting any two points in the set.
convex
concave (non-convex)
Convex Hull: The convex hull of a set of points P is the intersection of all convex sets containing P.
But how do we find the convex hull for our configurations?
Moving Tangent
Circle
of
Curvature
Here we fit a secant to two sets of points sharing a common point, then average their slopes to find a 'tangent'.
Circle
Curvature
Tangent
Curvature
Average
Base
Simply, we can't. Our figures are not convex. However, they fit our configurations tightly. Moreover, the fit is better with larger configurations and more refinements. We merely seek a reasonable approximation.
0.737563
0.723583
0.730573
3
0.570336
0.566566
0.574105
5
Note that there will be outliers resulting from the use of the convex hull.
10
0.409552
0.409102
0.408653
0.316613
0.315357
0.315985
20
B.A. Mathematics
B.S. Physics
It is an algorithm for finding a minimum of a given function; it takes steps proportional to the gradient at a given point but in the opposite direction.
Surface Evolver is a program devolved by Ken Brakke which seeks a configuration with minimum energy using a (conjugate) gradient descent method given a set of forces and constraints.
We choose a structure consisting of mostly hexagons because the minimization problem at hand closely resembles that of the Honeycomb Conjecture, which states that the best way to divide a surface into equal areas with least perimeter is with hexagons.
This was proposed by Pappus of Alexandria around c. 320 and proven by Thomas Hales in c. 1999.
After one minimization:
Here is our initial configuration:
...and after 10:
Finally, after 1,000 iterations:
This is not the only possible minimal configuration given the same structure as the gradient descent only seeks a local minimum, not a global. For example, here is another possible minimal configuration.
Here we see several more fully evolved configurations.
Next, we investigate whether looking at the curvature of the boundary allows us to find a accurate model for the structure.
A graph is a collection of vertices...
...and edges.
So give the cell an area...
Now we use Green's Theorem
to transform the area constraint as such...
Our graphs will have faces...
Putting the equations and constraints gives the energy for one cell.
...and bodies.
And summing over all the edges yields the total energy with constraint for the whole figure.
(cc) image by anemoneprojectors on Flickr