On the Number of Simple Arrangements of Five Double Pseudolines
- First Online:
- 78 Downloads
We describe an incremental algorithm to enumerate the isomorphism classes of double pseudoline arrangements. The correction of our algorithm is based on the connectedness under mutations of the spaces of one-extensions of double pseudoline arrangements, proved in this paper. Counting results derived from an implementation of our algorithm are also reported.
KeywordsCombinatorial geometry Convexity Two-dimensional projective geometries Arrangements of pseudolines Arrangements of double pseudolines Chirotopes Mutations One-extension spaces Enumeration algorithms
Unable to display preview. Download preview PDF.