zur Publikation »
zurück »
Algorithms & Data Structures
zur Publikation »
zurück »
Algorithms & Data Structures
Preface
Part I: Programming environments for motion, graphics, and geometry
1 Reducing a task to given primitives: Programming motionPart II: Programming concepts: Beyond notation
2 Graphics primitives and environments
3 Algorithm animation
4 Algorithms and programs as literature: Substance and formPart III: Objects, algorithms, programs
5 Divide-and-conquer and recursion
6 Syntax
7 Syntax analysis
8 Truth values, the data type "set", anf bit acrobaticsPart IV: Complexity of problems and algorithms
9 Ordered sets
10 Strings
11 Matrices and graphs: transitive closure
12 Integers
13 reals
14 straight lines and circles
15 Computabiliy and complexityPart V: Data structures
16 The mathematics of algorithm analysis
17 Sorting and its complexity
18 What is data structure?Part VI: Interaction between algorithms and data structures: Case studies in geometric computation
19 Abstract data types
20 Implicit data strutures
21 List structures
22 Address computation
23 Metric data structures
24 Sample problems and algorithmsReferences
25 Plane-sweep: A general-purpose algorithm for two-dimensional problems illustrated using line segment intesection
26 The closest pair problem
Index