Computational Geometry
계산기하학의 주요 알고리즘과 자료구조에 관한 내용을 장별로 정리합니다.
목차
- Computational Geometry
- Line Segment Intersection
- Polygon Triangulation
- Linear Programming
- Orthogonal Range Searching
- Point Location
- Voronoi Diagrams
- Arrangements and Duality
- Delaunay Triangulations
- More Geometric Data Structures
- Convex Hulls
- Binary Space Partitions
- Robot Motion Planning
- Quadtrees
- Visibility Graphs
- Simplex Range Searching