Related Experiment Video
Updated: Jun 19, 2026

06:25
Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
Published on: February 12, 2014
Kd-Jump: a path-preserving stackless traversal for faster isosurface raytracing on GPUs
1School of Computer Science, Bangor University, UK. meirion@bangor.ac.uk
IEEE Transactions on Visualization and Computer Graphics
|October 17, 2009
Summary
Stackless traversal techniques like Kd-Jump offer significant performance gains on modern hardware. This novel approach for implicit kd-trees avoids memory bottlenecks, outperforming traditional methods.
Area of Science:
- Computer Science
- Graphics and Visualization
Background:
- Stackless traversal methods aim to reduce memory usage by replacing stack-based recursion with iterative computation.
- Evaluating the efficacy of these techniques on contemporary hardware, such as CUDA-enabled systems, is crucial for performance optimization.
Purpose of the Study:
- To investigate the applicability and performance of stackless traversal on modern hardware.
- To introduce a novel stackless approach for implicit kd-trees named Kd-Jump.
Main Methods:
- Developed Kd-Jump, a stackless traversal method for implicit kd-trees that uses index-based node traversal.
- Kd-Jump avoids global memory requirements, utilizing a small, fast constant-memory matrix.
- Introduced Hybrid Kd-Jump, combining Kd-Jump with a volume stepper and a dynamic depth threshold.
Main Results:
- Kd-Jump demonstrated a 10-20% performance improvement over stack-based traversal.
- Kd-Jump significantly outperformed the kd-restart method by 100%.
- Hybrid Kd-Jump leverages benefits like empty space removal and efficient texture caching.
Conclusions:
- Stackless traversal, specifically Kd-Jump, is highly effective on modern hardware like CUDA.
- The proposed Hybrid Kd-Jump offers a flexible and efficient approach for real-time rendering and isosurface extraction.
Related Concept Videos
Tangent Planes to Level Surfaces
A level surface consists of all points in space where a function of three variables takes the same fixed value. If a point lies on this surface, understanding the surface’s geometry there requires more than just knowing the point’s coordinates; it requires describing how the surface is oriented, or how it tilts, near that point.To probe this local geometry, imagine tracing a path that stays entirely on the level surface and passes through the point of interest. This path can be described as a...
Tangent Planes to Surfaces
In multivariable calculus, the concept of a tangent plane plays a central role in approximating curved surfaces. When dealing with a surface defined by a function of two variables, such as z = f(x, y), the tangent plane at a given point provides the best linear approximation to the surface near that point. This local linearization allows complex, nonlinear geometries to be treated using simpler, planar models.The construction of the tangent plane involves taking vertical slices of the surface...
Orthogonal Trajectories
Orthogonal trajectories describe the geometric relationship between two families of curves that intersect each other at right angles. One illustrative case involves a family of parabolas that open sideways along the x-axis. These curves share a common shape but differ by a scaling parameter, resulting in a set of curves that all pass through the origin and widen at different rates.Determining Orthogonal TrajectoriesTo identify the orthogonal trajectories for these parabolas, the first step...
Design Example: Traverse Angle Computations
Traverse angle computations are a critical component of surveying, used to compute the internal angles within a closed traverse. A traverse consists of a series of connected lines forming a closed loop, often used for land boundary delineation or mapping. Calculating the internal angles ensures accuracy in the traverse geometry and is essential for checking survey data integrity.The process begins with known azimuths and bearings of the traverse sides. Internal angles at each vertex are...
Quadric Surfaces
Quadric surfaces are three-dimensional surfaces characterized by second-degree equations in the variables x, y, and z. These surfaces are smooth and continuous, and specific combinations of squared and linear terms define their shapes. The main types of quadric surfaces include ellipsoids, cones, paraboloids, and hyperboloids. Each type exhibits distinct geometric features depending on how the variables are arranged and related within the equation.Ellipsoids are closed surfaces formed when all...
Divergence Theorem in 3D Space
In vector calculus, flux measures the total flow of a vector field through a surface. For a closed surface in three-dimensional space, this means measuring how much of the field passes outward through every point on the boundary. Directly calculating this flux can be difficult when the surface has a complicated or irregular shape. The Divergence Theorem provides a powerful alternative by relating surface flux to behavior inside the enclosed region.The Divergence Theorem states that the outward...

