Parallel Algorithms for Arrangements 1


We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(log n log∗ n) time and n2/ log n processors. We generalize this to obtain an O(log n log∗ n)-time algorithm using nd / log n processors for solving the problem in d dimensions. We… (More)


13 Figures and Tables

Cite this paper

@inproceedings{Brisson1996ParallelAF, title={Parallel Algorithms for Arrangements 1}, author={Erik Brisson}, year={1996} }