John Amanatides. Ray tracing with cones. ACM Computer Graphics, SIGGRAPH'84 Proceedings, 18(3):129--135, July 1984.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....schemes that were devised over the years [4] In particular, Haines [6] describes an approach, referred to as the light buffer, specifically to accelerate the casting of shadow rays. There were also a few alternative approaches to shadow ray casting, such as casting beams [9] and cones [1], but these approaches are not as general as ray casting, since they impose limiting assumptions on the geometry of the objects in the scene. Radiosity and other finite element based global illumination methods typically perform very large amounts of point to area and area to area form factor ....

J. Amanatides. Ray tracing with cones. Computer Graphics, 18(3):129--135, July 1984.

....image signal will have the same probability distribution for any set of sampling positions [18] This argument applies to quasirandom samples (such as samples from a Halton sequence [15] as well. An alternative are methods that trace extended ray volumes such as cone tracing or beam tracing [3, 10, 11, 16, 25]. These methods do not shoot infinitesimally small rays into the scene but larger cones with a crosssection corresponding to a pixel in the image. These techniques render anti aliased images using only one ray per pixel. However, they suffer from a different kind of complexity problem: In a highly ....

....at no additional costs. In images with high variance areas such as softshadow areas or models with high frequency texture, the new technique is much faster than the distributed raytracer and guarantees images without noise artifacts. 2 Related Work Cone beam tracing techniques: Cone tracing [3, 16] calculates the interaction of ray cones through each pixel with the scene geometry. The technique is able to render antialiased images and to approximate effects such as soft shadows and blurry reflections. Beam tracing [10, 11] starts with the view frustum as initial beam and successively clips ....

[Article contains additional citation context not shown here]

Amanatides, J. Ray Tracing with Cones. In: SIGGRAPH 84 Proceedings, 18(3), 129-135, 1984.

....the benefit of beam tracing is that it takes advantage of spatial coherence, as each beam surface intersection represents an infinite number of ray surface intersections. Polyhedral beam tracing does not suffer from sampling artifacts of ray tracing [76] or the overlap problems of cone tracing [3, 126], since the entire 2D space of directions leaving the source can be covered by beams exactly. As a result, beam tracing can enumerate all potential propagation paths up to some termination criteria without risk of missing any. This feature is particularly important for modeling diffraction [123] ....

John Amanatides. Ray tracing with cones. ACM Computer Graphics, SIGGRAPH'84 Proceedings, 18(3):129--135, July 1984.

....of a path by tracking some kind of footprint. In beam tracing [7] a ray is extended to a beam with a polygonal footprint. Intersections with and reflection from objects (polygonal only) fragment the beam in smaller pieces. Lighting calculations can be done coherently over the beam. Cone tracing [1] uses a conical approximation of the footprint. Both approaches allow antialiased textures by filtering over the footprint. Cone tracing allows ad hoc dull or glossy reflections by explicitly increasing the cone angle. Another approach, pencil tracing [13] propagates a bundle of paraxial rays ....

John Amanatides. Ray tracing with cones. Computer Graphics, 18(3):129--135, July 1984.

....these algorithms are prone to aliasing or noise. The common solution is supersampling, averaging the evaluation of many paths. This is expensive, and researchers have tried to exploit coherence in the neighborhood of the rays to reduce aliasing or noise. Beam tracing [6] Cone tracing [1] and pencil tracing [11] all extend a ray to a finite width. Lighting calculations can be done coherently over the extent of the ray, but intersection, reflection and refraction calculations are much more difficult. The combination of physically based BRDF s with these methods is a difficult ....

John Amanatides. Ray tracing with cones. Computer Graphics, 18(3):129--135, July 1984.

....can only support constant shaded polygons and box filtering, and is not entirely successful at removing aliasing artifacts. By scaling the filter, Catmull could approximate motion blur but without proper interpenetration or occlusion. Extensions of area sampling include beam [11] and cone sampling [1], which are generalizations of ray tracing. Duff [5] extended Catmull s approach by replacing the area computation with a contour integral. He also describes several optimizations that exploit the coherence of scan conversion. In theory, Duff s technique can handle any filter function and any ....

....subspace given by all points y such that n i y) 0. Let z be any point that satisfies x = #z with x . Then m)MB (x #) s i=1 n i z)MB i (x # # i ) Here # # i is a projection of # to the plane of i . Box splines are projections of the unit hypercube n = i=1 [0, 1]; they have the following property, which is reminiscent of the recursive convolutional definition of the uniform univariate B splines: M 0 (x) #(x) M n (x #) M n 1 (x ##n # #n ) d#. Here # #n refers to the removal of the column vector #n from #. The column vectors # i of the ....

