I have a fairly complex math question (or at least for me). In a gdl object i want to draw a polygon that has 2 sides made from a curve and 2 sides a straight line. This is easy enough but i also want to fillet where they join, see sketch.
Does anyone know the how to work out the formula for this, i believe the formula lies in analytical geometry but is a bit beyond me.
P.S. I realise 2 lines can be filleted using status codes using poly_b but i need to know the start, end and centre points of the fillet when a straight line and curve intersect to use this.
You need one more known distance f. The resulting radius r1 of the fitting circle is unique. The pink right triangle brings the formulas. To calculate the X/Y coordinates is still a lot of work, but this should bring you on the track.
And you will see intersection of the boundarys, which might not exist. The reason:
X2 is NOT R2-F. If you have a look on it in a larger scale you will see. The dependance of the edge radius and the distance of the tangiantial point is as complex as I wrote in my posting above. So it is for all other points. Maybe it is easier to give the radius known instead of the distance. Does make not much difference as one can see. In every case I am shure that there is a simple solution, because the angle of the rounding arc can be found in any of the known triangles. I don't know the English expressions, but there is a basic trigonometric rule that lets me believe in this.
If I get my work done before I sleep I spent still a thought on it. 😉 Interesting problem.