ABSTRACT
This chapter presents a generic approach for the dynamization of an arbitrary static geometric data structure. A simple static data structure may be sufficient when the set of represented geometric objects will have only few changes over time. Once created, the static structure mostly has to cope with data queries due to its geometric intention. Efficient data queries are the main feature of geometric data structures. Many geometric data structures support range queries. The problem of dynamization arises if object sets change over time. The chapter provides an example of a static kd-tree implementation and discusses the methods of generic dynamization explicitly. The dynamization technique is explained in detail, and the amortized cost complexities of the new dynamic operations are also shown.