[Article contains additional citation context not shown here]

Amanatides, John. Ray Tracing with Cones. Computer Graphics (SIGGRAPH '84 Proceedings), 18(3):129-- 135, July 1984.

....computation, path finding operation is much more expensive. Therefore, many ray tracing acceleration techniques have concentrated on reducing the cost of ray casting by exploiting various kinds of coherence between rays. This has been done by casting bundles of rays, such as beams [41] and cones [3]; employing a fixed grid [32] or adaptive 3D spatial hierarchy of scene objects [34] and directional techniques [6] A good summary of these techniques can be found in Arvo and Kirk [7] Besides the above techniques used to accelerate the generation of a single ray traced image, some researchers ....

John Amanatides. Ray tracing with cones. Computer Graphics, 18(3):129--135, July 1984.

....incident edges and vertices will tend to intersect each other at nearby points, or miss each other outright, resulting in erroneous angular spans. Also, nearly parallel edges can result in extraneous apparent intersections. We solve the conjunctive vertex problem using a variant of cone tracing [1]. Rather than tracing a ray through a vertex, a thin cone is traced instead. All faces, edges and vertices which intersect the cone are snapped to the axis, forming an approximate conjunctive vertex (Figure 6) Cone tracing is of course more expensive than ordinary ray tracing. However, a second ....

John Amanatides. Ray tracing with cones. In Hank Christiansen, editor, Computer Graphics (SIGGRAPH '84 Proceedings), volume 18, pages 129--135, July 1984.

....second one on a recursive space subdivision [Glass89b] the aim of these methodologies is to avoid expensive and unnecessary tests. Image coherence assumes that neighboring pixels may have very similar colors since just a few objects affect a small portion of image. This property is employed in [Amana84a] to reduce the number of objects to be considered for intersection with a cone traced from the observer. Moreover, it is very likely that rays with similar origin and direction have the same behavior; this similarity, called ray coherence, may be used to classify the rays. In [Arvo87a] and ....

J. Amanatides, Ray Tracing with Cones, ACM Computer Graphics (Proc. SIGGRAPH), Vol. 18, No. 3, July 1984, pp. 129-135.

....3.1. First Algorithm (COCL Algorithm) In rendering shadows of an object, the shape and size of its umbral and penumbral regions vary according to the shape and size and position of a given light source and the object. Usually, a complicated algorithm is required to render general penumbrae[6, 7, 5, 3, 8, 11]. However, if the light source and the object are located at particular positions and both have particular shapes, a simple algorithm is sufficient to compute the geometry of umbral and penumbral regions. For example, if an object is a flat circular saucer and placed horizontally to a projection ....

J. Amanatides. Ray tracing with cones. In Computer Graphics (Proc. of the SIGGRAPH '84), volume 18, pages 129--135, July 1984.

....The primary advantage of beam tracing is that it leverages geometric coherence, since each beam represents an infinite number of potential ray paths emanating from the source location. It does not suffer from the sampling artifacts of ray tracing [26] nor the overlap problems of cone tracing [42, 43], since the entire space of directions leaving the source can be covered by beams exactly. The disadvantage is that the geometric operations required to trace beams through a 3D model (i.e. intersection and clipping) are relatively complex, as each beam may be reflected and or 7 obstructed by ....

John Amanatides. Ray tracing with cones. ACM Computer Graphics, SIGGRAPH'84 Proceedings, 18(3):129--135, July 1984.

....eliminates the problem under all circumstances. Perhaps even higher quality can be achieve at lower cost by analytically computing the intersection of a space time hypercone with the moving objects in a scene. This could be accomplished using a multi dimensional expansion of cone tracing [1]. We would advise developers of computer animation systems to implement higher degree temporal filtering, for it improves the general quality of animations. However, the extra time required to render with this filter can be large, thus it is best reserved as an option for high end, production ....

J. Amanatides. Ray tracing with cones. Computer Graphics (SIGGRAPH '84 Proceedings), 18(3):129--135, July 1984.

....The better solution would be to provide two versions of the low resolution dataset, one showing just the wall and one showing the ball and the wall. 2. 4 Volumetric Global Illumination Ray tracing has evolved to include higher order effects such as diffuse inter reflections between surfaces [72, 1] and even motion blur and depth of field effects [12] Ray tracing was extended to include the interaction of light with volume densities [30, 67] Kajiya and Von Herzen [30] accounted for the diffuse inter reflections caused by multiple scattering of light through the volume and shadows cast by ....

J. Amanatides. Ray tracing with cones. In Computer Graphics (SIGGRAPH '84 Proceedings), volume 18, pages 129--135, July 1984.

....likely to intersect the same objects. This is also true for shadow rays that are sent towards area light sources. Restricting ourselves for the moment to primary rays, a common technique to trace a number of rays together, is by replacing them by a generalised ray [12] Examples are cone tracing [16], beam tracing [17] 18] and pencil tracing [19] A slightly different method is presented here, consisting of two steps. First, the primary rays are bundled together to form pyramids. These are then intersected with a spatial subdivision. The result of this pyramid traversal is a clip list, ....

J. Amanatides, Ray tracing with cones, ACM Computer Graphics 18(3), 129-- 135, (1984).

No context found.

Amanatides, J., "Ray Tracing with Cones," Computer Graphics, 18(3), pp. 129-135 (July 1984).

.... Fall 2001 References University of Waterloo Department of Computer Science Instructor: Michael McCool August 27, 2001 CS488 688 F01 General References References [1] Kurt Akeley and Tom Jermoluk. High performance polygon rendering. Computer Graphics (SIGGRAPH) 22(4) 239 246, August 1988. 2] Kurt X. Akeley and Tom Jermoluk. High performance polygon rendering. Computer Graphics (SIGGRAPH) 22(4) 239 246, August 1988. 3] John Amanatides. Ray tracing with ....

John Amanatides. Ray tracing with cones. Computer Graphics, 18(3):129--136, July 1984.

No context found.

John Amanatides. Ray tracing with cones. ACM Computer Graphics, SIGGRAPH'84 Proceedings, 18(3):129--135, July 1984.

No context found.

John Amanatides. Ray Tracing with Cones. In Computer Graphics (Proceedings of ACM SIGGRAPH 84), volume 18, pages 129--135. ACM, July.

No context found.

John Amanatides. Ray Tracing with Cones. In Computer Graphics (Proceedings of ACM SIGGRAPH 84), volume 18, pages 129--135. ACM, July.

No context found.

J. Amanatides. Ray tracing with cones. Computer Graphics, pages 129--135, July 1984. ACM Siggraph '84 Conference Proceedings.

No context found.

J. Amanatides, "Ray tracing with cones", in Proc. SIGGRAPH 1984, pp. 129--135, (1984).

No context found.

Amanatides, J., "Ray Tracing with Cones", Computer Graphics (proceedings of SIGGRAPH), 18(3), July 1984, pp. 129--135.

No context found.

John Amanatides. Ray tracing with cones. ACM Computer Graphics, SIGGRAPH'84 Proceedings, 18(3):129--135, July 1984.

No context found.

John Amanatides. Ray tracing with cones. Computer 18(3). pp. 129--135 (1984).

No context found.

Amanatides, John. "Ray Tracing with Cones." SIGGRAPH '84, p. 129-135. A summary of the same paper appears in Proceedings of Graphics Interface '84, p. 97-98. f58g

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