An approximation algorithm for computing shortest paths in weighted 3-d domains
DOI10.1007/S00454-013-9486-0zbMATH Open1284.68652DBLPjournals/dcg/AleksandrovDMS13OpenAlexW1798872925WikidataQ62037428 ScholiaQ62037428MaRDI QIDQ2391841FDOQ2391841
Hristo N. Djidjev, Jörg-Rüdiger Sack, Anil Maheshwari, Lyudmil Aleksandrov
Publication date: 5 August 2013
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-013-9486-0
Recommendations
- Approximation algorithms for geometric shortest path problems
- Navigating weighted regions with scattered skinny tetrahedra
- Navigating Weighted Regions with Scattered Skinny Tetrahedra
- Computational Science and Its Applications – ICCSA 2004
- Approximating shortest paths on weighted polyhedral surfaces
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concrete and abstract Voronoi diagrams
- Abstract Voronoi diagrams revisited
- The algebraic degree of geometric optimization problems
- New results on shortest paths in three dimensions
- Title not available (Why is that?)
- The weighted region problem
- Movement planning in the presence of flows
- On finding approximate optimal paths in weighted regions
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces
- Approximating shortest paths on weighted polyhedral surfaces
- Approximation algorithms for geometric shortest path problems
- Determining approximate shortest paths on weighted polyhedral surfaces
- Approximate Euclidean Shortest Paths in 3-Space
- Abstract Voronoi diagram in 3-space
- An algorithm for shortest-path motion in three dimensions
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Precision-Sensitive Euclidean Shortest Path in 3-Space
- Title not available (Why is that?)
- Pseudo approximation algorithms with applications to optimal motion planning
Cited In (5)
- Constructing Approximate Shortest Path Maps in Three Dimensions
- Navigating Weighted Regions with Scattered Skinny Tetrahedra
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures
- Path planning in a weighted planar subdivision under the Manhattan metric
Uses Software
This page was built for publication: An approximation algorithm for computing shortest paths in weighted 3-d domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391841)
