Efficient and small representation of line arrangements with applications
David Dobkin, Ayellet Tal · 2001
This paper addresses the problem of lossy compression of arrangements. Given an arrangement of $n$ lines in the plane, we show how to construct another arrangement consisting of many fewer lines. We give theoretical and empirical bounds to demonstrate the tradeoffs between the size of the new arrangement and the error from lossiness.