清华大学邓俊辉教授《计算几何》- 学堂在线精品课程 - 酷夫资源搜索-网盘资源搜索神器
- file:[6.3.3]--05-C-03. Nearest Neighbor【更多精选‖ 获取】.mp4
- file:[6.3.4]--05-C-04. Complexity【花费时间‖】.mp4
- file:[6.3.2]--05-C-02. Empty Circle.srt
- file:[6.11.8]--05-K-08. Probability For Rebucke【资源精选‖】.mp4
- file:[6.11.6]--05-K-06. Average Degree【手动整理‖】.mp4
- file:[6.11.10]--05-K-10. Further Consideration【花费时间‖】.mp4
- file:[6.11.5]--05-K-05. Number Of Edge Changes.srt
- file:[6.11.2]--05-K-02. Backward Analysis.srt
- file:[6.11.1]--05-K-01. Time Cost.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.9.2]--05-I-02. Point Location【持续更新‖】.mp4
- file:[6.9.4]--05-I-04. Edge Flipping.mp4
- folder:清华大学邓俊辉教授《计算几何》- 学堂在线精品课程
- folder:{6}--05 Delaunay Triangulation
- folder:{3}--02 Geometric Intersection
- folder:{7}--06 Point Location
- folder:{9}--08 Windowing Query
- folder:{5}--04 Voronoi Diagram
- folder:{2}--01 Convex Hull
- folder:{3}--C Properties
- folder:{11}--K RIC Analysis
- folder:{9}--I RIC With Example
- folder:{6}--F Euclidean Traveling Salesman P
- folder:{4}--D Proximity Graph
- folder:{10}--J Randomized Incremental Constru
- folder:{5}--E Euclidean Minimum Spanning Tre
- folder:{4}--C Fisk's Proof
- folder:{7}--F Triangulating Monotone Polygon
- folder:{8}--G Monotone Decomposition
- folder:{9}--I Tetrahedralization
- folder:{2}--A Art Gallery Problem
- folder:{1}--0 Methodology
- folder:{5}--D Orthogonal Polygons
- folder:{6}--E BO Algorithm Implementation
- folder:{8}--G Convex Polygon Intersection De
- folder:{9}--H Edge Chasing
- folder:{10}--I Plane Sweeping
- folder:{3}--B Interval Intersection Detectio
- folder:{8}--G Kirkpatrick Structure
- folder:{9}--H Trapezoidal Map
- folder:{11}--J Performance Of Trapezoidal Map
- folder:{1}--0 OnlineOffline Algorithms
- folder:{3}--B Slab Method
- folder:{7}--F Limited Node Copying
- folder:{4}--C Persistence
- folder:{9}--I 2D-GRQ Using PST
- folder:{10}--J Segment Tree
- folder:{4}--D Interval Tree Query
- folder:{8}--H Priority Search Tree
- folder:{5}--E Stabbing With A Segment
- folder:{11}--K Vertical Segment Stabbing Quer
- folder:{5}--E kd-Tree Performance
- folder:{2}--B BBST
- folder:{7}--G Hardness
- folder:{12}--L Divide-And-Conquer
- folder:{11}--K Incremental Construction
- folder:{4}--D Complexity
- folder:{9}--I Graham Scan Correctness
- folder:{2}--B Extreme Points
- folder:{6}--F Lower Bound
- folder:{13}--M Wrap-Up
- folder:{9}--D Why English
- folder:{6}--A History of This Course
- folder:{1}--Before we start
- folder:{3}--Online Judge
- folder:{5}--Discussion
- folder:{8}--C How to Learn CG Better
- folder:{7}--B What's Computational Geometry
- folder:{4}--Lecture notes
分享时间 | 2025-10-12 |
---|---|
入库时间 | 2025-10-14 |
状态检测 | 有效 |
资源类型 | QUARK |
分享用户 | 拔刀*助的孔雀 |
资源有问题?
点此举报