Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 279-302 |
| Number of pages | 24 |
| Journal | Discrete and Computational Geometry |
| Volume | 45 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Mar 2011 |
Keywords
- Arrangements of double pseudolines
- Arrangements of pseudolines
- Chirotopes
- Combinatorial geometry
- Convexity
- Enumeration algorithms
- Mutations
- One-extension spaces
- Two-dimensional projective geometries