230246_清华大学邓俊辉教授《计算几何》- 学堂在线精品课程网盘资源 | 影盘社

file:#1.2.1#-html.pdf
file:#1.1.1#-html[优质合集‖免费获取:cunlove.cn].pdf
file:[1.6.1]-00-A. History of This Course.mp4
file:[1.9.1]-00-D. Why English.srt
file:[1.9.1]-00-D. Why English[耗时整理‖免费分享:cunlove.cn].mp4
file:[1.8.1]-00-C. How to Learn CG Better.mp4
file:[1.7.1]-00-B. What's Computational Geome.mp4
file:[6.9.1]-05-I-01. Idea.mp4
file:[6.9.6]-05-I-06. Convergence.srt
file:[6.9.2]-05-I-02. Point Location[持续更新‖免费提供:cunlove.cn].mp4
file:[6.7.1]-05-G-01. Definition.srt
file:[6.7.1]-05-G-01. Definition[整理不易‖记得关注:CunWorkNotes].mp4
file:[6.11.7]-05-K-07. Number Of Rebucketings.mp4
file:[6.11.8]-05-K-08. Probability For Rebucke[资源精选‖更多关注:CunWorkNotes].mp4
file:[6.11.2]-05-K-02. Backward Analysis.srt
file:[6.11.10]-05-K-10. Further Consideration.srt
file:[6.11.4]-05-K-04. Types Of Edge Change.srt
file:[6.5.3]-05-E-03. Subgraph of RNG.mp4
file:[6.8.3]-05-H-03. Maximizing The Minimu.mp4
file:[6.8.4]-05-H-04. Evolution By Edge Fli.srt
file:[6.4.2]-05-D-02. Relative Neighborhood G.srt
file:[6.3.2]-05-C-02. Empty Circle.mp4
file:[6.10.2]-05-J-02. Iterative Implementatio.srt
file:[6.10.4]-05-J-04. Point Location.mp4
folder:230246_清华大学邓俊辉教授《计算几何》- 学堂在线精品课程
folder:{1}-00 Introduction
folder:{6}-05 Delaunay Triangulation
folder:{3}-02 Geometric Intersection
folder:{5}-04 Voronoi Diagram
folder:{9}-08 Windowing Query
folder:{2}-01 Convex Hull
folder:{2}-Evaluation
folder:{3}-Online Judge
folder:{1}-Before we start
folder:{9}-D Why English
folder:{4}-Lecture notes
folder:{9}-I RIC With Example
folder:{11}-K RIC Analysis
folder:{5}-E Euclidean Minimum Spanning Tre
folder:{4}-D Proximity Graph
folder:{3}-C Properties
folder:{10}-J Randomized Incremental Constru
folder:{4}-C Segment Intersection Reporting
folder:{6}-E BO Algorithm Implementation
folder:{9}-H Edge Chasing
folder:{10}-I Plane Sweeping
folder:{8}-G Convex Polygon Intersection De
folder:{4}-C Fisk's Proof
folder:{9}-I Tetrahedralization
folder:{5}-D Orthogonal Polygons
folder:{7}-F Triangulating Monotone Polygon
folder:{8}-G Monotone Decomposition
folder:{2}-A Art Gallery Problem
folder:{11}-K Incremental Construction
folder:{4}-D Complexity
folder:{2}-B Terminologies
folder:{6}-F DCEL
folder:{12}-L Divide-And-Conquer
folder:{8}-H Sorted Sets
folder:{11}-K Vertical Segment Stabbing Quer
folder:{7}-G 1D-GRQ Using Heap
folder:{10}-J Segment Tree
folder:{5}-E Stabbing With A Segment
folder:{8}-H Priority Search Tree
folder:{4}-D Interval Tree Query
folder:{5}-E kd-Tree Performance
folder:{6}-F Range Tree Structure
folder:{2}-B Extreme Points
folder:{7}-G Graham Scan Algorithm
folder:{5}-E Jarvis March
folder:{6}-F Lower Bound
folder:{13}-M Wrap-Up
folder:{11}-J Performance Of Trapezoidal Map
folder:{4}-C Persistence
folder:{7}-F Limited Node Copying
folder:{9}-H Trapezoidal Map
folder:{3}-B Slab Method
folder:{1}-0 OnlineOffline Algorithms

分享时间

2025-10-20

入库时间

2025-10-23

资源类型

夸克网盘

分享用户

23*跑的蜜饯

230246_清华大学邓俊辉教授《计算几何》- 学堂在线精品课程网盘资源 | 影盘社

扫码获取资源

进入网盘

分享资源