On Inducing n-gons
Marjan Abedin, Ali Mohades, Marzieh Eskandari · Canadian Conference on Computational Geometry · 2011
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.