Computing the L 1-diameter and center of a simple rectilinear polygon in parallel

DOI10.1007/3-540-58218-5_30zbMath1502.68344OpenAlexW1575164524MaRDI QIDQ5054772

Sven Schuierer

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_30

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (2)

Computing the \(L_1\) geodesic diameter and center of a polygonal domain ⋮ Diffuse reflection radius in a simple polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the geodesic center of a simple polygon
• Computing the link center of a simple polygon
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• Optimal parallel algorithms for rectilinear link-distance problems
• An addendum to parallel methods for visibility and shortest-path problems in simple polygons
• Triangulating a polygon in parallel
• Parallel algorithms for all minimum link paths and link center problems
• Matrix searching with the shortest path metric

This page was built for publication: Computing the L 1-diameter and center of a simple rectilinear polygon in parallel