Efficient approximate shortest-path queries among isothetic rectangular obstacles

DOI10.1007/3-540-57155-8_276MaRDI QIDQ5060142zbMATH OpenOpenAlexFDO

Authors Pinaki Mitra, Binay Bhattacharya

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_276

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• Rectilinear short path queries among rectangular obstacles
• scientific article; zbMATH DE number 512835
• Rectilinear shortest paths in the presence of rectangular barriers
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• Parallel rectilinear shortest paths with rectangular obstacles

Cites work

• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• A faster approximation algorithm for the Steiner problem in graphs
• A note on two problems in connexion with graphs
• Optimal Search in Planar Subdivisions
• ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
• Rectilinear shortest paths in the presence of rectangular barriers

Cited in

(13)

• Rectilinear shortest paths in the presence of rectangular barriers
• Parallel rectilinear shortest paths with rectangular obstacles
• Rectilinear short path queries among rectangular obstacles
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
• Querying Approximate Shortest Paths in Anisotropic Regions
• Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles
• Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane
• The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
• Shortest rectilinear path queries to rectangles in a rectangular domain
• Shortest rectilinear path queries to rectangles in a rectangular domain
• Applications of a numbering scheme for polygonal obstacles in the plane
• Efficient algorithms for shortest distance queries on special classes of polygons
• Planar rectilinear shortest path computation using corridors

This page was built for publication: Efficient approximate shortest-path queries among isothetic rectangular obstacles

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