Circle graphs are intersection graphs of chords in a circle and $k$-polygon graphs are intersection graphs of chords in a convex $k$-sided polygon where each chord has its endpoints on distinct sides. The $k$-polygon graphs, for $k \ge 2$, form an infinite chain of graph classes, each of which contains the class of permutation graphs. The union of all of those graph classes is the class of circle graphs. The polygon number $\gp(G)$ of a circle graph $G$ is the minimum $k$ such that $G$ is a $k$-polygon graph. Given a circle graph $G$ and an integer $k$, determining whether $\gp(G) \le k$ is NP-complete, while the problem is solvable in polynomial time for fixed $k$. In this paper, we show that $\gp(G)$ is always at least as large as the asteroidal number of $G$, and equal to the asteroidal number of $G$ when $G$ is a connected distance hereditary graph that is not a clique. This implies that the classes of distance hereditary permutation graphs and distance hereditary AT-free graphs are the same, and we give a forbidden subgraph characterization of that class. We also establish the following upper bounds: $\gp(G)$ is at most the clique cover number of $G$ if $G$ is not a clique, at most 1 plus the independence number of $G$, and at most $\lceil n/2 \rceil$ where $n \ge 3$ is the number of vertices of $G$. Our results lead to linear time algorithms for finding the minimum number of corners that must be added to a given circle representation to produce a polygon representation, and for finding the asteroidal number of a distance hereditary graph, both of which are improvements over previous algorithms for those problems.