this is just a piece of what I plan on making. | press SPACE to place point at mouse | my goal is to find the point in an irregular polygon that is more visually appealing as a center point, as the centroid of irregular polygons often lies outside of the shape. ALGORITHM: 1. take P1 & P2, treating them as points on a line (L1) 2. take P2 & P3, treating them as a line segment (S1) 3. check for intersection (L1&S1) | if so > add point to list 4. change S1 by 1 idx until all segments are checked 5. repeat process until all lines are checked there is a little more going on behind the scenes, but this is all that you really need to know to understand what is happening.
