Rectilinear paths among rectilinear obstacles
From MaRDI portal
Publication:2563920
Recommendations
- Rectilinear paths with minimum segment lengths
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
- Paths through a maze of rectangles
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 4039253 (Why is no real title available?)
- scientific article; zbMATH DE number 3725714 (Why is no real title available?)
- scientific article; zbMATH DE number 30300 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256695 (Why is no real title available?)
- scientific article; zbMATH DE number 1301090 (Why is no real title available?)
- A Note on State Minimization of Asynchronous Sequential Functions
- A Polynomial Solution to the Undirected Two Paths Problem
- A linear time algorithm for minimum link paths inside a simple polygon
- A new algorithm for shortest paths among obstacles in the plane
- A note on two problems in connexion with graphs
- A shortest path algorithm for grid graphs
- An O(n log n) Manhattan path algorithm
- Computing minimum length paths of a given homotopy class
- Computing the link center of a simple polygon
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Dynamic orthogonal segment intersection search
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Euclidean shortest paths in the presence of rectilinear barriers
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Finding a manhattan path and related problems
- Finding minimum rectilinear distance paths in the presence of barriers
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Minimum-link paths among obstacles in the plane
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- On Some Distance Problems in Fixed Orientations
- On bends and distances of paths among obstacles in two-layer interconnection model
- On rectilinear link distance
- Optimal shortest path queries in a simple polygon
- Parallel rectilinear shortest paths with rectangular obstacles
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Rectilinear paths among rectilinear obstacles
- Rectilinear shortest paths in the presence of rectangular barriers
- SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- Some Variations of Lee's Algorithm
- Steiner problem in networks: A survey
- Steiner tree problems
- The Lee Path Connection Algorithm
- The weighted region problem
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Triangulating a simple polygon in linear time
- Visibility of disjoint polygons
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
Cited in
(24)- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
- Minimum-link paths revisited
- Location of rectilinear center trajectories
- Shortest paths among transient obstacles
- Is it FPT to cover points with tours on minimum number of bends (errata)?
- ON GEOMETRIC PATH QUERY PROBLEMS
- An efficient algorithm for shortest paths in vertical and horizontal segments
- Special issue on Locational analysis
- Planning near-optimal corridors amidst obstacles
- Paths through a maze of rectangles
- scientific article; zbMATH DE number 140088 (Why is no real title available?)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
- Minimum-link shortest paths for polygons amidst rectilinear obstacles
- Extremal functions of forbidden multidimensional matrices
- Computing shortest paths in the plane with removable obstacles
- On the Complexity of Universality for Partially Ordered NFAs
- An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions
- FPT-algorithms for minimum-bends tours
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
- Rectilinear paths with minimum segment lengths
- Rectilinear paths among rectilinear obstacles
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
- Shortcut hulls: vertex-restricted outer simplifications of polygons
This page was built for publication: Rectilinear paths among rectilinear obstacles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563920)
