For an angle $α\in (0,π)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $α$ between the two edge segments, or (ii) circular arcs of central angle $2(π-α)$. We derive upper and lower bounds on the maximum density of such graphs in terms of $α$. As an application, we improve upon bounds for the number of edges in $αAC_1^=$ graphs (i.e., graphs that can be drawn in the plane with one-bend edges such that any two crossing edges meet at angle $α$). This is the first improvement on the size of $αAC_1^=$ graphs in over a decade.