ABSTRACT
This chapter demonstrates several applications of data structures to image and graphics processing operations. It discusses three applications that are useful in the industries: R trees for searching objects in maps; KD trees for optimizing computations in geographic information systems (GIS); and ray shooting for graphics rendering. The chapter addresses computer graphics applications of R trees, KD trees and octrees. Map search Nearest neighbor and certain other searches involve degree measurements and parallelograms. R trees provide spatial information by calculating geographical coordinates and geometric structures. GISs store large amounts of data and require secondary memories to store excess data. The initial camera is tested for intersections with three-dimensional visuals containing triangles and other graphics primitives. Radiation due to defraction can be used to tilt light to focus on transparent surfaces. The process is called transmission. KD tree construction starts with placing a box around a scene. If the box contains many primitives, other systems would divide into octets.
