Testing a simple polygon for monotonicity optimally in parallel

DOI10.1016/0020-0190(93)90080-SMaRDI QIDQ688449zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Sumanta Guha

Publication date 19 May 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90080-s

zbMATH Keywords

computational geometryparallel algorithmssimple polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4074480
• Triangulating a polygon in parallel
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• scientific article; zbMATH DE number 1256697

Cites work

• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• A new triangulation-linear class of simple polygons
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• An optimal parallel algorithm for the minimum circle-cover problem
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• On geodesic properties of polygons relevant to linear time triangulation
• Optimal merging and sorting on the EREW PRAM
• Parallel Merge Sort
• Parallel Prefix Computation
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• Planar separators and parallel polygon triangulation.
• Triangulating a polygon in parallel

Cited in

(2)

• scientific article; zbMATH DE number 4074480 (Why is no real title available?)
• Rotationally monotone polygons

This page was built for publication: Testing a simple polygon for monotonicity optimally in parallel

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