Parallel algorithms for all minimum link paths and link center problems
From MaRDI portal
Recommendations
- -Algorithms for Minimum Link Path and Related Problems
- scientific article; zbMATH DE number 1424300
- Optimal parallel algorithms for rectilinear link-distance problems
- An optimal algorithm for the rectilinear link center of a rectilinear polygon
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
Cites work
- -Algorithms for Minimum Link Path and Related Problems
- A linear time algorithm for minimum link paths inside a simple polygon
- An O(n n) algorithm for computing a link center in a simple polygon
- An Efficient Parallel Biconnectivity Algorithm
- Computing the link center of a simple polygon
- Computing the visibility polygon from a convex set and related problems
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- Triangulating a polygon in parallel
Cited in
(7)- Optimal parallel algorithms for rectilinear link-distance problems
- Efficient piecewise-linear function approximation using the uniform metric
- scientific article; zbMATH DE number 1729273 (Why is no real title available?)
- Parallel Optimal Weighted Links
- -Algorithms for Minimum Link Path and Related Problems
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
- An O(n n) algorithm for computing a link center in a simple polygon
This page was built for publication: Parallel algorithms for all minimum link paths and link center problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056133)
