Computing homotopic shortest paths efficiently
From MaRDI portal
Publication:2432731
Recommendations
Cites work
- Computing homotopic shortest paths in the plane
- Computing minimum length paths of a given homotopy class
- Euclidean shortest paths in the presence of rectilinear barriers
- scientific article; zbMATH DE number 2084275 (Why is no real title available?)
- scientific article; zbMATH DE number 4083048 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Testing homotopy for paths in the plane
- TRIANGULATING DISJOINT JORDAN CHAINS
Cited in
(20)- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Testing homotopy for paths in the plane
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- Minimum weight connectivity augmentation for planar straight-line graphs
- Testing graph isotopy on surfaces
- Minimum weight connectivity augmentation for planar straight-line graphs
- Efficient Computation of the Outer Hull of a Discrete Path
- Homotopic Rectilinear Routing with Few Links and Thick Edges
- scientific article; zbMATH DE number 124663 (Why is no real title available?)
- scientific article; zbMATH DE number 176771 (Why is no real title available?)
- scientific article; zbMATH DE number 177559 (Why is no real title available?)
- scientific article; zbMATH DE number 1947410 (Why is no real title available?)
- Computing homotopic shortest paths in the plane
- scientific article; zbMATH DE number 2079391 (Why is no real title available?)
- Testing homotopy for paths in the plane
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- Typical representatives of free homotopy classes in multi-punctured plane
- A Census of Plane Graphs with Polyline Edges
- Homotopy-aware multi-agent path planning on plane
This page was built for publication: Computing homotopic shortest paths efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432731)