Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
1 answer
231 views

Counting polygons in arrangements

For an arrangement of lines $\cal{A}$ in the plane, an inducing polygon $P$ is a simple polygon satisfying: (a) every edge $e$ of $P$ lies on some line $\ell$ of $\cal{A}$, and (b) every line $\ell \...
Joseph O'Rourke's user avatar