scientific article; zbMATH DE number 2080988
From MaRDI portal
Publication:4474086
zbMATH Open1077.68917MaRDI QIDQ4474086FDOQ4474086
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230160.htm
Title of this publication is not available (Why is that?)
Recommendations
- Adaptive and compact discretization for weighted region optimal path finding.
- On finding approximate optimal paths in weighted regions
- Pseudo approximation algorithms, with applications to optimal motion planning
- Pseudo approximation algorithms with applications to optimal motion planning
- The weighted region problem
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (7)
- On discretization methods for approximating optimal paths in regions with direction-dependent costs
- Approximate Shortest Paths in Polygons with Violations
- Adaptive and compact discretization for weighted region optimal path finding.
- An approximation algorithm for computing shortest paths in weighted 3-d domains
- Approximation algorithms for shortest descending paths in terrains
- BUSHWHACK
- Shortest Gently Descending Paths
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474086)