On the Number of Simple Arrangements of Five Double Pseudolines

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...

Full description

Saved in:
Bibliographic Details
Published in:Discrete & computational geometry 2011-03, Vol.45 (2), p.279-302
Main Authors: Ferté, Julien, Pilaud, Vincent, Pocchiola, Michel
Format: Article
Language:English
Subjects:
Algorithms
Combinatorics
Computational geometry
Computational Mathematics and Numerical Analysis
Counting
Geometry
Isomorphism
Mathematics
Mathematics and Statistics
Mutations
Positioning
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0179-5376
1432-0444
DOI:10.1007/s00454-010-9298-4