Fast query structures in anisotropic media

DOI10.1016/j.tcs.2012.01.019zbMath1416.68206OpenAlexW2088893077MaRDI QIDQ391227

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)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Ordered theta graphs
• Algorithms for approximate shortest path queries on weighted polyhedral surfaces
• Movement planning in the presence of flows
• Approximate Distance Queries for Weighted Polyhedral Surfaces
• Geometric Spanner Networks
• Deterministic Minimal Time Vessel Routing
• Approximate Shortest Paths in Anisotropic Regions
• Efficient Algorithms for Shortest Paths in Sparse Networks
• The weighted region problem
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Approximating shortest paths on weighted polyhedral surfaces

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