Pages that link to "Item:Q1109046"

The following pages link to Rectilinear shortest paths in the presence of rectangular barriers (Q1109046):

Displaying 31 items.

• On rectilinear link distance (Q808302) (← links)
• Planar rectilinear shortest path computation using corridors (Q833714) (← links)
• An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
• On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
• Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
• On parallel rectilinear obstacle-avoiding paths (Q1314529) (← links)
• Computing minimum length paths of a given homotopy class (Q1330462) (← links)
• Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
• Geometric path problems with violations (Q1709576) (← links)
• An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
• Optimal parallel algorithms for rectilinear link-distance problems (Q1897477) (← links)
• A multifacility location problem on median spaces (Q1917237) (← links)
• \(L_ 1\)-embeddability of rectilinear polygons with holes (Q1919299) (← links)
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
• Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
• Rectilinear path problems in restricted memory setup (Q2357163) (← links)
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
• Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
• An optimal algorithm for rectilinear steiner trees for channels with obstacles (Q3985984) (← links)
• A SHORTEST PAIR OF PATHS ON THE PLANE WITH OBSTACLES AND CROSSING AREAS (Q4513243) (← links)
• Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier (Q5039041) (← links)
• Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric (Q5056105) (← links)
• Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142) (← links)
• An efficient algorithm for shortest paths in vertical and horizontal segments (Q5096942) (← links)
• Enumerating Grid Layouts of Graphs (Q5119387) (← links)
• (Q5165388) (← links)
• Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
• Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
• Path planning in a weighted planar subdivision under the Manhattan metric (Q6184991) (← links)
• Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
• Finding a shortest pair of paths on the plane with obstacles and crossing areas (Q6487944) (← links)