Generation of random pseudo-line arrangements
In this nice overview, the author presents some basics about pseudoline arrangements in the real (projective) plane, i.e. arrangements of smooth simple plane curves such that each pair of curves crosses transversally at exactly one point. After a nice introduction to the subject, including a question about the stretchability of pseudoline arrangements (which is NP-hard) or about different techniques we can use to understand such arrangements (such as wiring diagrams), the author addresses a question about random pseudoline arrangements and how to use Markov chains to construct such random arrangements with some specific properties. The main result that the author presents is devoted to the rapidly mixing Markov chains that flip only random triangles in general random pseudoline arrangements, and for details we refer to the last theorem in the note.
This page was built for publication: Generation of random pseudo-line arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540084)