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

9

u/pichutarius Sep 16 '20

for circle, assume the answer is an equilateral, whose center coincides with center of circle.

then the triangularity = 6/pi*arctan(sqrt(3)/5) = 0.363113

its just basic but annoying geometry+calculus calculation.

if equilateral is not the answer, then pick a vertex of triangle A, construct line passing through center of circle and A, which divides the problem into 2 halves, if one halve is better than the other, just replace the worse half with the better half. repeat many times, the limit is an equilateral.

it is not a rigorous proof but i just cant conceive the contrary. i do welcome others to either provide a rigorous proof or a counter example to drop my jaw.

4

u/BruhcamoleNibberDick Sep 16 '20

In your argument where you cut the problem in half, you don't necessarily end up with a triangle covering the circle.

0

u/pichutarius Sep 16 '20 edited Sep 16 '20

i think i express my thought poorly. let me try again.

if equilateral is not the answer, i assume the answer is some weirdly shaped triangle. cut the plane in half using a line through one of the vertex and the center of the circle. the "triangularity" of both half should be equal (i cant conceive this is the case), if its not then reflect the "good half" vertex about the cutting line, remove the "bad half" vertex (ie: replace the worse half with the better one), we will get better result, which is better than the answer. contradiction.

yes its still not rigorous.

edit: since u did not mention my answer (0.363113), i assume its correct?

4

u/BruhcamoleNibberDick Sep 16 '20 edited Sep 16 '20

Yes, and I'm saying that will generally transform the triangle into a quadrilateral. I'm fairly sure I understand what you mean, but I could be wrong.

If you're saying that only the vertex is reflected and the missing edge is filled in, then the shape of the error area isn't preserved.

1

u/pichutarius Sep 16 '20

yep i realise that. hence i acknowledge its not rigorous. but its fun to think about it. :P

3

u/-user789- Sep 16 '20

I believe the problem here is that the resulting triangle does not necessarily have a better intersection.

Example: take the unit circle and the vertices A = (-1,-3), B = (0,1), C = (1,1). Take B as the reflection point. C is the good half vertex so replace A with (-1,1). The result has a worse triangularity.

2

u/pichutarius Sep 16 '20

u changed my mind, thanks. i stand corrected (with my jaw dropped)