J. Foley, A. Van Dam, "Fundamentals of Interactive Computer Graphics", Addison-Wesley, 1984, 1st edition.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....radiance values to their vertices and perform a Gouraud interpolation. 3 Preprocessing During the preprocessing phase we generate the visibility maps for each vertex of the mesh. 3. 1 Computation of visibility maps We compare three different ways to encode a visibility map: the hemicube [2], a single plane [3] and the hemisphere discretized into a rectangular grid. To obtain the visibility map in a vertex v the mesh is projected by a central projection with center v to one of these models (see figure 2) The hemicube, the hemisphere and the single plane are centered around v s ....

J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes. Fundamentals of Interactive Computer Graphics, Addison Wesley, second edition. 1990.

....o f # ## # ## Log opponent [8] ### # ## # Comprehensive [9] Two o f # ## # ## Table 1: Colour space conventions. For the normalised RGB and the comprehensive normalisation intensity variation is removed so one colour component is a linear combination of the other two. The HSV colour space [10] may be derived from the RGB space as # ############ # # #### # # # ### (1) where # # ########## ##########. The log opponent space [8] # # ####### # # # ###### ####### # # # ###### ###### # ###### (2) is an attempt to model the human vision system s opponent colour ....

James D. Foley, Andries van Dam, Steven K. Feiner, and John F. Hughes. Fundamentals of interactive computer graphics. Addison-Wesley, 2 edition, 1994.

....segmented manually. Figure 2 shows some example clothed training images. Our first objective was to choose a colour space in which the skin region was as compact as possible. Each pixel, r, g, b in the training set is transformed to one of the colour spaces shown in Table 1. The HSV colour space [10] may be derived from the RGB space as v =max(r, g, b) s=d v, h = 8 : g b r = v 2 r b g = v 4 g r b = v (1) Figure 2: Example clothed images from the training set Colour space Components RGB r, g, b HSV h, s, v Normalised RGB Two o f r, g, Log opponent [8] I,R g ,B y ....

James D. Foley, Andries van Dam, Steven K. Feiner, and John F. Hughes. Fundamentals of interactive computer graphics. Addison-Wesley, 2 edition, 1994.

....paint the farther side first, then the root polygon (which is contained by the separating plane) and lastly the viewpoint side a back to front painting of the polygons. 3 K D Trees in Ray Tracing To use such a binary structure for ray tracing the following must be kept in mind: 5e would like to be able to ray trace any kind of object. Therefore, using the planes of polygons as separating planes is restrictive; at the same time the plane must be easy to intersect against so as not to be a bottleneck during traversal. Splitting objects across planes is inappropriate for ....

....bounding volumes is essential; again, these volumes must be simple enough so as to serve as a quick intersection check. We propose using planes orthogonal to the X, Y and Z axes as separating planes. It is easy to intersect a ray against any of these planes. The construction of the tree is also 5 y=c2 I Z=4 x=c3 c8 ,z=c6 11 II j y=c7 x=cl x=c5 Figure 1: A Sample k d Tree faster since only comparisons are involved. A sample k d tree is shown in Fig. 1. The dotted lines indicate planes of constant Z (parallel to the plane of the page) Only the separating planes are indicated. ....

[Article contains additional citation context not shown here]

James D. Foley and Van Dam A. Fundamentals of Interactive Computer Graphics. Addison Vresley, Reading, Massachusetts, 1982.

....expression is given by: 12 ; 33 3 ; 1 2 , 1 2 00 0 , Mj nj M ss s M huuu uuu r (14) 12 , M ss s j r are coefficients depending on control points of the j th basis function. Synthetic formulation for 1D and 2D domain can be done by mean of matrix representation [10]: 1 1 [1] nj j hu= TMQ ( 12 2 1 [2] n nj j huu= TMTMQ (15) where : 32 1 kkkk uuu = T with 0 1, 1 k ukkM and jM Q is a M dim structure that collect the local control points of the j th basis function: 1 1 ( 1] 1) j n j n n j n Q Q = Q ; 12 12 12 ....

Foley J.A. and Van Dam A., "Fundamentals of Interactive Computer Graphics", Addison-Wesley, ISBN 0201 -14468-9, 1982.

....are of compatible color categories. 1. Mapping pixels to categories: This is done by a simple indexing of the colorlook up table by the color of the pixel specified in terms of its hue, saturation, and brightness components. These components can be derived from the specific color as described in [9]. This step takes time = O(N) where N is the size of the image. 2. Grouping pixels of same category. The image is divided into small non overlapping bins of fixed size ( say, 8x8) and the color categories found in the bins are recorded. The size of the bin can be chosen based on expectations ....

