Pages that link to "Item:Q2563920"

The following pages link to Rectilinear paths among rectilinear obstacles (Q2563920):

Displaying 20 items.

• A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980) (← links)
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
• Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (Q779860) (← links)
• Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608) (← links)
• An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
• Special issue on Locational analysis (Q1284594) (← links)
• Location of rectilinear center trajectories (Q1284595) (← links)
• Minimum-link shortest paths for polygons amidst rectilinear obstacles (Q2123290) (← links)
• Shortest paths among transient obstacles (Q2156288) (← links)
• Extremal functions of forbidden multidimensional matrices (Q2404366) (← links)
• Rectilinear paths with minimum segment lengths (Q2446305) (← links)
• Minimum-link paths revisited (Q2450201) (← links)
• Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
• Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590) (← links)
• FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
• ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151) (← links)
• An efficient algorithm for shortest paths in vertical and horizontal segments (Q5096942) (← links)
• Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468) (← links)
• An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315) (← links)
• Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)