A fast shortest path algorithm on terrain-like graphs
From MaRDI portal
Publication:2046450
DOI10.1007/s00454-020-00226-8OpenAlexW3047161895MaRDI QIDQ2046450
Publication date: 18 August 2021
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-020-00226-8
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Terrain-like graphs and the median Genocchi numbers ⋮ Persistent graphs and cyclic polytope triangulations
Cites Work
- Unnamed Item
- Unnamed Item
- Visibility graphs of towers
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Computing minimum length paths of a given homotopy class
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
- On characterizing terrain visibility graphs
- A linear time algorithm for minimum link paths inside a simple polygon
- From time series to complex networks: The visibility graph
- Graph Classes: A Survey
- VISIBILITY GRAPHS OF STAIRCASE POLYGONS WITH UNIFORM STEP LENGTH
- Unsolved problems in visibility graphs of points, segments, and polygons
- Visibility Algorithms in the Plane
- Computing the visibility polygon from a convex set and related problems
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
This page was built for publication: A fast shortest path algorithm on terrain-like graphs
