- 来自www.xuetangx.com
计算几何（2016春）
课程
zh
中文
此内容评级为 0/5
- 等级 介绍
- 从28 三月 2016开始
课程详情
教学大纲
- 00. Introduction
- Before we start
- Evaluation
- Online Judge
- Lecture notes
- Discussion
- A. History of This Course
- B. What's Computational Geometry
- C. How to Learn CG Better
- D. Why English
- 01. Convex Hull
- A. Convexity
- B. Extreme Points
- C. Extreme Edges
- D. Incremental Construction
- E. Jarvis March
- F. Lower Bound
- G. Graham Scan: Algorithm
- H. Graham Scan: Example
- I. Graham Scan: Correctness
- J. Graham Scan: Analysis
- K. Divide-And-Conquer (1)
- L. Divide-And-Conquer (2)
- M. Wrap-Up
- 02. Geometric Intersection
- 0. Introduction
- A. Preliminary
- B. Interval Intersection Detection
- C. Segment Intersection Reporting
- D. BO Algorithm: Strategy
- E. BO Algorithm: Implementation
- F. BO Algorithm: Analysis
- G. Convex Polygon Intersection Detection
- H. Edge Chasing
- I. Plane Sweeping
- J. Halfplane Intersection Construction
- 03. Triangulation
- 0. Methodology
- A. Art Gallery Problem
- B. Art Gallery Theorem
- C. Fisk's Proof
- D. Orthogonal Polygons
- E. Triangulation
- F. Triangulating Monotone Polygons
- G. Monotone Decomposition
- I. Tetrahedralization
- 04. Voronoi Diagram
- A. Introduction
- B. Terminologies
- C. Properties
- D. Complexity
- E. Representation
- F. DCEL
- G. Hardness
- H. Sorted Sets
- I. VD_sorted
- J. Naive Construction
- K. Incremental Construction
- L. Divide-And-Conquer
- M. Plane-Sweep
- 05. Delaunay Triangulation
- A. Point Set Triangulation
- B. Delaunay Triangulation
- C. Properties
- D. Proximity Graph
- E. Euclidean Minimum Spanning Tree
- F. Euclidean Traveling Salesman Problem
- G. Minimum Weighted Triangulation
- H. Construction
- I. RIC With Example
- J. Randomized Incremental Construction
- K. RIC Analysis
- 06. Point Location
- 0. Online/Offline Algorithms
- A. Introduction
- B. Slab Method
- C. Persistence
- D. Path Copying
- E. Node Copying
- F. Limited Node Copying
- G. Kirkpatrick Structure
- H. Trapezoidal Map
- I. Constructing Trapezoidal Map
- J. Performance Of Trapezoidal Map
- 07. Geometric Range Search
- A. Range Query
- B. BBST
- C. kd-Tree: Structure
- D. kd-Tree: Algorithm
- E. kd-Tree: Performance
- F. Range Tree: Structure
- G. Range Tree: Query
- H. Range Tree: Performance
- I. Range Tree: Optimization
- 08. Windowing Query
- A. Orthogonal Windowing Query
- B. Stabbing Query
- C. Interval Tree: Construction
- D. Interval Tree: Query
- E. Stabbing With A Segment
- F. Grounded Range Query
- G. 1D-GRQ Using Heap
- H. Pririty Search Tree
- I. 2D-GRQ Using PST
- J. Segment Tree
- K. Vertical Segment Stabbing Query
- Final Test
- Final Test
先决条件
没有。
讲师
- 邓俊辉
平台
慕华（北京）网络技术有限公司旗下的学堂在线是免费公开的MOOC（大规模开放在线课程）平台，是教育部在线教育研究中心的研究交流和成果应用平台，致力于通过来自国内外一流名校开设的免费网络学习课程，为公众提供系统的高等教育，让每一个中国人都有机会享受优质教育资源。通过和清华大学在线教育研究中心、以及国内外知名大学的紧密合作，学堂在线将不断增加课程的种类和丰富程度。
此内容评级为 4.5/5
(没有评论)此内容评级为 4.5/5
(没有评论)完成这个资源，写一篇评论