Parallel algorithms for all minimum link paths and link center problems
From MaRDI portal
Publication:5056133
DOI10.1007/3-540-55706-7_10zbMath1502.68359OpenAlexW1603369313MaRDI QIDQ5056133
Anil Maheshwari, Subir Kumar Ghosh
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55706-7_10
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (2)
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel ⋮ Efficient piecewise-linear function approximation using the uniform metric
Cites Work
- Unnamed Item
- Computing the link center of a simple polygon
- A linear time algorithm for minimum link paths inside a simple polygon
- An Efficient Parallel Biconnectivity Algorithm
- Triangulating a polygon in parallel
- -Algorithms for Minimum Link Path and Related Problems
- An O(n log n) algorithm for computing a link center in a simple polygon
- Computing the visibility polygon from a convex set and related problems
This page was built for publication: Parallel algorithms for all minimum link paths and link center problems