The botheration of apprehension 3D cartoon can be conceptually presented as award all intersections amid a set of "primitives" (typically triangles or polygons) and a set of "rays" (typically one or added per pixel).1
Up to 2010 all archetypal clear dispatch boards, alleged cartoon processing units (GPUs), use rasterization algorithms. The ray archetype algorithm solves the apprehension botheration in a altered way. In anniversary step, it finds all intersections of a ray with a set of accordant primitives of the scene.
Both approaches accept their own allowances and drawbacks. Rasterization can be performed application accessories based on a beck accretion model, one triangle at the time, and admission to the complete arena is bare alone once.note 1 The check of rasterization is that non-local effects, appropriate for an authentic simulation of a scene, such as reflections and caliginosity are difficult; and refractions2 abreast absurd to compute.
The ray archetype algorithm is inherently acceptable for ascent by parallelization of alone ray renders.3 However annihilation added than ray casting requires recursion of the ray archetype algorithm (and accidental admission to the arena graph) to complete their analysis,4 back reflected, refracted, and broadcast application crave that assorted genitalia of the arena be re-accessed in a way not calmly predicted. But it can calmly compute assorted kinds of physically actual effects, accouterment abundant added astute consequence than rasterization.note 2
Whilst the complication of the ciphering for rasterization scales linearly with cardinal of triangles5note 3 the complication of a appropriately implemented ray archetype algorithm scales logarithmically;note 4 this is due to altar (triangles and collections of triangles) actuality placed into BSP copse or agnate structures, and alone actuality analyzed if a ray intersects with the bonds aggregate of the bifold amplitude partition
Up to 2010 all archetypal clear dispatch boards, alleged cartoon processing units (GPUs), use rasterization algorithms. The ray archetype algorithm solves the apprehension botheration in a altered way. In anniversary step, it finds all intersections of a ray with a set of accordant primitives of the scene.
Both approaches accept their own allowances and drawbacks. Rasterization can be performed application accessories based on a beck accretion model, one triangle at the time, and admission to the complete arena is bare alone once.note 1 The check of rasterization is that non-local effects, appropriate for an authentic simulation of a scene, such as reflections and caliginosity are difficult; and refractions2 abreast absurd to compute.
The ray archetype algorithm is inherently acceptable for ascent by parallelization of alone ray renders.3 However annihilation added than ray casting requires recursion of the ray archetype algorithm (and accidental admission to the arena graph) to complete their analysis,4 back reflected, refracted, and broadcast application crave that assorted genitalia of the arena be re-accessed in a way not calmly predicted. But it can calmly compute assorted kinds of physically actual effects, accouterment abundant added astute consequence than rasterization.note 2
Whilst the complication of the ciphering for rasterization scales linearly with cardinal of triangles5note 3 the complication of a appropriately implemented ray archetype algorithm scales logarithmically;note 4 this is due to altar (triangles and collections of triangles) actuality placed into BSP copse or agnate structures, and alone actuality analyzed if a ray intersects with the bonds aggregate of the bifold amplitude partition
No comments:
Post a Comment