Chapter 8. Data Structures and Algorithms for Moving Objects Types

In this chapter, based on the discrete model described in Section 8.3, we develop data structures for its data types as well as algorithms for a selected collection of its operations. In the design of operations in the abstract model (Section 8.2), all operations have been defined to be applicable to all combinations of argument types for which they could make any sense for the user (i.e., they are overloaded). This leads to a large set of functionalities for operations. At the implementation level, the number of algorithms for the operations increases, because it is not always the case that different argument types for one overloaded operation can be handled by the same algorithm. ...

Get Data Mining: Know It All now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.