Parallel computational geometry of rectangles
Authors:
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 25-49
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Cascading Divide-and-Conquer: A Technique for Designing Parallel AlgorithmsSIAM Journal on Computing, 1989
- Parallel computational geometryAlgorithmica, 1988
- Parallel computation of geometric properties from the medial axis transformComputer Vision, Graphics, and Image Processing, 1988
- Fractional cascading: I. A data structuring techniqueAlgorithmica, 1986
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectanglesActa Informatica, 1984
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the planeJournal of Algorithms, 1983
- ProblemsJournal of Algorithms, 1983
- The measure problem for rectangular ranges in d-spaceJournal of Algorithms, 1981
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978