J.D. Foley and A. Van Dam, Fundamentals of Interactive Computer Graphics, Reading: Addison Wesley, 1984.

....are of compatible color categories. 1. Mapping pixels to categories: This is done by a simple indexing of the colorlook up table by the color of the pixel specified in terms of its hue, saturation, and brightness components. These components can be derived from the specific color as described in [9]. This step takes time = O(N) where N is the size of the image. 2. Grouping pixels of same category: The image is divided into small non overlapping bins of fixed size ( say, 8x8) and the color categories found in the bins are recorded. The size of the bin can be chosen based on expectations ....

J.D. Foley and A. Van Dam, Fundamentals of Interactive Computer Graphics, Reading: Addison Wesley, 1984.

....mean convex polyhedron. 3.4.1 A Modified Cyrus Beck Algorithm Given two convex polyhedra P and Q, the idea is to clip P by Q and vice versa. As in Section 3.2, it is not sufficient to clip only P by Q, see Figure 3.3. Since both of them are convex, the Cyrus Beck algorithm can be used [FvDFH90] which will be modified to take advantage of the special situation. The Cyrus Beck algorithm works as follows: The polyhedron is represented by the intersection of half spaces, which are defined by the polygons of the object. An edge is represented by its parametric form. H : x Gamma p)n 0 ....

J. D. Foley, A. van Dam, and Steven K. Feiner, and John F. Hughes. Fundamentals of Interactive Computer Graphics. Addison-Wesley Publishing Company, second edition, 1990.

....one attribute (the region pixel count) was deleted since it is constant (value 9) for the data set. This data set originally came from the UCI collection [143] The algorithm for the 3 d non linear transformations of value mean, saturation mean and hue mean can be found in Foley and van Dam A. [55]. a examples. There is a common test set of . examples in each case. The test set selection method is common. x box u horizontal position of box y box u vertical position of box width u width of box high u height of box onpix u total on pixels x bar u ....

Foley, J. and van Dam A. [1982], Fundamentals of interactive computer graphics, Addison-Wesley, London. BIBLIOGRAPHY 183

No context found.

J. Foley, A. Van Dam, "Fundamentals of Interactive Computer Graphics", Addison-Wesley, 1984, 1st edition.

No context found.

J. D. Foley and A. Van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley Publishing Company, Reading, MA, pp. 523-537 (1982).

No context found.

D. Foley, A. Van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley, March 1983.

No context found.

James D. Foley, Andries van Dam, Fundamentals of Interactive Computer Graphics,

No context found.

J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes. Fundamentals of Interactive Computer Graphics, page 584. Addison-Wesley Publishing Company, second edition, 1990.

No context found.

J.A. Foley and A. Van Dam. Fundamentals of Interactive Computer Graphics. Addison-Wesley, 1982.

No context found.

J.A. Foley and A. Van Dam. Fundamentals of Interactive Computer Graphics. Addison-Wesley, 1982.

No context found.

Foley, J. D., and Van Dam, A. Fundamentals of Interactive Computer Graphics, second ed. Addison-Wesley Publishing Company, Reading, Massachusetts, 1990.

No context found.

J.D. Foley, A. van Dam , Fundamentals of Interactive Computer Graphics (Reading, Mass, Addison Wesley, 1982)

No context found.

Foley, J., Van Dam, A, Fundamentals of Interactive Computer Graphics, Reading, MA: AddisonWesley, 1982.

No context found.

J. D. Foley and A. Van Dam, "Fundamentals of Interactive Computer Graphics", Addison-Wesley, 1982. A Format for a Graphical Communication Protocol

No context found.

J. D. Foley and A. van Dam. Fundamentals of Interactive Computer Graphics. Addison-Wesley, 1982.

No context found.

James D. Foley, Andries van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley, Reading, MA, 1982.

No context found.

James D. Foley, Andries van Dam, Steven K. Feiner, and John F. Hughes. Fundamentals of Interactive Computer Graphics. The Systems Programming Series. Addison-Wesley, Reading, MA, USA, second edition, 1990.

No context found.

J.D. Foley and A. van Dam, Fundamentals of Interactive Computer Graphics, Addison-Wesley Systems Programming Series, Addison-Wesley, Reading, MA, 1982.

No context found.

Foley, J. D., van Dam, A., Fundamentals of Interactive Computer Graphics, Reading, MA: Addison-Wesley, 1982.

First 50 documents  Next 50

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