Long monotone paths in line arrangements

DOI10.1007/s00454-004-1119-1zbMath1065.52016OpenAlexW2034770197WikidataQ56442900 ScholiaQ56442900MaRDI QIDQ1762943

William Steiger, József Balogh, Oded Regev, Mario Szegedy, Clifford D. Smyth

Publication date: 11 February 2005

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

Full work available at URL: https://doi.org/10.1007/s00454-004-1119-1

zbMATH Keywords

arrangementmonotone pathmaximal path length

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (5)

Straight skeletons and mitered offsets of nonconvex polytopes ⋮ On some monotone path problems in line arrangements ⋮ Partial-matching RMS distance under translation: combinatorics and algorithms ⋮ On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs ⋮ Monotone Paths in Planar Convex Subdivisions and Polytopes

This page was built for publication: Long monotone paths in line arrangements