Abstract
An (nk)-configuration is a set of n points and n lines in the projective plane such that their point-line incidence graph is k-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are considered to be straight lines, pseudolines, or just combinatorial lines. We provide an algorithm for generating, for given n and k, all topological (nk)-configurations up to combinatorial isomorphism, without enumerating first all combinatorial (nk)-configurations. We apply this algorithm to confirm efficiently a former result on topological (184)-configurations, from which we obtain a new geometric (184)-configuration. Preliminary results on (194)-configurations are also briefly reported.
| Original language | English |
|---|---|
| Pages (from-to) | 175-186 |
| Number of pages | 12 |
| Journal | Computational Geometry: Theory and Applications |
| Volume | 47 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
Fingerprint
Dive into the research topics of 'Enumerating topological (nk)-configurations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver