Fundamentals of Computation Theory
From MaRDI portal
Publication:5900801
DOI10.1007/b11926zbMath1278.68306OpenAlexW2249105474MaRDI QIDQ5900801
Jörg-Rüdiger Sack, Lyudmil Aleksandrov, Anil Maheshwari
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11926
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ Shortest monotone descent path problem in polyhedral terrain ⋮ Algorithms for approximate shortest path queries on weighted polyhedral surfaces ⋮ An optimal-time algorithm for shortest paths on a convex polytope in three dimensions ⋮ On discretization methods for approximating optimal paths in regions with direction-dependent costs
Uses Software
This page was built for publication: Fundamentals of Computation Theory
