Computing minimum length paths of a given homotopy class
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432849 (Why is no real title available?)
- scientific article; zbMATH DE number 3945379 (Why is no real title available?)
- scientific article; zbMATH DE number 3680756 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3479762 (Why is no real title available?)
- scientific article; zbMATH DE number 3562121 (Why is no real title available?)
- scientific article; zbMATH DE number 1256695 (Why is no real title available?)
- A linear time algorithm for minimum link paths inside a simple polygon
- A note on two problems in connexion with graphs
- An Introduction to the Geometry of Numbers
- An Output-Sensitive Algorithm for Computing Visibility Graphs
- An efficient algorithm for determining the convex hull of a finite planar set
- An optimal algorithm for computing a minimum nested nonconvex polygon
- Complexity of Single-Layer Routing
- Computing the visibility polygon from a convex set and related problems
- Elementary differential geometry
- Euclidean shortest paths in the presence of rectilinear barriers
- Finding minimal convex nested polygons
- Finding minimal nested polygons
- Finding minimum rectilinear distance paths in the presence of barriers
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- New algorithms for special cases of the hidden line elimination problem
- On Shortest Paths in Polyhedral Spaces
- On rectilinear link distance
- On separating two simple polygons by a single translation
- Optimal Placement for River Routing
- Optimal computation of finitely oriented convex hulls
- Optimal shortest path queries in a simple polygon
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Rectilinear shortest paths in the presence of rectangular barriers
- The Number of Shortest Paths on the Surface of a Polyhedron
- The intersection searching problem for c-oriented polygons
- Translating polygons with applications to hidden surface removal
- Triangulating Simple Polygons and Equivalent Problems
- Triangulating a simple polygon in linear time
Cited in
(45)- Typical representatives of free homotopy classes in multi-punctured plane
- Fast optimal and bounded suboptimal Euclidean pathfinding
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- A fast shortest path algorithm on terrain-like graphs
- Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
- Efficient observer-dependent simplification in polygonal domains
- Computing homotopic shortest paths efficiently
- scientific article; zbMATH DE number 177559 (Why is no real title available?)
- A Census of Plane Graphs with Polyline Edges
- APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- k-pairs non-crossing shortest paths in a simple polygon
- Shortest paths in the plane with obstacle violations
- Structured discrete shape approximation: theoretical complexity and practical algorithm
- Shortest path planning for a tethered robot
- Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees
- \(L_{1}\) shortest path queries in simple polygons
- Shortest paths and convex hulls in 2D complexes with non-positive curvature
- Computing homotopic shortest paths in the plane
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
- Rectilinear paths among rectilinear obstacles
- Minimum weight connectivity augmentation for planar straight-line graphs
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Tracing compressed curves in triangulated surfaces
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- Finding an approximate minimum-link visibility path inside a simple polygon
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- Geometric path problems with violations
- Shortest paths in the plane with obstacle violations
- scientific article; zbMATH DE number 7559259 (Why is no real title available?)
- Approximate Shortest Paths in Polygons with Violations
- Computing \(L_1\) shortest paths among polygonal obstacles in the plane
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
- Computing the Fréchet distance between polygons with holes
- Inserting Multiple Edges into a Planar Graph
- Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
- Computing pseudotriangulations via branched coverings
- AN OPTIMAL MORPHING BETWEEN POLYLINES
- Median trajectories
- Geodesic-preserving polygon simplification
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- Minimum weight connectivity augmentation for planar straight-line graphs
- Minimum-link paths revisited
- Testing graph isotopy on surfaces
This page was built for publication: Computing minimum length paths of a given homotopy class
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330462)
