I am trying to write a routine that will graph a 10-point polygon from a series of edge lengths and angles. I do not have any coordinates at start time, although obviously I can anchor the whole to the origin (0,0) at a specific point. If there are multiple potential polygons that meet my criteria (and there very well might be), I'm satisfied by just looking at one example. Similarly, I'm happy with any rotation--in fact, this project started by trying to look at these polygons in a rotation-neutral setting and pull them apart. I just want an example to look at as a sanity check. Is there an easy way to do this? I have been trying to figure it out by creating a series of triangles and solving for unmeasured edge lengths, but getting coordinates is a pain in the ass and this is not my normal area of coding expertise, and it seems like there should be a package to help with this--or at least a pipeline somewhere. Things I have tried: I've tried poking Shapely's polygon function, but that seems to assume that you have a list of point coordinates to work with rather than a series of edge lengths... and if I have the coordinates, I can graph the damn thing and be done with it. searching through github for tools that might work, which yielded this helpful repository I have been using to help solve for any angles or edge lengths that I don't already have for the triangles I'm trying to break the main down into. A number of answers for triangles like this one that will give me the answer for middle school geometry problems... but which I'm not sure how well they will generalize once I am no longer trying to find points after (0,0) and (len(AB),0). Reading this answer, but I'm confused as to how to generalize what I'm trying to do because my points are not necessarily sorted in a clockwise direction. Thanks in advance! Continue reading...
