Publication:4886059
From MaRDI portal
zbMath0849.68092MaRDI QIDQ4886059
Publication date: 4 November 1996
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68M99: Computer system organization
Related Items
Querying two boundary points for shortest paths in a polygonal domain, Algorithms for approximate shortest path queries on weighted polyhedral surfaces, Approximate distance oracles for graphs with dense clusters, Rectilinear short path queries among rectangular obstacles, Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach