Testing a simple polygon for monotonicity optimally in parallel

DOI10.1016/0020-0190(93)90080-SzbMath0787.68100OpenAlexW2099794578MaRDI QIDQ688449

Danny Z. Chen, Sumantha 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

parallel algorithmssimple polygonscomputational geometry

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Optimal merging and sorting on the EREW PRAM
• Planar separators and parallel polygon triangulation.
• Parallel triangulation of a polygon in two calls to the trapezoidal map
• On geodesic properties of polygons relevant to linear time triangulation
• An optimal parallel algorithm for the minimum circle-cover problem
• Parallel Merge Sort
• A new triangulation-linear class of simple polygons
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Parallel Prefix Computation
• Triangulating a polygon in parallel

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