A greedy algorithm to compute arrangements of lines in the projective plane
From MaRDI portal
Publication:6343741
DOI10.1007/S00454-021-00351-YzbMath1529.20061arXiv2006.14431WikidataQ114229308 ScholiaQ114229308MaRDI QIDQ6343741
Publication date: 25 June 2020
Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Configurations and arrangements of linear subspaces (14N20) Computational methods for problems pertaining to convex and discrete geometry (52-08)
This page was built for publication: A greedy algorithm to compute arrangements of lines in the projective plane