Pages that link to "Item:Q3337244"
From MaRDI portal
The following pages link to Euclidean shortest paths in the presence of rectilinear barriers (Q3337244):
Displaying 50 items.
- Maximising the worth of nascent networks (Q301061) (← links)
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- Computing the geodesic center of a simple polygon (Q582099) (← links)
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets (Q662859) (← links)
- A linear-time algorithm for the geodesic center of a simple polygon (Q728492) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Fastest path across constrained moving rectilinear obstacles (Q751322) (← links)
- Shortest polygonal paths in space (Q756442) (← links)
- Shortest path planning for a tethered robot (Q904114) (← links)
- An optimal algorithm for computing a minimum nested nonconvex polygon (Q918739) (← links)
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (Q1101226) (← links)
- Minimum polygonal separation (Q1101685) (← links)
- Computing the link center of a simple polygon (Q1104086) (← links)
- Parallel algorithms for shortest path problems in polygons (Q1104089) (← links)
- Shortest path between two simple polygons (Q1107993) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- On the geodesic Voronoi diagram of point sites in a simple polygon (Q1115602) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- Computing external farthest neighbors for a simple polygon (Q1175781) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles (Q1195949) (← links)
- Parallel methods for visibility and shortest-path problems in simple polygons (Q1201749) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- Shortest curves in planar regions with curved boundary (Q1210291) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Ray shooting in polygons using geodesic triangulations (Q1330785) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- Removing edge-node intersections in drawings of graphs (Q1603534) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Computing geodesic furthest neighbors in simple polygons (Q1822979) (← links)
- Optimal shortest path queries in a simple polygon (Q1823689) (← links)
- On separating two simple polygons by a single translation (Q1825657) (← links)
- Characterizing and recognizing the visibility graph of a funnel-shaped polygon (Q1894711) (← links)
- Negative results on characterizing visibility graphs (Q1900990) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Voronoi game on polygons (Q2044961) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- Shortest paths in the plane with obstacle violations (Q2182089) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- Largest triangle inside a terrain (Q2222094) (← links)
- Visibility and ray shooting queries in polygonal domains (Q2261573) (← links)
- Weak visibility queries of line segments in simple polygons (Q2349738) (← links)
