A greedy algorithm to compute arrangements of lines in the projective plane
From MaRDI portal
Publication:2671170
DOI10.1007/s00454-021-00351-yOpenAlexW3037212754WikidataQ114229308 ScholiaQ114229308MaRDI QIDQ2671170
Publication date: 3 June 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.14431
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)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-recursive freeness and non-rigidity
- On sets defining few ordinary lines
- Minimal fields of definition for simplicial arrangements in the real projective plane
- On topological and geometric \((19_4)\) configurations
- Simplicial arrangements with up to 27 lines
- Combinatorial simpliciality of arrangements of hyperplanes
- A simplicial 3-arrangement of 21 planes
- Finite Weyl groupoids
- Supersolvable simplicial arrangements
- Freeness of hyperplane arrangements and related topics
- Les immeubles des groupes de tresses généralises
- Finite Weyl groupoids of rank three
- (22_4) and (26_4) configurations of lines
- A catalogue of simplicial arrangements in the real projective plane
- Free and Locally Free Arrangements with a Given Intersection Lattice
- Free but not recursively free arrangements
