On the parallel-decomposability of geometric problems

DOI10.1007/BF01758844zbMath0748.68079MaRDI QIDQ1194344

Jyh-Jong Tsay, Mikhail J. Atallah

Publication date: 27 September 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

mesh-connected arrays of processors

Mathematics Subject Classification ID

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

Related Items (1)

An efficient implementation of priority queues using fixed-sized systolic coprocessors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multidimensional divide-and-conquer
• Sorting numbers using limited systolic coprocessors
• Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Parallel geometric algorithms on a mesh-connected computer
• An On-Chip Compare/Steer Bubble Sorter
• On Finding the Maxima of a Set of Vectors
• Sorting n objects with a k-sorter
• Mesh computer algorithms for computational geometry

This page was built for publication: On the parallel-decomposability of geometric problems