Skip to Main Content
An example is given of the use of lazy evaluation in computational geometry. Objects represented by quadtrees are computed only to the extent to which they are needed. A modified version of the data structure for quadtrees which allows for lazy evaluation is given. Algorithms for operations on these modified quadtrees are presented, and some of the results obtained in practice are shown.