Introduction to Algorithms
UndergraduateCore topics include sorting, binary search trees, red-black trees, dynamic programming, greedy algorithms, graph algorithms, linear programming and string matching. Advanced examples connect algorithmic thinking with graph-cut texture synthesis and surface registration.
涵盖排序、二叉搜索树、红黑树、动态规划、贪心算法、图算法、线性规划和字符串匹配,并通过基于图割的纹理合成、曲面配准等专题展示算法思想在视觉与图形学中的应用。