SarKerson的博客

Delaunay 2D算法整个算法的流程如下所示：Incremental Delaunay Triangulation. 1 Construct an initial triangle, which is large. 2 Randomly generate a point p in the unit square. 3 InsertVertex(p). 4 Repe

凸包算法首先介绍一下整个算法的流程：Initialize all points’ state to UNVISITED, and an empty convex hull H;Mark three outmost unvisited points v0,v1,v2 with state VISITED, and put them in H with CCW;while(#UNVISITED po

Gauss–Bonnet theorem简介假设M是一个紧的二维黎曼流形，∂M是其边界。令K为M的高斯曲率，Kg为∂M的测地曲率。假设M是一个紧的二维黎曼流形，\partial M是其边界。令K为M的高斯曲率，K_g为\partial M的测地曲率。 则有，∫MKdA+∫∂MKgds=2πχ(M)则有，\\\int_MKdA+\int_{\partial M}K_gds=2\pi \chi(M)