D. S. Fussell and K. R. Subramanian. Fast ray tracing using K-d trees. Technical Report CS-TR-88-07, 1, 1988. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hierarchical Techniques for Visibility Determination - Bittner (1999) (Correct)
....data structures, that allow efficient determination of objects that can be possibly pierced by a given ray. The goal is to minimise the number of ray object intersection tests. Examples of such structures are uniform grids [64] bounding volume hierarchies [73] octrees [144, 132] kD trees [67, 115, 176], irregular grids [157] or hierarchies of sorted lists [61] Recently, hierarchical grids have been introduced [25, 26, 102] Hybrid approaches combining several hierarchical structures were 5 proposed in [174, 175] Methods that are based on subdivision of line space [131] or ray space) ....
D. Fussell and K. R. Subramanian. Fast ray tracing using K-D trees. Technical Report TR-88-07, U. of Texas, Austin, Dept. Of Computer Science, Mar. 1988.
Interactive Ray Tracing of VRML Scenes in Java - Glazer (Correct)
....is recursively subdivided into eight child nodes of equal size. The recursion ends when a node contains some minimum number of objects. This structure is easy to construct and to use because all nodes at a given depth in the tree are of equal size. Another commonly used structure is the k d tree [7][17] This spatial subdivision tree is built by splitting space with a single axial plane at each node, resulting in two children. The attractive aspect of the k d tree is that the location of each splitting plane can be determined by arbitrary criteria. For instance, the location may be chosen to ....
Fussell, Donald S., and Subramanian, K. R., "Fast Ray Tracing Using K-d Trees," Technical Report, University of Texas, Austin, Number CS-TR-88-07, March 1, 1988.
A Ray Tracing Accelerator Based on a Hierarchy of 1D Sorted.. - Fournier, Poulin (1993) (3 citations) (Correct)
....less sensitive to the problems of uniform space subdivision. Unfortunately, traversing a non uniform structure is more expensive than traversing a regular grid. Various non uniform subdivisions have been used, including irregular grids [giga88] octrees [glas84] BSP trees [kapl85] and k d trees [fuss88]. Snyder and Barr [snyd87] propose a technique that can be used along with most of these techniques. They surround each ray by a box to check against the bounding volumes of the objects to intersect. Some researchers have also proposed to use combinations of uniform and non uniform subdivisions ....
Donald Fussell and K.R. Subramanian. "Fast Ray Tracing Using K-D Trees". Technical Report TR-88-07, U. of Texas, Austin, Dept. Of Computer Science, March 1988.
Applying Space Subdivision Techniques to Volume Rendering - Subramanian, Fussell (1990) (12 citations) Self-citation (Fussell Subramanian) (Correct)
....to identify a set of interesting voxels which can constitute a surface. After this initial step, we are left with clumps of interesting voxels distributed throughout the original volume. We incorporate this data into a k d tree, which we build using a median cut space partitioning scheme [10][14] with bounding volumes in the interior nodes of the hierarchy. Interesting voxels are recursively partitioned by axis aligned planes along their medians, resulting in a balanced binary tree. Bounding volumes are computed at nodes of the hierarchy to help in reducing void space created by the ....
Donald Fussell and K.R.Subramanian. Fast ray tracing using k-d trees. Technical Report TR88 -07, Department of Computer Sciences, The University of Texas at Austin, March 1988.
Factors Affecting Performance of Ray Tracing Hierarchies - Subramanian, Fussell (1990) (2 citations) Self-citation (Fussell Subramanian) (Correct)
.... Structures Used in Ray Tracing Some of the common hierarchical structures being used in ray tracing include BSP trees [15] octrees [10] and the surface area based heuristic described in [18] In addition to these, we consider a hierarchical technique related to the first two which uses k d trees [9][17] We begin with a brief description of each of these methods. A BSP tree is any binary tree structure used to recursively partition space. BSP trees have been used extensively to determine visible surfaces [22] 6] 7] In Kaplan s [15] implementation of the BSP tree for ray tracing, axis aligned ....
....of the BSP tree. The difference lies in the way Glassner stores the octree. While Kaplan builds a binary tree, Glassner uses a hash table with link lists, which results in considerable savings in pointer space. The traversal is also identical to the BSP tree. The k d tree [2] 3] hierarchy used in [9] is another special case of the BSP tree. It also uses axis aligned partitioning planes, but it has greater flexibility in their location as well as the choice of the partitioning dimension. The initial node is simply the scene extents. Nodes are partitioned by planes whose locations are chosen by ....
[Article contains additional citation context not shown here]
Donald Fussell and K.R.Subramanian. Fast ray tracing using k-d trees. Technical Report TR-88-07, Department of Computer Sciences, The University of Texas at Austin, March 1988.
Wave Propagation Using the Photon Path Map - Arne Schmitz Ahornstr (2006) (Correct)
No context found.
D. S. Fussell and K. R. Subramanian. Fast ray tracing using K-d trees. Technical Report CS-TR-88-07, 1, 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