# Can we define the shape of a polygon in the plane using its interior angles?

I know a polygon can be well defined by specifying its edge length. By well defined, I mean the polygon can be unambiguously determined. Loosely speaking, if there are $n$ vertices, $2n-3$ critical edges can define an unambiguous polygon in 2D (rigid body).

My question is: Is it possible to define a polygon by specifying the angles between the edges so that the graph can only be determined up to a scale?

Upper left figure: For a triangle , three properly interior angles can determine the graph up to a scale. Upper right figure: But for quadrangles, the same angles may lead to non-similar quadrangles. Lower figure: However, if I introduce two bisections and specify the eight interior angles, it seems the angles can determine the shape.

Can any one recommend a book or something on this topic?

-

I'm not sure what meaning of "graph" you're using here; perhaps a planar straight line graph?

If we're speaking of polygons in the plane, as your figure suggests, any polygon can be triangulated, and specifying the interior angles of the triangles in the triangulation determines the polygon up to scaling. In particular, you only need to insert one diagonal into your quadrilateral.

In fact, I'm guessing triangulation is precisely the construction that gives your $2n-3$ figure when dealing with edge lengths too.

-

By "graph" do you mean in the sense of "graph theory". A collection of "vertices" and "edges" (this is the abstract definition, the "edges" are NOT geometrical, they can be "bent" freely, for example).

Or as we use it in "plotting a function", i.e. Graph = {x,f(x)| for all x in a given space}

You added the flag "graph theory", but do you know what that means? Because in "graph theory" you never concern yourself with fixed angles and such. Please clarify your question, what is a "graph".

-
Clarification questions should be relegated to the comments. –  Austin Mohr May 26 '12 at 5:29