On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
From MaRDI portal
Publication:1286472
DOI10.1016/S0925-7721(98)00041-8zbMath0922.68121MaRDI QIDQ1286472
Simon Kahan, Jack Scott Snoeyink
Publication date: 3 May 1999
Published in: Computational Geometry (Search for Journal in Brave)
Related Items
The Complexity of Drawing a Graph in a Polygonal Region ⋮ Guarding galleries and terrains ⋮ Minimum-link paths revisited ⋮ The complexity of drawing a graph in a polygonal region ⋮ An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains ⋮ Finding minimum hidden guard sets in polygons --- tight approximability results ⋮ Fitting a \(C^m\)-smooth function to data. II
