Pages that link to "Item:Q1330462"

The following pages link to Computing minimum length paths of a given homotopy class (Q1330462):

Displaying 45 items.

• Computing the \(L_1\) geodesic diameter and center of a polygonal domain (Q527444) (← links)
• Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
• Computing pseudotriangulations via branched coverings (Q714984) (← links)
• Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
• Shortest path planning for a tethered robot (Q904114) (← links)
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges (Q1693321) (← links)
• Geometric path problems with violations (Q1709576) (← links)
• An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
• Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
• A fast shortest path algorithm on terrain-like graphs (Q2046450) (← links)
• Fast optimal and bounded suboptimal Euclidean pathfinding (Q2060748) (← links)
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← 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)
• Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
• \(L_{1}\) shortest path queries in simple polygons (Q2272388) (← links)
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane (Q2324627) (← links)
• \(L_1\) geodesic farthest neighbors in a simple polygon and related problems (Q2334499) (← links)
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time (Q2349742) (← links)
• Median trajectories (Q2375955) (← links)
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane (Q2414865) (← links)
• Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
• Computing homotopic shortest paths efficiently (Q2432731) (← links)
• Testing graph isotopy on surfaces (Q2441582) (← links)
• Minimum-link paths revisited (Q2450201) (← links)
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
• Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
• ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE (Q2931158) (← links)
• Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
• Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
• Computing homotopic shortest paths in the plane (Q4458869) (← links)
• APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS (Q4650092) (← links)
• k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON (Q4682198) (← links)
• AN OPTIMAL MORPHING BETWEEN POLYLINES (Q4818557) (← links)
• (Q5088992) (← links)
• (Q5111738) (← links)
• Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
• Typical representatives of free homotopy classes in multi-punctured plane (Q5242904) (← links)
• GEODESIC-PRESERVING POLYGON SIMPLIFICATION (Q5261017) (← links)
• A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
• AN APPROXIMATE MORPHING BETWEEN POLYLINES (Q5311633) (← links)
• Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)
• k-pairs non-crossing shortest paths in a simple polygon (Q6487450) (← links)