Pages that link to "Item:Q1188116"
From MaRDI portal
The following pages link to \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116):
Displaying 50 items.
- Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics (Q265715) (← links)
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout (Q274980) (← links)
- Fastest-path planning for direction-dependent speed functions (Q368729) (← links)
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Group nearest-neighbor queries in the \(L_1\) plane (Q500965) (← links)
- The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited (Q512987) (← links)
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
- Proximity problems for points on a rectilinear plane with rectangular obstacles (Q675298) (← links)
- \(L_{1}\) cheapest paths in ``Fjord scenery'' (Q706968) (← links)
- A wavefront approach to center location problems with barriers (Q816405) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q827313) (← links)
- Almost all permutation matrices have bounded saturation functions (Q831345) (← links)
- Planar rectilinear shortest path computation using corridors (Q833714) (← links)
- Placing a finite size facility with a center objective on a rectangular plane with barriers (Q864036) (← links)
- Finding shortest path in the presence of barriers: an alternate approach (Q870173) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Finding rectilinear least cost paths in the presence of convex polygonal congested regions (Q955608) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- Rectilinear short path queries among rectangular obstacles (Q1351630) (← links)
- Rectilinear distance to a facility in the presence of a square barrier (Q1761830) (← 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)
- Shortest paths among transient obstacles (Q2156288) (← links)
- Conditional facility location problems with continuous demand and a polygonal barrier (Q2239930) (← links)
- Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach (Q2252135) (← links)
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- Angle-restricted Steiner arborescences for flow map layout (Q2354031) (← links)
- Computation of arc length in the presence of barriers in networks (Q2369184) (← links)
- Flying over a polyhedral terrain (Q2380051) (← links)
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
- Rectilinear paths with minimum segment lengths (Q2446305) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Aggregate-MAX Top-<i>k</i> Nearest Neighbor Searching in the <i>L</i><sub>1</sub> Plane (Q2950594) (← links)
- All Farthest Neighbors in the Presence of Highways and Obstacles (Q3605486) (← links)
- OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM (Q3636311) (← links)
- ON GEOMETRIC PATH QUERY PROBLEMS (Q4682151) (← links)
- Saturation Problems about Forbidden 0-1 Submatrices (Q4959655) (← links)
- Spatial Distribution of Traffic Flow in a Rectangular City with a Grid Network and a Rectangular Barrier (Q5039041) (← links)
- Efficient approximate shortest-path queries among isothetic rectangular obstacles (Q5060142) (← links)
- (Q5088992) (← links)
- Rectilinear link diameter and radius in a rectilinear polygonal domain (Q5091051) (← links)
- GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
- Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures (Q5458853) (← links)
- Saturation of Multidimensional 0-1 Matrices (Q5889965) (← links)
- Shortest rectilinear path queries to rectangles in a rectangular domain (Q5896842) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
- An efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model (Q5943315) (← links)
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles (Q6174812) (← links)
- Applications of a numbering scheme for polygonal obstacles in the plane (Q6487421) (← links)
