An efficient algorithm for shortest paths in vertical and horizontal segments

DOI10.1007/3-540-63307-3_63zbMath1497.68526OpenAlexW1600927808MaRDI QIDQ5096942

David W. Hart, David Eppstein

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_63

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (1)

Approximate distance oracles for graphs with dense clusters

Cites Work

• Unnamed Item
• Unnamed Item
• Rectilinear shortest paths in the presence of rectangular barriers
• Rectilinear paths among rectilinear obstacles
• TRIANGULATING POLYGONS WITHOUT LARGE ANGLES
• Faster shortest-path algorithms for planar graphs

This page was built for publication: An efficient algorithm for shortest paths in vertical and horizontal segments