![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
计算机图形学
文章平均质量分 72
SarKerson
初步计算机图形学
展开
-
Delaunay 2D算法
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原创 2017-10-08 10:38:47 · 1339 阅读 · 0 评论 -
convexHull实现
凸包算法首先介绍一下整个算法的流程: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原创 2017-10-08 09:55:25 · 1346 阅读 · 0 评论 -
检验The Gauss-Bonnet Theorem
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)原创 2017-10-03 12:10:55 · 1251 阅读 · 0 评论