文档详情 ID: cmgnjtlzn00bcqsbgpnz8c3yu

清华大学邓俊辉教授《计算几何》- 学堂在线精品课程

文件清单 202 项

#1.2.1#-html.pdf
#1.3.1#-html.pdf
#1.4.1#-html.pdf
#1.5.1#-html.pdf
[1.6.1]-00-A. History of This Course.mp4
[1.7.1]-00-B. What's Computational Geome.mp4
[1.8.1]-00-C. How to Learn CG Better.mp4
[1.9.1]-00-D. Why English[耗时整理‖].mp4
[2.1.1]-01-A-01. Why Convex Hull.mp4

展开全部 202 项

[2.1.1]-01-A-01. Why Convex Hull.srt
[2.1.2]-01-A-02. Nails In The Table.srt
[2.1.2]-01-A-02. Nails In The Table[精挑细选‖].mp4
[2.1.3]-01-A-03. Paint Blending.mp4
[2.1.3]-01-A-03. Paint Blending.srt
[2.1.4]-01-A-04. Color Space.mp4
[2.1.4]-01-A-04. Color Space.srt
[2.1.5]-01-A-05. Convex Hull.mp4
[2.1.5]-01-A-05. Convex Hull.srt
[2.2.1]-01-B-01. Extremity.mp4
[2.2.1]-01-B-01. Extremity.srt
[2.2.2]-01-B-02. Strategy.mp4
[2.2.2]-01-B-02. Strategy.srt
[2.2.3]-01-B-03. In-Triangle Test.srt
[2.2.3]-01-B-03. In-Triangle Test[整理不易‖].mp4
[2.2.4]-01-B-04. To-Left Test.mp4
[2.2.4]-01-B-04. To-Left Test.srt
[2.2.5]-01-B-05. Determinant.mp4
[2.2.5]-01-B-05. Determinant.srt
[2.3.1]-01-C-01. Definition.srt
[2.3.1]-01-C-01. Definition[不易整理‖].mp4
[2.3.2]-01-C-02. Algorith.mp4
[2.3.2]-01-C-02. Algorith.srt
[2.3.3]-01-C-03. Demonstration.mp4
[2.3.3]-01-C-03. Demonstration.srt
[2.4.1]-01-D-01. Decrease and Conquer.mp4
[2.4.1]-01-D-01. Decrease and Conquer.srt
[2.4.2]-01-D-02. In-Convex-Polygon Test.mp4
[2.4.2]-01-D-02. In-Convex-Polygon Test.srt
[2.4.4]-01-D-04. Support-Lines.srt
[2.4.4]-01-D-04. Support-Lines[更多精选‖ 获取].mp4
[2.4.5]-01-D-05. Pattern Of Turns.srt
[2.4.5]-01-D-05. Pattern Of Turns[资源精选‖].mp4
[2.4.6]-01-D-06. Exterior Interior.srt
[2.4.6]-01-D-06. Exterior Interior[耗时整理‖].mp4
[2.5.1]-01-E-01. Selectionsort.mp4
[2.5.1]-01-E-01. Selectionsort.srt
[2.5.2]-01-E-02. Strategy.mp4
[2.5.2]-01-E-02. Strategy.srt
[2.5.3]-01-E-03. Coherence.srt
[2.5.3]-01-E-03. Coherence[不易整理‖].mp4
[2.5.4]-01-E-04. To-Left Test.mp4
[2.5.4]-01-E-04. To-Left Test.srt
[2.5.5]-01-E-05. Degeneracy.mp4
[2.5.5]-01-E-05. Degeneracy.srt
[2.5.6]-01-E-06. Lowest-Then-Leftmost.mp4
[2.5.6]-01-E-06. Lowest-Then-Leftmost.srt
[2.5.7]-01-E-07. Implementation.mp4
[2.5.7]-01-E-07. Implementation.srt
[2.5.8]-01-E-08. Output Sensitivity.mp4
[2.5.8]-01-E-08. Output Sensitivity.srt
[2.6.1]-01-F-01. Reduction.srt
[2.6.1]-01-F-01. Reduction[持续更新‖].mp4
[2.6.2]-01-F-02. CAO Chong's Methodology[整理不易‖].mp4
[2.6.2]-01-F-02. CAO Chong's Methodology.srt
[2.6.3]-01-F-03. Transitivity.srt
[2.6.3]-01-F-03. Transitivity[手动整理‖].mp4
[2.6.4]-01-F-04. Reduction Input.srt
[2.6.4]-01-F-04. Reduction Input[不易整理‖].mp4
[2.6.5]-01-F-05. Reduction Output.mp4
[2.6.5]-01-F-05. Reduction Output.srt
[2.6.6]-01-F-06. Sorting ≤_N 2d-CH.mp4
[2.6.6]-01-F-06. Sorting ≤_N 2d-CH.srt
[2.7.1]-01-G-01. Preprocessing.mp4
[2.7.1]-01-G-01. Preprocessing.srt
[2.7.2]-01-G-02. Scan.mp4
[2.7.2]-01-G-02. Scan.srt
[2.7.3]-01-G-03. Simplest Cases.srt
[2.7.3]-01-G-03. Simplest Cases[花费时间‖].mp4
[2.8.1]-01-H-01. Example (1 2).srt
[2.8.1]-01-H-01. Example (1 2)[精挑细选‖].mp4
[2.8.2]-01-H-02. Example (2 2).mp4
[2.8.2]-01-H-02. Example (2 2).srt
[2.9.1]-01-I-01. Left Turn.srt
[2.9.1]-01-I-01. Left Turn[耗时整理‖].mp4
[2.9.2]-01-I-02. Right Turn.mp4
[2.9.2]-01-I-02. Right Turn.srt
[2.9.3]-01-I-03. Presorting.mp4
[2.9.3]-01-I-03. Presorting.srt
[2.10.1]-01-J-01. Ω(n) Backtracks.srt
[2.10.1]-01-J-01. Ω(n) Backtracks[资源精选‖].mp4
[2.10.2]-01-J-02. Planarity.mp4
[2.10.2]-01-J-02. Planarity.srt
[2.10.3]-01-J-03. Amortization.mp4
[2.10.3]-01-J-03. Amortization.srt
[2.10.4]-01-J-04. Simplification.srt
[2.10.4]-01-J-04. Simplification[整理不易‖].mp4
[2.11.1]-01-K-01. Merge.mp4
清华大学邓俊辉教授《计算几何》- 学堂在线精品课程/
{1}-00 Introduction/
{2}-01 Convex Hull/
{3}-02 Geometric Intersection/
{4}-03 Triangulation/
{5}-04 Voronoi Diagram/
{6}-05 Delaunay Triangulation/
{7}-06 Point Location/
{9}-08 Windowing Query/
{1}-Before we start/
{2}-Evaluation/
{3}-Online Judge/
{4}-Lecture notes/
{5}-Discussion/
{6}-A History of This Course/
{7}-B What's Computational Geometry/
{8}-C How to Learn CG Better/
{9}-D Why English/
{1}-A Convexity/
{2}-B Extreme Points/
{3}-C Extreme Edges/
{4}-D Incremental Construction/
{5}-E Jarvis March/
{6}-F Lower Bound/
{7}-G Graham Scan Algorithm/
{8}-H Graham Scan Example/
{9}-I Graham Scan Correctness/
{10}-J Graham Scan Analysis/
{11}-K Divide-And-Conquer (1)/
{12}-L Divide-And-Conquer (2)/
{13}-M Wrap-Up/
{1}-0 Introduction/
{2}-A Preliminary/
{3}-B Interval Intersection Detectio/
{4}-C Segment Intersection Reporting/
{5}-D BO Algorithm Strategy/
{6}-E BO Algorithm Implementation/
{7}-F BO Algorithm Analysis/
{8}-G Convex Polygon Intersection De/
{9}-H Edge Chasing/
{10}-I Plane Sweeping/
{11}-J Halfplane Intersection Constru/
{1}-0 Methodology/
{2}-A Art Gallery Problem/
{3}-B Art Gallery Theorem/
{4}-C Fisk's Proof/
{5}-D Orthogonal Polygons/
{6}-E Triangulation/
{7}-F Triangulating Monotone Polygon/
{8}-G Monotone Decomposition/
{9}-I Tetrahedralization/
{1}-A Introduction/
{2}-B Terminologies/
{3}-C Properties/
{4}-D Complexity/
{5}-E Representation/
{6}-F DCEL/
{7}-G Hardness/
{8}-H Sorted Sets/
{9}-I VD_sorted/
{10}-J Naive Construction/
{11}-K Incremental Construction/
{12}-L Divide-And-Conquer/
{13}-M Plane-Sweep/
{1}-A Point Set Triangulation/
{2}-B Delaunay Triangulation/
{3}-C Properties/
{4}-D Proximity Graph/
{5}-E Euclidean Minimum Spanning Tre/
{6}-F Euclidean Traveling Salesman P/
{7}-G Minimum Weighted Triangulation/
{8}-H Construction/
{9}-I RIC With Example/
{10}-J Randomized Incremental Constru/
{11}-K RIC Analysis/
{1}-0 OnlineOffline Algorithms/
{2}-A Introduction/
{3}-B Slab Method/
{4}-C Persistence/
{5}-D Path Copying/
{6}-E Node Copying/
{7}-F Limited Node Copying/
{8}-G Kirkpatrick Structure/
{9}-H Trapezoidal Map/
{10}-I Constructing Trapezoidal Map/
{11}-J Performance Of Trapezoidal Map/
{1}-A Range Query/
{2}-B BBST/
{3}-C kd-Tree Structure/
{4}-D kd-Tree Algorithm/
{5}-E kd-Tree Performance/
{6}-F Range Tree Structure/
{7}-G Range Tree Query/
{8}-H Range Tree Performance/
{9}-I Range Tree Optimization/
{1}-A Orthogonal Windowing Query/
{2}-B Stabbing Query/
{3}-C Interval Tree Construction/
{4}-D Interval Tree Query/
{5}-E Stabbing With A Segment/
{6}-F Grounded Range Query/
{7}-G 1D-GRQ Using Heap/
{9}-I 2D-GRQ Using PST/

仅展示前 200 项，共 202 项。

分享时间: 2025-10-12 10:10
入库时间: 2025-10-12 10:15
分享用户: 拔刀*助的孔雀
资源大小: 1.9 GB
资源类型: 夸克网盘
资源标签: 计算几何清华大学算法视频课程计算机科学

问题反馈

链接失效、内容异常、提取码错误等问题，可提交反馈，管理员会尽快处理。

清华大学邓俊辉教授《计算几何》- 学堂在线精品课程

相似推荐

同平台资源