Computational Geometry: Algorithms and Applications (de Berg et al.)
16 courses · 1235 flashcards · by lakesare
- Ch.1: Introduction · 61 flashcards
- Ch.2: Line Segment Intersection · 85 flashcards
- Ch.3: Polygon Triangulation · 74 flashcards
- Ch.4: Linear Programming · 110 flashcards
- Ch.5: Orthogonal Range Searching · 83 flashcards
- Ch.6: Point Location · 84 flashcards
- Ch.7: Voronoi Diagrams · 98 flashcards
- Ch.8: Arrangements and Duality · 66 flashcards
- Ch.9: Delaunay Triangulations · 85 flashcards
- Ch.10: More Geometric Data Structures · 79 flashcards
- Ch.11: Convex Hulls · 70 flashcards
- Ch.12: Binary Space Partitions · 82 flashcards
- Ch.13: Robot Motion Planning · 92 flashcards
- Ch.14: Quadtrees · 55 flashcards
- Ch.15: Visibility Graphs · 41 flashcards
- Ch.16: Simplex Range Searching · 70 flashcards