Pages that link to "Item:Q2432731"
From MaRDI portal
The following pages link to Computing homotopic shortest paths efficiently (Q2432731):
Displaying 15 items.
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
- Testing homotopy for paths in the plane (Q1424318) (← links)
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges (Q1693321) (← links)
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees (Q2032154) (← links)
- Minimum weight connectivity augmentation for planar straight-line graphs (Q2272377) (← links)
- Testing graph isotopy on surfaces (Q2441582) (← links)
- Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs (Q2980910) (← links)
- Efficient Computation of the Outer Hull of a Discrete Path (Q3190071) (← links)
- Homotopic Rectilinear Routing with Few Links and Thick Edges (Q3557041) (← links)
- (Q4026306) (← links)
- (Q4036601) (← links)
- Computing homotopic shortest paths in the plane (Q4458869) (← links)
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS (Q4650092) (← links)
- Typical representatives of free homotopy classes in multi-punctured plane (Q5242904) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)