On the Number of Simple Arrangements of Five Double Pseudolines

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)279-302
Number of pages24
JournalDiscrete and Computational Geometry
Volume45
Issue number2
DOIs
Publication statusPublished - 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

Fingerprint

Dive into the research topics of 'On the Number of Simple Arrangements of Five Double Pseudolines'. Together they form a unique fingerprint.

Cite this