REVIEW 3 cited by
NumPSLA -- An experimental research tool for pseudoline arrangements and order types
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present a program for enumerating all pseudoline arrangements with a small number of pseudolines and abstract order types of small point sets. This program supports computer experiments with these structures, and it complements the order-type database of Aichholzer, Aurenhammer, and Krasser. This system makes it practical to explore the abstract order types for 12 points, and the pseudoline arrangements of 11 pseudolines.
Forward citations
Cited by 3 Pith papers
-
Enumeration and Classification of Triangle-Maximal Pseudoline Arrangements
Exhaustive enumeration and classification of triangle-maximal pseudoline arrangements for all odd n ≤ 27, with symmetry groups per projective class and existence settled for all odd n ≤ 89 except n = 11.
-
Sweeping $x$-monotone pseudolines
Every arrangement of n x-monotone pseudolines admits a sweep with rope length at most 2n-2, and some arrangements require at least 7(n-2)/4+1.
-
Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
New computational constructions claim to achieve the upper bounds for 23 and 27 lines in the Kobon triangle problem, yielding N(23)=161 and N(27)=225, subject to the reliability of a heuristic straightening step.
Discussion (0). Continue with ORCID to comment.