Given a tessellation of a plane, define a function whose value at a given point is the distance to the nearest boundary edge.
For a given slice through the plane, path integrate the function along the line, averaged over length. What is the minimum "difficulty" slice? It probably coincides with many edges. What tessellation maximizes the minimum slice?
No comments :
Post a Comment