Lower bounds on the length of monotone paths in arrangements

DOI10.1007/BF02574679zbMath1334.52016OpenAlexW2055418304WikidataQ56442909 ScholiaQ56442909MaRDI QIDQ276089

Ji{ří} Matoušek

Publication date: 26 April 2016

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

Full work available at URL: https://doi.org/10.1007/bf02574679

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (4)

On some monotone path problems in line arrangements ⋮ On disjoint concave chains in arrangements of (pseudo) lines ⋮ A pseudo-algorithmic separation of lines from pseudo-lines ⋮ Monotone paths in line arrangements

Cites Work

• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• Unnamed Item

This page was built for publication: Lower bounds on the length of monotone paths in arrangements