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

DOI10.1007/3-540-58218-5_30MaRDI QIDQ5054772zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
• Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
• Parallel computational geometry of rectangles
• A nearly parallel algorithm for the Voronoi diagram of a convex polygon
• A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
• Rectangulating rectilinear polygons in parallel
• Rectangulating rectilinear polygons in parallel
• PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
• A parallel algorithm for computing polygon set operations
• A center of a polytope: An expository review and a parallel implementation

Cites work

• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• An addendum to parallel methods for visibility and shortest-path problems in simple polygons
• Computing the geodesic center of a simple polygon
• Computing the link center of a simple polygon
• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 176583 (Why is no real title available?)
• scientific article; zbMATH DE number 177553 (Why is no real title available?)
• Matrix searching with the shortest path metric
• Optimal parallel algorithms for rectilinear link-distance problems
• Parallel algorithms for all minimum link paths and link center problems
• Triangulating a polygon in parallel

Cited in

(8)

• A center of a polytope: An expository review and a parallel implementation
• Rectangulating rectilinear polygons in parallel
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
• Rectilinear link diameter and radius in a rectilinear polygonal domain
• Computing the \(L_1\) geodesic diameter and center of a polygonal domain
• Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
• Rectangulating rectilinear polygons in parallel
• Rectilinear link diameter and radius in a rectilinear polygonal domain

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054772)