If the sides of a simple polygon P in general position are extended into a set of lines L, we say that P induces L. In this talk we consider the converse (and still open) problem: Given a set of n lines in general position, does there exist a simple n-gon P that induces L? An algorithm to compute a simple inducing n-1-gram will be presented together with some interesting consequences. Joint and in progress work with Jit Bose and Hazel Everett.