Abstract:
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in O(log 4 n) steps on the CREW PRAM model with a work bound of O((n + k)polylog(n)) where n and k are the input and output sizes respectively. In order to achieve the work bound we use a number of techniques, among which our use of persistent data-structures is somewhat novel in the context of parallel algorithms. To the best of our knowledge this is the most efficient parallel algorithm for hidden-surface removal for an important class of 3-D scenes.
Citations
|
222
|
Parallel prefix computation
– Ladner, Fischer
- 1980
|
|
161
|
A characterization of ten hidden surface algorithms
– Sutherland, Sproull, et al.
- 1974
|
|
149
|
A Synthesis of Parallel Algorithms
– Reif, ed
- 1993
|
|
133
|
Leeuwen. Maintenance of configurations in the plane
– Overmars, van
- 1981
|
|
68
|
Visibility and intersection problems in plane geometry
– Chazelle, Guibas
- 1989
|
|
66
|
Finding the maximum, merging and sorting in a parallel computation model
– Shiloach, Vishkin
- 1981
|
|
57
|
Cascading divide-and-conquer: a technique for designing parallel algorithms
– Atallah, Cole, et al.
- 1989
|
|
43
|
Efficient hidden surface removal for objects with small union size
– Katz, Overmars, et al.
- 1992
|
|
42
|
Worst-case optimal hidden-surface removal
– McKenna
- 1987
|
|
34
|
An e cient output-sensitive hidden-surface removal algorithms and its parallelization
– Reif, Sen
- 1988
|
|
23
|
Hidden surface removal for rectangles
– Bern
- 1990
|
|
21
|
Output-Sensitive Hidden Surface Removal
– Overmars, Sharir
- 1989
|
|
20
|
New algorithms for special cases of the hidden line elimination problem
– Guting, Ottmann
- 1987
|
|
15
|
A Fast Line-Sweep Algorithm For Hidden Line Elimination
– Nurmi
- 1985
|
|
14
|
A Simplified Technique for Hidden-Line Elimination in Terrains
– Preparata, Vitter
- 1992
|
|
10
|
Quadratic Bounds for Hidden-Line Elimination
– D'evai
- 1986
|
|
9
|
A polygonal approach to hidden-line elimination
– Goodrich
- 1992
|
|
9
|
Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations
– Atallah, Goodrich, et al.
- 1988
|
|
7
|
Generalized sweep methods for parallel computational geometry
– Goodrich, Ghouse, et al.
- 1990
|
|
6
|
Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures
– Tamassia, Vitter
- 1989
|
|
4
|
Efficient ray-shooting and hidden-surface removal
– Berg, Halperlin, et al.
- 1991
|
|
3
|
An inputsize/output-size trade-off inthe time-complexity of rectilinear hidden-surface removal
– Atallah, Goodrich, et al.
- 1990
|
|
3
|
Time and space bounds for hidden-line and hidden-surface elimination algorithms
– Schmitt
- 1981
|
|
1
|
the data-structures persistent
– Make
- 1989
|
