Rectilinear paths among rectilinear obstacles
From MaRDI portal
Publication:2563920
DOI10.1016/0166-218X(96)80467-7zbMath0865.68010OpenAlexW2067943142MaRDI QIDQ2563920
Publication date: 6 January 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items (20)
Minimum-link shortest paths for polygons amidst rectilinear obstacles ⋮ A connectivity graph generation approach for Manhattan path calculation in detailed facility layout ⋮ Shortest paths among transient obstacles ⋮ Extremal functions of forbidden multidimensional matrices ⋮ An efficient algorithm for shortest paths in vertical and horizontal segments ⋮ Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Rectilinear paths with minimum segment lengths ⋮ Minimum-link paths revisited ⋮ Improved parameterized algorithms for minimum link-length rectilinear spanning path problem ⋮ FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS ⋮ Finding rectilinear least cost paths in the presence of convex polygonal congested regions ⋮ An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model ⋮ ON GEOMETRIC PATH QUERY PROBLEMS ⋮ An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions ⋮ Special issue on Locational analysis ⋮ Location of rectilinear center trajectories ⋮ Computing skeletons for rectilinearly convex obstacles in the rectilinear plane ⋮ Rectilinear paths among rectilinear obstacles ⋮ Computing Shortest Paths in the Plane with Removable Obstacles
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An O(n log n) Manhattan path algorithm
- On rectilinear link distance
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Visibility of disjoint polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Computing the link center of a simple polygon
- Rectilinear shortest paths in the presence of rectangular barriers
- Triangulating a simple polygon in linear time
- \(L_ 1\) shortest paths among polygonal obstacles in the plane
- Parallel rectilinear shortest paths with rectangular obstacles
- Minimum-link paths among obstacles in the plane
- Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Computing minimum length paths of a given homotopy class
- A new algorithm for shortest paths among obstacles in the plane
- Optimal shortest path queries in a simple polygon
- Rectilinear paths among rectilinear obstacles
- A linear time algorithm for minimum link paths inside a simple polygon
- On Some Distance Problems in Fixed Orientations
- Finding a manhattan path and related problems
- Euclidean shortest paths in the presence of rectilinear barriers
- Dynamic orthogonal segment intersection search
- Steiner problem in networks: A survey
- Finding minimum rectilinear distance paths in the presence of barriers
- A Polynomial Solution to the Undirected Two Paths Problem
- SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
- ON BENDS AND LENGTHS OF RECTILINEAR PATHS: A GRAPH-THEORETIC APPROACH
- SHORTEST PATH QUERIES IN RECTILINEAR WORLDS
- The Lee Path Connection Algorithm
- Some Variations of Lee's Algorithm
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- A shortest path algorithm for grid graphs
- ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES
- The weighted region problem
- Finding Rectilinear Paths Among Obstacles in a Two-Layer Interconnection Model
- On bends and distances of paths among obstacles in two-layer interconnection model
- Rectilinear Path Problems among Rectilinear Obstacles Revisited
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Note on State Minimization of Asynchronous Sequential Functions
- Steiner tree problems
This page was built for publication: Rectilinear paths among rectilinear obstacles
