Testing a simple polygon for monotonicity optimally in parallel

DOI10.1016/0020-0190(93)90080-SzbMATH Open0787.68100OpenAlexW2099794578MaRDI QIDQ688449FDOQ688449

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

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

zbMATH Keywords

computational geometryparallel algorithmssimple polygons

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Rotationally monotone polygons
• Title not available (Why is that?)

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)