/ Home / science / physics / 24._Scientific_Computing / 21._Computational_Geometry /
21. Computational Geometry21.0 Introduction . . 1097 21.1 Points and Boxes 1099 21.2 KD Trees and Nearest-Neighbor Finding . . 1101 21.3 Triangles in Two and Three Dimensions . . 1111 21.4 Lines, Line Segments, and Polygons . 1117 21.5 Spheres and Rotations 1128 21.6 Triangulation and Delaunay Triangulation . 1131 21.7 Applications of Delaunay Triangulation 1141 21.8 Quadtrees and Octrees: Storing Geometrical Objects 1149 Author: Danny (remove the ".nospam" to send) Last modification on: Wed, 15 Jul 2026 . |