James B. Salem. *Render: A data parallel approach to polygon rendering. Technical Report VZ88--2, Thinking Machines Corporation, January 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scans as Primitive Parallel Operations - Blelloch (1987) (97 citations) (Correct)
....in more than one line. This routine has a step complexity of O(1) and requires as many processors as pixels in the lines. The routine has been implemented on the Connection Machine, has been extended to render solid objects by Salem, and is part of a rendering package for the Connection Machine [38]. 2.5 Load Balancing Up to now this paper has assumed that a P RAM always has as many processors as elements in the data vectors. This section considers simulating multiple elements on each processor. Such simulation is important for two reasons. First, from a practical point of view, real ....
James B. Salem. *Render: A Data Parallel Approach to Polygon Rendering. Technical Report VZ88--2, Thinking Machines Corporation, January 1988.
Parallel Solutions to Geometric Problems in the Scan Model.. - Blelloch, Little (1994) (7 citations) (Correct)
....a pair of points on a two dimensional grid (the two endpoints of a line) determine what pixels in a finite resolution grid lie on a line between the endpoints. For n pixels in a line, this routine has complexities S(n) O(1) and E(n) O(n) The routine has been extended to render solid objects [32]. The fourth algorithm is a line of sight algorithm. Given a grid of altitudes and an observation point on the grid, the algorithm returns the points visible from the observation point. For n grid points, this routine has complexities S(n) O(1) Parallel Solutions to Geometric Problems Scan ....
.... of depth O(lg n) are in NC 1 [17] If E(n) is the element complexity for an algorithm with an input of length n, then E(n) Parallel Solutions to Geometric Problems Scan Model 10 A = 5 1 3 4 3 9 2 6] B = 2 5 3 8 1 3 6 2] F = T F F F T T F T] A B = 7 6 6 12 4 12 8 8] A Theta B = [10 5 9 32 3 27 12 12] select(F, A, B) 5 5 3 8 3 9 6 6] scan(A) 0 5 6 9 13 16 25 27] max scan(A) 0 5 5 5 5 5 9 9] A = o t e m e r g y] I (index vector) 2 5 4 3 1 6 0 7] D (default vector) f r e e] S (selection vector) T F F T F F F F] permute(A, I) g e o m e t r y] d permute(A, I, S, D) f ....
[Article contains additional citation context not shown here]
J. B. Salem, *Render: A Data Parallel Approach to Polygon Rendering, Tech. Rep. VZ88--2, Thinking Machines Corporation, Jan. 1988. Parallel Solutions to Geometric Problems - Scan Model 46
Class Notes : Programming Parallel Algorithms - Cs Fall Guy (1993) (1 citation) (Correct)
No context found.
James B. Salem. *Render: A data parallel approach to polygon rendering. Technical Report VZ88--2, Thinking Machines Corporation, January 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC