Monotone paths in line arrangements

DOI10.1016/S0925-7721(02)00136-0zbMath1042.52021OpenAlexW2212856239MaRDI QIDQ1869746

Radoš Radoičić, Géza Tóth

Publication date: 28 April 2003

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(02)00136-0

zbMATH Keywords

line arrangementmonotone path\(k\)-level

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Paths and cycles (05C38) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (1)

On some monotone path problems in line arrangements

Cites Work

• Lower bounds on the length of monotone paths in arrangements
• Topologically sweeping an arrangement
• Improved bounds for planar \(k\)-sets and related problems
• Point sets with many \(k\)-sets
• Unnamed Item
• Unnamed Item

This page was built for publication: Monotone paths in line arrangements