The best polynomial bounds for the number of triangles in a simple arrangement of n pseudo-lines
From MaRDI portal
Publication:3464030
zbMath1335.52032arXiv0801.2845MaRDI QIDQ3464030
Publication date: 20 January 2016
Full work available at URL: https://arxiv.org/abs/0801.2845
Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Related Items (4)
Minimal representations of order types by geometric graphs ⋮ Arrangements of Pseudocircles: Triangles and Drawings ⋮ Arrangements of pseudocircles: triangles and drawings ⋮ Minimal Representations of Order Types by Geometric Graphs
This page was built for publication: The best polynomial bounds for the number of triangles in a simple arrangement of n pseudo-lines
