Fast query structures in anisotropic media

DOI10.1016/J.TCS.2012.01.019MaRDI QIDQ391227zbMATH OpenOpenAlexFDO

Authors Radwa El Shawi, Joachim Gudmundsson

Publication date 10 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.01.019

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25) Artificial intelligence for robotics (68T40)

Recommendations

• Quickest paths in anisotropic media
• Approximate shortest paths in anisotropic regions
• Approximate Shortest Paths in Anisotropic Regions
• Querying Approximate Shortest Paths in Anisotropic Regions
• Querying approximate shortest paths in anisotropic regions

Cites work

• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• A note on two problems in connexion with graphs
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Approximate Shortest Paths in Anisotropic Regions
• Approximate distance queries for weighted polyhedral surfaces
• Approximating shortest paths on weighted polyhedral surfaces
• Computational geometry. Algorithms and applications.
• Deterministic Minimal Time Vessel Routing
• Efficient Algorithms for Shortest Paths in Sparse Networks
• Geometric Spanner Networks
• Movement planning in the presence of flows
• Ordered theta graphs
• The weighted region problem

Cited in

(2)

• Quickest paths in anisotropic media
• Fastest-path planning for direction-dependent speed functions

This page was built for publication: Fast query structures in anisotropic media

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391227)