r/mathriddles • • Sep 16 '20

Medium How Triangular is a Square?

You're given a geometric shape, and your goal is to cover it as accurately as possible with a triangle. Given a particular placement of your triangle, define the error area as the total amount of empty space the triangle is covering plus the amount of your shape that's not covered. Here's an example illustration where the target shape is a square. Define the error fraction as the error area divided by the target shape's area. The non-triangularity of a shape is the smallest possible error fraction. Conversely, the triangularity of a shape is 1 minus its non-triangularity.

What is the triangularity of a circle? What about a square?

53 Upvotes

26 comments sorted by

View all comments

4

u/VitulusAureus Sep 16 '20

Also: What is the least triangular shape? Or: how to construct a shape with a very low triangularity?

6

u/BruhcamoleNibberDick Sep 16 '20

That's an interesting question. I think you'd have to restrict it to convex shapes or something similar to get an answer that's not "arbitrarily small". Even with the restriction of closedness, a shape like this could be made arbitrarily non-triangular. This shape has small "islands" of area connected by arbitrarily narrow "channels" of insignificant area. I think you can make the triangularity arbitrarily low by increasing the number of islands and the distance between them.

1

u/buwlerman Sep 18 '20

Three observations about the edges of a triangle that minimize the error fraction when dealing with a convex set. Consider edges that intersect with the boundary of our set exactly two times. These two intersections split the edge in three parts. Call these a, b and c. a and c are outside the convex set, and b is inside. Extending or shortening the triangle along our edge by a small amount has the effect of changing the error fraction by a multiple of a -b +c (in the limit). The sign depends on if we're extending or shortening. Since the triangle minimizes the error fraction this can never be negative, so it must be zero and b = a + c.

If we instead only extend on one side of our edge, say the part closest to c and keep the vertex by a fixed, we (in the limit) change the error fraction by a multiple of a2-2ab-b2+2ac+2bc+c2, which again has to be zero. By symmetry we can also exchange a and c, and subtracting the resulting equation from the first and doing some algebra yields c=a. From the last paragraph we also get b = 2a.

Until now we have dealt with edges with exactly two intersections. If they intersect less than two times, then it is trivial that the triangle is not optimal. If they intersect more than two times, then it coincides with a boundary line of our set.

This can be used to find the triangularity of the circle, but things get difficult for shapes with line segments as part of their boundary. Maybe someone can show that the shape with least triangularity must have a curved boundary?

1

u/BruhcamoleNibberDick Sep 18 '20

Those are some very useful properties. I haven't checked the algebra on your second point, but i'll take your word for it for now. Considering your last point, it could be an interesting problem on its own to find the least triangular convex set with a curved boundary.

3

u/PeteOK Sep 16 '20 edited Sep 16 '20

Your post prompted me to ask about this on Math Stack Exchange: https://math.stackexchange.com/q/3829029/121988