Introduction
I am a Belgian software engineer working in a company that is producing press brakes. I now have an interesting problem, where I would like to know the best solution, performance is really imporant in my working context. I think it might be interesting for other programmers/mathematicians as well.
Data
- I have a certain polygon, from which I know the 3D coordinates of all segments. A good example of what I mean is the following drawing I made by use of Geogebra online. Of course all segments are part of one 3dimensional surface, otherwise they would not be able to form a polygon.
Wanted
I am searching for a certain algorithm to calculate the area of a random polygon, starting from the knowledge of the segments (which are all lines).
Remarks
- What I was for example thinking, was that any random polygon, I would be able to divide it in many triangles. That would allow me to calculate the area of those triangles and then simply add them to each other.
- I am just wondering if there are smarter or more performant ways to calculate this, as I will program such an algorithm in the code that I am working on a daily basis.
