OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS

DOI10.1080/10637199308915433zbMath1049.68903OpenAlexW2170816844MaRDI QIDQ4819957

Ruei-Chuan Chang, Ronnie T. C. Lee, Fang-Rong Hsu

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199308915433

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Parallel algorithms for some functions of two convex polygons
• An optimal parallel algorithm for the minimum circle-cover problem
• An Efficient General-Purpose Parallel Computer
• Optimal Point Location in a Monotone Subdivision
• Parallel Merge Sort
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms

This page was built for publication: OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS