On the number of arrangements of pseudolines

DOI10.1007/PL00009318zbMath0891.05005MaRDI QIDQ1380817

Stefan Felsner

Publication date: 8 July 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

encodingarrangementface latticespseudolinetopological sweep

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Erd?s problems and related topics of discrete geometry (52C10) Euclidean geometries (general) and generalizations (51M05)

Related Items (12)

Abstract order type extension and new results on the rectilinear crossing number ⋮ Improved enumeration of simple topological graphs ⋮ Coding and counting arrangements of pseudolines ⋮ Ramsey numbers and monotone colorings ⋮ Bundled Crossings Revisited ⋮ Gray code enumeration of plane straight-line graphs ⋮ Enumeration of simple complete topological graphs ⋮ Acyclic sets of linear orders via the Bruhat orders ⋮ Enumeration of simple complete topological graphs ⋮ Sweeps, arrangements and signotopes ⋮ New algorithms and bounds for halving pseudolines ⋮ Induced Ramsey-type results and binary predicates for point sets

This page was built for publication: On the number of arrangements of pseudolines