https://pan.quark.cn/s/5470fe2ca997
📁 计算几何
📁 {2}–01 Convex Hull
📁 {6}–05 Delaunay Triangulation
📁 {1}–00 Introduction
📁 {3}–02 Geometric Intersection
📁 {9}–08 Windowing Query
📁 {5}–04 Voronoi Diagram
📁 {7}–06 Point Location
📁 {4}–03 Triangulation
📁 {8}–07 Geometric Range Search
📁 {11}–K Divide-And-Conquer (1)
📁 {6}–F Lower Bound
📁 {2}–B Extreme Points
📁 {3}–C Extreme Edges
📁 {12}–L Divide-And-Conquer (2)
📁 {8}–H Graham Scan Example
📁 {5}–E Jarvis March
📁 {1}–A Convexity
📁 {9}–I Graham Scan Correctness
📁 {7}–G Graham Scan Algorithm
📁 {13}–M Wrap-Up
📁 {10}–J Graham Scan Analysis
📁 {4}–D Incremental Construction
📁 {4}–C Segment Intersection Reporting
📁 {6}–E BO Algorithm Implementation
📁 {7}–F BO Algorithm Analysis
📁 {10}–I Plane Sweeping
📁 {2}–A Preliminary
📁 {3}–B Interval Intersection Detectio
📁 {8}–G Convex Polygon Intersection De
📁 {11}–J Halfplane Intersection Constru
📁 {1}–0 Introduction
📁 {5}–D BO Algorithm Strategy
📁 {9}–H Edge Chasing
📁 {3}–Online Judge
📁 {8}–C How to Learn CG Better
📁 {2}–Evaluation
📁 {4}–Lecture notes
📁 {1}–Before we start
📁 {9}–D Why English
📁 {5}–Discussion
📁 {6}–A History of This Course
📁 {7}–B What's Computational Geometry
📁 {4}–D Proximity Graph
📁 {6}–F Euclidean Traveling Salesman P
📁 {3}–C Properties
📁 {1}–A Point Set Triangulation
📁 {10}–J Randomized Incremental Constru
📁 {11}–K RIC Analysis
📁 {2}–B Delaunay Triangulation
📁 {7}–G Minimum Weighted Triangulation
📁 {5}–E Euclidean Minimum Spanning Tre
📁 {8}–H Construction
📁 {9}–I RIC With Example
📁 {6}–E Node Copying
📁 {10}–I Constructing Trapezoidal Map
📁 {1}–0 OnlineOffline Algorithms
📁 {2}–A Introduction
📁 {9}–H Trapezoidal Map
📁 {4}–C Persistence
📁 {3}–B Slab Method
📁 {5}–D Path Copying
📁 {8}–G Kirkpatrick Structure
📁 {11}–J Performance Of Trapezoidal Map
📁 {7}–F Limited Node Copying
📁 {1}–A Orthogonal Windowing Query
📁 {7}–G 1D-GRQ Using Heap
📁 {11}–K Vertical Segment Stabbing Quer
📁 {5}–E Stabbing With A Segment
📁 {2}–B Stabbing Query
📁 {10}–J Segment Tree
📁 {9}–I 2D-GRQ Using PST
📁 {3}–C Interval Tree Construction
📁 {6}–F Grounded Range Query
📁 {4}–D Interval Tree Query
📁 {8}–H Priority Search Tree
📁 {6}–F DCEL
📁 {9}–I VD_sorted
📁 {5}–E Representation
📁 {13}–M Plane-Sweep
📁 {7}–G Hardness
📁 {1}–A Introduction
📁 {11}–K Incremental Construction
📁 {4}–D Complexity
📁 {3}–C Properties
📁 {8}–H Sorted Sets
📁 {10}–J Naive Construction
📁 {12}–L Divide-And-Conquer
📁 {2}–B Terminologies
📁 {3}–B Art Gallery Theorem
📁 {9}–I Tetrahedralization
📁 {1}–0 Methodology
📁 {5}–D Orthogonal Polygons
📁 {4}–C Fisk's Proof
📁 {6}–E Triangulation
📁 {8}–G Monotone Decomposition
📁 {7}–F Triangulating Monotone Polygon
📁 {2}–A Art Gallery Problem
📄 [2.11.4]–01-K-04. Exterior.srt
📄 [2.11.1]–01-K-01. Merge.mp4
📄 [2.11.3]–01-K-03. Interior.srt
📄 [2.11.1]–01-K-01. Merge.srt
📄 [2.11.3]–01-K-03. Interior.mp4
📄 [2.11.2]–01-K-02. Common Kernel.srt
📄 [2.11.2]–01-K-02. Common Kernel.mp4
📄 [2.11.4]–01-K-04. Exterior.mp4
📄 [2.2.3]–01-B-03. In-Triangle Test.mp4
📄 [2.2.4]–01-B-04. To-Left Test.srt
📄 [2.2.1]–01-B-01. Extremity.mp4
📄 [2.2.1]–01-B-01. Extremity.srt
📄 [2.2.3]–01-B-03. In-Triangle Test.srt
📄 [2.2.2]–01-B-02. Strategy.mp4
📄 [2.2.5]–01-B-05. Determinant.mp4
📄 [2.2.5]–01-B-05. Determinant.srt
📄 [2.2.2]–01-B-02. Strategy.srt
📄 [2.2.4]–01-B-04. To-Left Test.mp4
📁 {1}–A Range Query
📁 {2}–B BBST
📁 {8}–H Range Tree Performance
📁 {3}–C kd-Tree Structure
📁 {5}–E kd-Tree Performance
📁 {9}–I Range Tree Optimization
📁 {6}–F Range Tree Structure
📁 {4}–D kd-Tree Algorithm
📁 {7}–G Range Tree Query
📄 [2.6.6]–01-F-06. Sorting ≤_N 2d-CH.srt
📄 [2.6.6]–01-F-06. Sorting ≤_N 2d-CH.mp4
📄 [2.6.1]–01-F-01. Reduction.srt
📄 [2.6.2]–01-F-02. CAO Chong's Methodology.mp4
📄 [2.6.5]–01-F-05. Reduction Output.mp4
📄 [2.6.5]–01-F-05. Reduction Output.srt
📄 [2.6.1]–01-F-01. Reduction.mp4
📄 [2.6.4]–01-F-04. Reduction Input.mp4
📄 [2.6.3]–01-F-03. Transitivity.srt
📄 [2.6.4]–01-F-04. Reduction Input.srt
📄 [2.6.2]–01-F-02. CAO Chong's Methodology.srt
📄 [2.6.3]–01-F-03. Transitivity.mp4
📄 [2.12.3]–01-L-03. Topmost + Bottommost.mp4
📄 [2.12.4]–01-L-04. Stitch.mp4
📄 [2.12.7]–01-L-07. More Considerations.mp4
📄 [2.12.1]–01-L-01. Preprocessing.srt
📄 [2.12.3]–01-L-03. Topmost + Bottommost.srt
📄 [2.12.5]–01-L-05. Zig-Zag.mp4
📄 [2.12.2]–01-L-02. Common Tangents.srt
📄 [2.12.7]–01-L-07. More Considerations.srt
📄 [2.12.2]–01-L-02. Common Tangents.mp4
📄 [2.12.6]–01-L-06. Time Cost.srt
📄 [2.12.1]–01-L-01. Preprocessing.mp4
📄 [2.12.4]–01-L-04. Stitch.srt
📄 [2.12.5]–01-L-05. Zig-Zag.srt
📄 [2.12.6]–01-L-06. Time Cost.mp4
📄 [2.5.4]–01-E-04. To-Left Test.mp4
📄 [2.5.3]–01-E-03. Coherence.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.7]–01-E-07. Implementation.srt
📄 [2.5.8]–01-E-08. Output Sensitivity.srt
📄 [2.5.8]–01-E-08. Output Sensitivity.mp4
📄 [2.5.3]–01-E-03. Coherence.srt
📄 [2.5.5]–01-E-05. Degeneracy.mp4
📄 [2.5.7]–01-E-07. Implementation.mp4
📄 [2.5.6]–01-E-06. Lowest-Then-Leftmost.mp4
📄 [2.5.4]–01-E-04. To-Left Test.srt
📄 [2.5.5]–01-E-05. Degeneracy.srt
📄 [2.5.2]–01-E-02. Strategy.srt
📄 [2.5.6]–01-E-06. Lowest-Then-Leftmost.srt
📄 [2.3.3]–01-C-03. Demonstration.srt
📄 [2.3.2]–01-C-02. Algorith.srt
📄 [2.3.1]–01-C-01. Definition.srt
📄 [2.3.1]–01-C-01. Definition.mp4
📄 [2.3.3]–01-C-03. Demonstration.mp4
📄 [2.3.2]–01-C-02. Algorith.mp4
📄 [2.8.1]–01-H-01. Example (1 2).srt
📄 [2.8.2]–01-H-02. Example (2 2).srt
📄 [2.8.2]–01-H-02. Example (2 2).mp4
📄 [2.8.1]–01-H-01. Example (1 2).mp4
📄 [2.13.1]–01-M. Wrap-U.mp4
📄 [2.13.1]–01-M. Wrap-U.srt
📄 [2.1.4]–01-A-04. Color Space.srt
📄 [2.1.3]–01-A-03. Paint Blending.mp4
📄 [2.1.5]–01-A-05. 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.5]–01-A-05. Convex Hull.mp4
📄 [2.1.1]–01-A-01. Why Convex Hull.mp4
📄 [2.1.1]–01-A-01. Why Convex Hull.srt
📄 [2.1.4]–01-A-04. Color Space.mp4
📄 [2.1.3]–01-A-03. Paint Blending.srt
📄 [2.7.3]–01-G-03. Simplest Cases.mp4
📄 [2.7.1]–01-G-01. Preprocessing.srt
📄 [2.7.3]–01-G-03. Simplest Cases.srt
📄 [2.7.2]–01-G-02. Scan.mp4
📄 [2.7.2]–01-G-02. Scan.srt
📄 [2.7.1]–01-G-01. Preprocessing.mp4
📄 [2.9.1]–01-I-01. Left Turn.mp4
📄 [2.9.3]–01-I-03. Presorting.srt
📄 [2.9.2]–01-I-02. Right Turn.mp4
📄 [2.9.2]–01-I-02. Right Turn.srt
📄 [2.9.1]–01-I-01. Left Turn.srt
📄 [2.9.3]–01-I-03. Presorting.mp4
📄 [3.6.3]–02-E-03. Events & Operations.srt
📄 [3.6.2]–02-E-02. Event Queue.mp4
📄 [3.6.2]–02-E-02. Event Queue.srt
📄 [3.6.4]–02-E-04. Sweepline Status.mp4
📄 [3.6.1]–02-E-01. Degeneracy.mp4
📄 [3.6.4]–02-E-04. Sweepline Status.srt
📄 [3.6.1]–02-E-01. Degeneracy.srt
📄 [3.6.3]–02-E-03. Events & Operations.mp4
📄 [2.10.3]–01-J-03. Amortization.srt
📄 [2.10.4]–01-J-04. Simplification.mp4
📄 [2.10.1]–01-J-01. Ω(n) Backtracks.srt
📄 [2.10.2]–01-J-02. Planarity.mp4
📄 [2.10.1]–01-J-01. Ω(n) Backtracks.mp4
📄 [2.10.4]–01-J-04. Simplification.srt
📄 [2.10.2]–01-J-02. Planarity.srt
📄 [2.10.3]–01-J-03. Amortization.mp4
📄 [3.4.1]–02-C-01. Brute-force.srt
📄 [3.4.2]–02-C-02. Hardness.mp4
📄 [3.4.2]–02-C-02. Hardness.srt
📄 [3.4.1]–02-C-01. Brute-force.mp4
📄 [2.4.6]–01-D-06. Exterior Interior.srt
📄 [2.4.4]–01-D-04. Support-Lines.mp4
📄 [2.4.5]–01-D-05. Pattern Of Turns.mp4
📄 [2.4.4]–01-D-04. Support-Lines.srt
📄 [2.4.1]–01-D-01. Decrease and Conquer.srt
📄 [2.4.6]–01-D-06. Exterior Interior.mp4
📄 [2.4.3]–01-D-03. Why Not Binary Search.srt
📄 [2.4.5]–01-D-05. Pattern Of Turns.srt
📄 [2.4.3]–01-D-03. Why Not Binary Search.mp4
📄 [2.4.2]–01-D-02. In-Convex-Polygon Test.srt
📄 [2.4.2]–01-D-02. In-Convex-Polygon Test.mp4
📄 [2.4.1]–01-D-01. Decrease and Conquer.mp4
📄 [3.7.1]–02-F-01. Correctness.mp4
📄 [3.7.5]–02-F-05. Complexity of Status St.mp4
📄 [3.7.4]–02-F-04. Complexity of Event Que.srt
📄 [3.7.4]–02-F-04. Complexity of Event Que.mp4
📄 [3.7.1]–02-F-01. Correctness.srt
📄 [3.7.2]–02-F-02. Example.srt
📄 [3.7.3]–02-F-03. Retesting.srt
📄 [3.7.5]–02-F-05. Complexity of Status St.srt
📄 [3.7.2]–02-F-02. Example.mp4
📄 [3.7.3]–02-F-03. Retesting.mp4
📄 [3.2.1]–02-A-01. EU.mp4
📄 [3.2.1]–02-A-01. EU.srt
📄 [3.2.3]–02-A-03. Max-Ga.srt
📄 [3.2.4]–02-A-04. IEU.mp4
📄 [3.2.4]–02-A-04. IEU.srt
📄 [3.2.2]–02-A-02. Min-Ga.mp4
📄 [3.2.2]–02-A-02. Min-Ga.srt
📄 [3.2.3]–02-A-03. Max-Ga.mp4
📄 [3.3.2]–02-B-02. Lower Bound.mp4
📄 [3.3.2]–02-B-02. Lower Bound.srt
📄 [3.3.1]–02-B-01. Algorith.srt
📄 [3.3.1]–02-B-01. Algorith.mp4
📄 [3.10.1]–02-I. Plane Sweeping.srt
📄 [3.10.1]–02-I. Plane Sweeping.mp4
📄 [3.11.3]–02-J-03. Divide-And-Conquer.srt
📄 [3.11.3]–02-J-03. Divide-And-Conquer.mp4
📄 [3.11.1]–02-J-01. The Proble.mp4
📄 [3.11.2]–02-J-02. Lower Bound.srt
📄 [3.11.2]–02-J-02. Lower Bound.mp4
📄 [3.11.1]–02-J-01. The Proble.srt
📄 [3.8.6]–02-G-06. Complexity.mp4
📄 [3.8.4]–02-G-04. Decrease-And-Conquer.mp4
📄 [3.8.3]–02-G-03. Criterion.srt
📄 [3.8.5]–02-G-05. Example Cases.srt
📄 [3.8.5]–02-G-05. Example Cases.mp4
📄 [3.8.2]–02-G-02. Monotone Partitioning.srt
📄 [3.8.3]–02-G-03. Criterion.mp4
📄 [3.8.4]–02-G-04. Decrease-And-Conquer.srt
📄 [3.8.1]–02-G-01. Problem Specification.srt
📄 [3.8.1]–02-G-01. Problem Specification.mp4
📄 [3.8.2]–02-G-02. Monotone Partitioning.mp4
📄 [3.8.6]–02-G-06. Complexity.srt
📄 [3.1.1]–02-0. Introduction.srt
📄 [3.1.1]–02-0. Introduction.mp4
📄 [3.5.2]–02-D-02. Comparability & Orderin.srt
📄 [3.5.2]–02-D-02. Comparability & Orderin.mp4
📄 [3.5.1]–02-D-01. Proximity & Separabilit.srt
📄 [3.5.4]–02-D-04. Possible Cases.srt
📄 [3.5.4]–02-D-04. Possible Cases.mp4
📄 [3.5.3]–02-D-03. Data Structures.mp4
📄 [3.5.1]–02-D-01. Proximity & Separabilit.mp4
📄 [3.5.3]–02-D-03. Data Structures.srt
📄 [3.9.3]–02-H-03. Analysis.mp4
📄 [3.9.2]–02-H-02. Example.mp4
📄 [3.9.3]–02-H-03. Analysis.srt
📄 [3.9.1]–02-H-01. Eliminating Sickles.srt
📄 [3.9.1]–02-H-01. Eliminating Sickles.mp4
📄 [3.9.2]–02-H-02. Example.srt
📄 #1.3.1#–html.pdf
📄 #1.2.1#–html.pdf
📄 [1.8.1]–00-C. How to Learn CG Better.mp4
📄 [1.8.1]–00-C. How to Learn CG Better.srt
📄 [1.9.1]–00-D. Why English.srt
📄 [1.9.1]–00-D. Why English.mp4
📄 #1.5.1#–html.pdf
📄 #1.4.1#–html.pdf
📄 #1.1.1#–html.pdf
📄 [1.7.1]–00-B. What's Computational Geome.srt
📄 [1.7.1]–00-B. What's Computational Geome.mp4
📄 [6.4.1]–05-D-01. Gabriel Graph.srt
📄 [6.4.1]–05-D-01. Gabriel Graph.mp4
📄 [6.4.2]–05-D-02. Relative Neighborhood G.srt
📄 [6.4.3]–05-D-03. Lower Bounds.mp4
📄 [6.4.3]–05-D-03. Lower Bounds.srt
📄 [6.4.2]–05-D-02. Relative Neighborhood G.mp4
📄 [1.6.1]–00-A. History of This Course.mp4
📄 [1.6.1]–00-A. History of This Course.srt
📄 [6.6.2]–05-F-02. NP-Hardness.srt
📄 [6.6.1]–05-F-01. Definition.srt
📄 [6.6.2]–05-F-02. NP-Hardness.mp4
📄 [6.6.1]–05-F-01. Definition.mp4
📄 [6.6.3]–05-F-03. Approximation.srt
📄 [6.6.3]–05-F-03. Approximation.mp4
📄 [6.10.2]–05-J-02. Iterative Implementatio.mp4
📄 [6.10.1]–05-J-01. Recursive Implementatio.srt
📄 [6.10.4]–05-J-04. Point Location.srt
📄 [6.10.4]–05-J-04. Point Location.mp4
📄 [6.10.3]–05-J-03. In-Circle Test.srt
📄 [6.10.3]–05-J-03. In-Circle Test.mp4
📄 [6.10.2]–05-J-02. Iterative Implementatio.srt
📄 [6.10.1]–05-J-01. Recursive Implementatio.mp4
📄 [6.3.1]–05-C-01. Empty Circumcircle.srt
📄 [6.3.4]–05-C-04. Complexity.mp4
📄 [6.3.3]–05-C-03. Nearest Neighbor.mp4
📄 [6.3.4]–05-C-04. Complexity.srt
📄 [6.3.2]–05-C-02. Empty Circle.srt
📄 [6.3.1]–05-C-01. Empty Circumcircle.mp4
📄 [6.3.3]–05-C-03. Nearest Neighbor.srt
📄 [6.3.2]–05-C-02. Empty Circle.mp4
📄 [6.11.4]–05-K-04. Types Of Edge Change.srt
📄 [6.11.5]–05-K-05. Number Of Edge Changes.srt
📄 [6.11.3]–05-K-03. Preconditions.srt
📄 [6.11.7]–05-K-07. Number Of Rebucketings.srt
📄 [6.11.6]–05-K-06. Average Degree.mp4
📄 [6.11.10]–05-K-10. Further Consideration.mp4
📄 [6.11.2]–05-K-02. Backward Analysis.srt
📄 [6.11.9]–05-K-09. Expectation.mp4
📄 [6.11.8]–05-K-08. Probability For Rebucke.mp4
📄 [6.11.2]–05-K-02. Backward Analysis.mp4
📄 [6.11.3]–05-K-03. Preconditions.mp4
📄 [6.11.1]–05-K-01. Time Cost.mp4
📄 [6.11.9]–05-K-09. Expectation.srt
📄 [6.11.8]–05-K-08. Probability For Rebucke.srt
📄 [6.11.6]–05-K-06. Average Degree.srt
📄 [6.11.7]–05-K-07. Number Of Rebucketings.mp4
📄 [6.11.1]–05-K-01. Time Cost.srt
📄 [6.11.5]–05-K-05. Number Of Edge Changes.mp4
📄 [6.11.4]–05-K-04. Types Of Edge Change.mp4
📄 [6.11.10]–05-K-10. Further Consideration.srt
📄 [6.1.3]–05-A-03. Upper Bound.srt
📄 [6.1.1]–05-A-01. Definition.srt
📄 [6.1.2]–05-A-02. Edge Flipping.srt
📄 [6.1.4]–05-A-04. Lower Bound.srt
📄 [6.1.4]–05-A-04. Lower Bound.mp4
📄 [6.1.2]–05-A-02. Edge Flipping.mp4
📄 [6.1.3]–05-A-03. Upper Bound.mp4
📄 [6.1.1]–05-A-01. Definition.mp4
📄 [6.7.3]–05-G-03. Hardness.srt
📄 [6.7.1]–05-G-01. Definition.srt
📄 [6.7.3]–05-G-03. Hardness.mp4
📄 [6.7.2]–05-G-02. Counter-Example.srt
📄 [6.7.2]–05-G-02. Counter-Example.mp4
📄 [6.7.1]–05-G-01. Definition.mp4
📄 [6.2.3]–05-B-03. Hardness.srt
📄 [6.2.1]–05-B-01. Dual Graph.mp4
📄 [6.2.3]–05-B-03. Hardness.mp4
📄 [6.2.2]–05-B-02. Triangulation.mp4
📄 [6.2.2]–05-B-02. Triangulation.srt
📄 [6.2.4]–05-B-04. History.srt
📄 [6.2.1]–05-B-01. Dual Graph.srt
📄 [6.2.4]–05-B-04. History.mp4
📄 [6.5.2]–05-E-02. Construction.srt
📄 [6.5.4]–05-E-04. Example.srt
📄 [6.5.2]–05-E-02. Construction.mp4
📄 [6.5.1]–05-E-01. Definition.srt
📄 [6.5.3]–05-E-03. Subgraph of RNG.srt
📄 [6.5.1]–05-E-01. Definition.mp4
📄 [6.5.3]–05-E-03. Subgraph of RNG.mp4
📄 [6.5.4]–05-E-04. Example.mp4
📄 [6.8.2]–05-H-02. Angle Vector.srt
📄 [6.8.3]–05-H-03. Maximizing The Minimu.mp4
📄 [6.8.5]–05-H-05. Strategies.mp4
📄 [6.8.4]–05-H-04. Evolution By Edge Fli.srt
📄 [6.8.1]–05-H-01. Subtended Arc.mp4
📄 [6.8.3]–05-H-03. Maximizing The Minimu.srt
📄 [6.8.5]–05-H-05. Strategies.srt
📄 [6.8.2]–05-H-02. Angle Vector.mp4
📄 [6.8.1]–05-H-01. Subtended Arc.srt
📄 [6.8.4]–05-H-04. Evolution By Edge Fli.mp4
📄 [7.6.2]–06-E-02. Strategy.srt
📄 [7.6.5]–06-E-05. Time Penalty.mp4
📄 [7.6.4]–06-E-04. Linear Space.srt
📄 [7.6.3]–06-E-03. Why Red-Black.srt
📄 [7.6.5]–06-E-05. Time Penalty.srt
📄 [7.6.1]–06-E-01. O(1) Rotation.srt
📄 [7.6.3]–06-E-03. Why Red-Black.mp4
📄 [7.6.1]–06-E-01. O(1) Rotation.mp4
📄 [7.6.4]–06-E-04. Linear Space.mp4
📄 [7.6.2]–06-E-02. Strategy.mp4
📄 [6.9.2]–05-I-02. Point Location.mp4
📄 [6.9.6]–05-I-06. Convergence.srt
📄 [6.9.4]–05-I-04. Edge Flipping.mp4
📄 [6.9.3]–05-I-03. In-Circle Test.mp4
📄 [6.9.4]–05-I-04. Edge Flipping.srt
📄 [6.9.6]–05-I-06. Convergence.mp4
📄 [6.9.2]–05-I-02. Point Location.srt
📄 [6.9.5]–05-I-05. Frontier.mp4
📄 [6.9.1]–05-I-01. Idea.srt
📄 [6.9.3]–05-I-03. In-Circle Test.srt
📄 [6.9.5]–05-I-05. Frontier.srt
📄 [6.9.1]–05-I-01. Idea.mp4
📄 [7.1.1]–06-0. OnlineOffline Algorithms.srt
📄 [7.1.1]–06-0. OnlineOffline Algorithms.mp4
📄 [7.10.6]–06-I-06. Case 3 No Endpoints.srt
📄 [7.10.6]–06-I-06. Case 3 No Endpoints.mp4
📄 [7.10.3]–06-I-03. Challenges.srt
📄 [7.10.1]–06-I-01. Initialization.srt
📄 [7.10.7]–06-I-07. Example.mp4
📄 [7.10.7]–06-I-07. Example.srt
📄 [7.10.2]–06-I-02. Iteration.mp4
📄 [7.10.5]–06-I-05. Case 2 One Endpoint.srt
📄 [7.10.1]–06-I-01. Initialization.mp4
📄 [7.10.4]–06-I-04. Case 1 Two Endpoints.mp4
📄 [7.10.5]–06-I-05. Case 2 One Endpoint.mp4
📄 [7.10.4]–06-I-04. Case 1 Two Endpoints.srt
📄 [7.10.2]–06-I-02. Iteration.srt
📄 [7.10.3]–06-I-03. Challenges.mp4
📄 [7.4.3]–06-C-03. Persistent Slabs.srt
📄 [7.4.2]–06-C-02. Persistent Structure.mp4
📄 [7.4.1]–06-C-01. Ephemeral Structure.srt
📄 [7.4.3]–06-C-03. Persistent Slabs.mp4
📄 [7.4.1]–06-C-01. Ephemeral Structure.mp4
📄 [7.4.2]–06-C-02. Persistent Structure.srt
📄 [7.9.3]–06-H-03. Properties & Complexity.srt
📄 [7.9.4]–06-H-04. Search Structure Exampl.mp4
📄 [7.9.2]–06-H-02. Decomposition.srt
📄 [7.9.2]–06-H-02. Decomposition.mp4
📄 [7.9.5]–06-H-05. Search Structure Nodes.srt
📄 [7.9.6]–06-H-06. Search Structure Perfor.srt
📄 [7.9.5]–06-H-05. Search Structure Nodes.mp4
📄 [7.9.4]–06-H-04. Search Structure Exampl.srt
📄 [7.9.6]–06-H-06. Search Structure Perfor.mp4
📄 [7.9.1]–06-H-01. Ray Shooting.mp4
📄 [7.9.1]–06-H-01. Ray Shooting.srt
📄 [7.9.3]–06-H-03. Properties & Complexity.mp4
📄 [7.3.6]–06-B-06. Preprocessing Time.mp4
📄 [7.3.3]–06-B-03. Tree of Trees.srt
📄 [7.3.7]–06-B-07. Storage Cost.mp4
📄 [7.3.2]–06-B-02. Ordering Trapezoids.mp4
📄 [7.3.5]–06-B-05. Query Time.mp4
📄 [7.3.5]–06-B-05. Query Time.srt
📄 [7.3.7]–06-B-07. Storage Cost.srt
📄 [7.3.6]–06-B-06. Preprocessing Time.srt
📄 [7.3.4]–06-B-04. Example.srt
📄 [7.3.8]–06-B-08. Worst Case.mp4
📄 [7.3.1]–06-B-01. Slab Decomposition.mp4
📄 [7.3.2]–06-B-02. Ordering Trapezoids.srt
📄 [7.3.1]–06-B-01. Slab Decomposition.srt
📄 [7.3.8]–06-B-08. Worst Case.srt
📄 [7.3.4]–06-B-04. Example.mp4
📄 [7.3.3]–06-B-03. Tree of Trees.mp4
📄 [7.2.2]–06-A-02. Point Location.srt
📄 [7.2.3]–06-A-03. Assumptions For Clarity.srt
📄 [7.2.6]–06-A-06. A Global View.mp4
📄 [7.2.6]–06-A-06. A Global View.srt
📄 [7.2.5]–06-A-05. Performance Measurement.srt
📄 [7.2.5]–06-A-05. Performance Measurement.mp4
📄 [7.2.4]–06-A-04. Input Size.srt
📄 [7.2.1]–06-A-01. Where Am I.srt
📄 [7.2.4]–06-A-04. Input Size.mp4
📄 [7.2.1]–06-A-01. Where Am I.mp4
📄 [7.2.3]–06-A-03. Assumptions For Clarity.mp4
📄 [7.2.2]–06-A-02. Point Location.mp4
📄 [7.8.7]–06-G-07. The Fewer The Better.mp4
📄 [7.8.3]–06-G-03. Example.mp4
📄 [7.8.6]–06-G-06. The More The Better.mp4
📄 [7.8.10]–06-G-10. Construction Of Indepen.mp4
📄 [7.8.9]–06-G-09. Existence Of Independen.srt
📄 [7.8.8]–06-G-08. Degree.mp4
📄 [7.8.4]–06-G-04. Hierarchy.mp4
📄 [7.8.9]–06-G-09. Existence Of Independen.mp4
📄 [7.8.2]–06-G-02. Triangulation.mp4
📄 [7.8.1]–06-G-01. Optimal And Simpler.mp4
📄 [7.8.11]–06-G-11. DAG.srt
📄 [7.8.7]–06-G-07. The Fewer The Better.srt
📄 [7.8.4]–06-G-04. Hierarchy.srt
📄 [7.8.11]–06-G-11. DAG.mp4
📄 [7.8.10]–06-G-10. Construction Of Indepen.srt
📄 [7.8.1]–06-G-01. Optimal And Simpler.srt
📄 [7.8.5]–06-G-05. Independent Subset.mp4
📄 [7.8.5]–06-G-05. Independent Subset.srt
📄 [7.8.6]–06-G-06. The More The Better.srt
📄 [7.8.2]–06-G-02. Triangulation.srt
📄 [7.8.3]–06-G-03. Example.srt
📄 [7.8.8]–06-G-08. Degree.srt
📄 [7.5.2]–06-D-02. X-Search.mp4
📄 [7.5.3]–06-D-03. Storage Optimization.srt
📄 [7.5.1]–06-D-01. Strategy.mp4
📄 [7.5.2]–06-D-02. X-Search.srt
📄 [7.5.1]–06-D-01. Strategy.srt
📄 [7.5.3]–06-D-03. Storage Optimization.mp4
📄 [7.11.9]–06-J-09. Each Single Ste.mp4
📄 [7.11.3]–06-J-03. Number Of Ray Trimmed.srt
📄 [7.11.8]–06-J-08. Fixed Query Point + Ran.mp4
📄 [7.11.10]–06-J-10. Probability Of Enclosin.mp4
📄 [7.11.5]–06-J-05. Number Of Trapezoidals.mp4
📄 [7.11.8]–06-J-08. Fixed Query Point + Ran.srt
📄 [7.11.2]–06-J-02. Expectation.mp4
📄 [7.11.9]–06-J-09. Each Single Ste.srt
📄 [7.11.4]–06-J-04. Number Of Trapezoidals.mp4
📄 [7.11.11]–06-J-11. Query Time.mp4
📄 [7.11.7]–06-J-07. Size Of Search Structur.mp4
📄 [7.11.4]–06-J-04. Number Of Trapezoidals.srt
📄 [7.11.10]–06-J-10. Probability Of Enclosin.srt
📄 [7.11.1]–06-J-01. Randomization.srt
📄 [7.11.6]–06-J-06. Time For Point Location.srt
📄 [7.11.6]–06-J-06. Time For Point Location.mp4
📄 [7.11.7]–06-J-07. Size Of Search Structur.srt
📄 [7.11.1]–06-J-01. Randomization.mp4
📄 [7.11.2]–06-J-02. Expectation.srt
📄 [7.11.3]–06-J-03. Number Of Ray Trimmed.mp4
📄 [7.11.11]–06-J-11. Query Time.srt
📄 [7.11.5]–06-J-05. Number Of Trapezoidals.srt
📄 [7.7.4]–06-F-04. Recoloring.srt
📄 [7.7.2]–06-F-02. Split.srt
📄 [7.7.2]–06-F-02. Split.mp4
📄 [7.7.1]–06-F-01. Idea.mp4
📄 [7.7.3]–06-F-03. Complexity.mp4
📄 [7.7.1]–06-F-01. Idea.srt
📄 [7.7.3]–06-F-03. Complexity.srt
📄 [7.7.4]–06-F-04. Recoloring.mp4
📄 [9.7.2]–08-G-02. Query.mp4
📄 [9.7.4]–08-G-04. Complexity.srt
📄 [9.7.2]–08-G-02. Query.srt
📄 [9.7.1]–08-G-01. Hea.srt
📄 [9.7.3]–08-G-03. Example.mp4
📄 [9.7.3]–08-G-03. Example.srt
📄 [9.7.1]–08-G-01. Hea.mp4
📄 [9.7.4]–08-G-04. Complexity.mp4
📄 [9.11.3]–08-K-03. Associative Structure.mp4
📄 [9.11.1]–08-K-01. Review.srt
📄 [9.11.4]–08-K-04. Vertical Segment Stabbi.mp4
📄 [9.11.4]–08-K-04. Vertical Segment Stabbi.srt
📄 [9.11.2]–08-K-02. X-Segment Tree.srt
📄 [9.11.2]–08-K-02. X-Segment Tree.mp4
📄 [9.11.3]–08-K-03. Associative Structure.srt
📄 [9.11.1]–08-K-01. Review.mp4
📄 [9.5.1]–08-E-01. Definition.mp4
📄 [9.5.2]–08-E-02. Interval Tree.srt
📄 [9.5.5]–08-E-05. Overview.mp4
📄 [9.5.4]–08-E-04. Query Algorithm (2).srt
📄 [9.5.2]–08-E-02. Interval Tree.mp4
📄 [9.5.6]–08-E-06. Complexity.srt
📄 [9.5.5]–08-E-05. Overview.srt
📄 [9.5.6]–08-E-06. Complexity.mp4
📄 [9.5.3]–08-E-03. Query Algorithm (1).srt
📄 [9.5.1]–08-E-01. Definition.srt
📄 [9.5.4]–08-E-04. Query Algorithm (2).mp4
📄 [9.5.3]–08-E-03. Query Algorithm (1).mp4
📄 [9.1.1]–08-A-01. Definition.mp4
📄 [9.1.2]–08-A-02. Classification.srt
📄 [9.1.2]–08-A-02. Classification.mp4
📄 [9.1.1]–08-A-01. Definition.srt
📄 [9.9.3]–08-I-03. Example (1 3).mp4
📄 [9.9.7]–08-I-07. Query Time (2 3).srt
📄 [9.9.5]–08-I-05. Example (3 3).mp4
📄 [9.9.8]–08-I-08. Query Time (3 3).mp4
📄 [9.9.4]–08-I-04. Example (2 3).srt
📄 [9.9.7]–08-I-07. Query Time (2 3).mp4
📄 [9.9.3]–08-I-03. Example (1 3).srt
📄 [9.9.8]–08-I-08. Query Time (3 3).srt
📄 [9.9.4]–08-I-04. Example (2 3).mp4
📄 [9.9.6]–08-I-06. Query Time (1 3).mp4
📄 [9.9.2]–08-I-02. Algorithm (2 2).srt
📄 [9.9.2]–08-I-02. Algorithm (2 2).mp4
📄 [9.9.1]–08-I-01. Algorithm (1 2).mp4
📄 [9.9.1]–08-I-01. Algorithm (1 2).srt
📄 [9.9.6]–08-I-06. Query Time (1 3).srt
📄 [9.9.5]–08-I-05. Example (3 3).srt
📄 [9.10.16]–08-J-16. Query Time.srt
📄 [9.10.10]–08-J-10. O(nlogn) Space.srt
📄 [9.10.9]–08-J-09. Canonical Subsets.srt
📄 [9.10.3]–08-J-03. Discretization.mp4
📄 [9.10.5]–08-J-05. BBST.srt
📄 [9.10.6]–08-J-06. Solving Stabbing Query.srt
📄 [9.10.7]–08-J-07. Worst Case.mp4
📄 [9.10.10]–08-J-10. O(nlogn) Space.mp4
📄 [9.10.12]–08-J-12. Inserting A Segment (1).mp4
📄 [9.10.13]–08-J-13. Inserting A Segment (2).srt
📄 [9.10.2]–08-J-02. Elementary Interval.srt
📄 [9.10.15]–08-J-15. Query Algorith.srt
📄 [9.10.14]–08-J-14. Inserting A Segment (3).mp4
📄 [9.10.4]–08-J-04. Worst Case.mp4
📄 [9.10.5]–08-J-05. BBST.mp4
📄 [9.10.6]–08-J-06. Solving Stabbing Query.mp4
📄 [9.10.14]–08-J-14. Inserting A Segment (3).srt
📄 [9.10.7]–08-J-07. Worst Case.srt
📄 [9.10.16]–08-J-16. Query Time.mp4
📄 [9.10.13]–08-J-13. Inserting A Segment (2).mp4
📄 [9.10.12]–08-J-12. Inserting A Segment (1).srt
📄 [9.10.1]–08-J-01. General Windowing Query.mp4
📄 [9.10.15]–08-J-15. Query Algorith.mp4
📄 [9.10.4]–08-J-04. Worst Case.srt
📄 [9.10.2]–08-J-02. Elementary Interval.mp4
📄 [9.10.9]–08-J-09. Canonical Subsets.mp4
📄 [9.10.11]–08-J-11. Constructing A Segment.mp4
📄 [9.10.8]–08-J-08. Common Ancestor.srt
📄 [9.10.3]–08-J-03. Discretization.srt
📄 [9.10.1]–08-J-01. General Windowing Query.srt
📄 [9.10.11]–08-J-11. Constructing A Segment.srt
📄 [9.10.8]–08-J-08. Common Ancestor.mp4
📄 [9.3.4]–08-C-04. Associative Lists.mp4
📄 [9.3.3]–08-C-03. Balance.srt
📄 [9.3.4]–08-C-04. Associative Lists.srt
📄 [9.3.3]–08-C-03. Balance.mp4
📄 [9.3.5]–08-C-05. Complexity.srt
📄 [9.3.1]–08-C-01. Median.mp4
📄 [9.3.2]–08-C-02. Partitioning.mp4
📄 [9.3.1]–08-C-01. Median.srt
📄 [9.3.2]–08-C-02. Partitioning.srt
📄 [9.3.5]–08-C-05. Complexity.mp4
📄 [9.2.1]–08-B-01. 1D Windowing Query.mp4
📄 [9.2.2]–08-B-02. Stabbing Query.srt
📄 [9.2.2]–08-B-02. Stabbing Query.mp4
📄 [9.2.1]–08-B-01. 1D Windowing Query.srt
📄 [9.6.4]–08-F-04. 1D-GRQ By Linear Scan.mp4
📄 [9.6.3]–08-F-03. 1D-GRQ Using Range Tree.srt
📄 [9.6.2]–08-F-02. 2D-GRQ.srt
📄 [9.6.3]–08-F-03. 1D-GRQ Using Range Tree.mp4
📄 [9.6.2]–08-F-02. 2D-GRQ.mp4
📄 [9.6.4]–08-F-04. 1D-GRQ By Linear Scan.srt
📄 [9.6.1]–08-F-01. O(n) Space.srt
📄 [9.6.1]–08-F-01. O(n) Space.mp4
📄 [5.6.6]–04-F-06. Application.srt
📄 [5.6.2]–04-F-02. Half-Edge.mp4
📄 [5.6.5]–04-F-05. True Or False.mp4
📄 [5.6.5]–04-F-05. True Or False.srt
📄 [5.6.2]–04-F-02. Half-Edge.srt
📄 [5.6.3]–04-F-03. Vertex & Face.srt
📄 [5.6.4]–04-F-04. Traversal.srt
📄 [5.6.6]–04-F-06. Application.mp4
📄 [5.6.1]–04-F-01. Twin Edges.srt
📄 [5.6.1]–04-F-01. Twin Edges.mp4
📄 [5.6.4]–04-F-04. Traversal.mp4
📄 [5.6.3]–04-F-03. Vertex & Face.mp4
📄 [9.4.1]–08-D-01. Algorithm (1).srt
📄 [9.4.1]–08-D-01. Algorithm (1).mp4
📄 [9.4.2]–08-D-02. Algorithm (2).srt
📄 [9.4.3]–08-D-03. Complexity.mp4
📄 [9.4.3]–08-D-03. Complexity.srt
📄 [9.4.2]–08-D-02. Algorithm (2).mp4
📄 [9.8.2]–08-H-02. Order Property.mp4
📄 [9.8.4]–08-H-04. Construction.mp4
📄 [9.8.3]–08-H-03. Sibling Partitioning.srt
📄 [9.8.1]–08-H-01. PST = Heap + BBST.srt
📄 [9.8.3]–08-H-03. Sibling Partitioning.mp4
📄 [9.8.4]–08-H-04. Construction.srt
📄 [9.8.1]–08-H-01. PST = Heap + BBST.mp4
📄 [9.8.2]–08-H-02. Order Property.srt
📄 [5.9.6]–04-I-06. Sorting Not Made Easier.mp4
📄 [5.9.5]–04-I-05. Case B.mp4
📄 [5.9.3]–04-I-03. Projection.mp4
📄 [5.9.1]–04-I-01. ε-Closeness.srt
📄 [5.9.2]–04-I-02. Lifting.srt
📄 [5.9.2]–04-I-02. Lifting.mp4
📄 [5.9.1]–04-I-01. ε-Closeness.mp4
📄 [5.9.5]–04-I-05. Case B.srt
📄 [5.9.4]–04-I-04. Case A.mp4
📄 [5.9.4]–04-I-04. Case A.srt
📄 [5.9.3]–04-I-03. Projection.srt
📄 [5.9.6]–04-I-06. Sorting Not Made Easier.srt
📄 [5.7.3]–04-G-03. Voronoi Diagram In Gene.mp4
📄 [5.7.1]–04-G-01. 1D Voronoi Diagra.srt
📄 [5.7.1]–04-G-01. 1D Voronoi Diagra.mp4
📄 [5.7.2]–04-G-02. 2D Voronoi Diagra.srt
📄 [5.7.2]–04-G-02. 2D Voronoi Diagra.mp4
📄 [5.7.3]–04-G-03. Voronoi Diagram In Gene.srt
📄 [5.13.8]–04-M-08. Events.srt
📄 [5.13.13]–04-M-13. Site Event How.mp4
📄 [5.13.1]–04-M-01. A First Glance.mp4
📄 [5.13.4]–04-M-04. Frozen Region.mp4
📄 [5.13.3]–04-M-03. Fortune's Trick.mp4
📄 [5.13.6]–04-M-06. Lower Envelope.srt
📄 [5.13.12]–04-M-12. Site Event What.mp4
📄 [5.13.9]–04-M-09. Circle Event What, When.mp4
📄 [5.13.2]–04-M-02. Backtracking.srt
📄 [5.13.2]–04-M-02. Backtracking.mp4
📄 [5.13.9]–04-M-09. Circle Event What, When.srt
📄 [5.13.4]–04-M-04. Frozen Region.srt
📄 [5.13.10]–04-M-10. Circle Event Why.srt
📄 [5.13.8]–04-M-08. Events.mp4
📄 [5.13.6]–04-M-06. Lower Envelope.mp4
📄 [5.13.7]–04-M-07. Break Points.srt
📄 [5.13.5]–04-M-05. Beach Line.srt
📄 [5.13.5]–04-M-05. Beach Line.mp4
📄 [5.13.13]–04-M-13. Site Event How.srt
📄 [5.13.12]–04-M-12. Site Event What.srt
📄 [5.13.11]–04-M-11. Circle Event How.mp4
📄 [5.13.1]–04-M-01. A First Glance.srt
📄 [5.13.3]–04-M-03. Fortune's Trick.srt
📄 [5.13.11]–04-M-11. Circle Event How.srt
📄 [5.13.7]–04-M-07. Break Points.mp4
📄 [5.13.10]–04-M-10. Circle Event Why.mp4
📄 [5.5.3]–04-E-03. Representing VD.mp4
📄 [5.5.2]–04-E-02. Fary's Theore.mp4
📄 [5.5.3]–04-E-03. Representing VD.srt
📄 [5.5.2]–04-E-02. Fary's Theore.srt
📄 [5.5.1]–04-E-01. Subdivision.srt
📄 [5.5.1]–04-E-01. Subdivision.mp4
📄 [5.4.2]–04-D-02. Proof.srt
📄 [5.4.2]–04-D-02. Proof.mp4
📄 [5.4.1]–04-D-01. Linearity.mp4
📄 [5.4.1]–04-D-01. Linearity.srt
📄 [5.11.1]–04-K-01. Royal Garden.mp4
📄 [5.11.3]–04-K-03. Complexity.mp4
📄 [5.11.2]–04-K-02. Disjoint Union.srt
📄 [5.11.1]–04-K-01. Royal Garden.srt
📄 [5.11.2]–04-K-02. Disjoint Union.mp4
📄 [5.11.3]–04-K-03. Complexity.srt
📄 [5.3.3]–04-C-03. Nearest = Concyclic.srt
📄 [5.3.3]–04-C-03. Nearest = Concyclic.mp4
📄 [5.3.4]–04-C-04. Number of Nearest Sites.srt
📄 [5.3.5]–04-C-05. Split & Merge.srt
📄 [5.3.2]–04-C-02. Empty Disks.srt
📄 [5.3.5]–04-C-05. Split & Merge.mp4
📄 [5.3.1]–04-C-01. Non-Empty Cells.srt
📄 [5.3.1]–04-C-01. Non-Empty Cells.mp4
📄 [5.3.2]–04-C-02. Empty Disks.mp4
📄 [5.3.4]–04-C-04. Number of Nearest Sites.mp4
📄 [5.1.3]–04-A-03. More Analogies & Applic.srt
📄 [5.1.4]–04-A-04. Voronoi.srt
📄 [5.1.2]–04-A-02. Dining Halls on Campus.srt
📄 [5.1.1]–04-A-01. A First Glance.srt
📄 [5.1.2]–04-A-02. Dining Halls on Campus.mp4
📄 [5.1.1]–04-A-01. A First Glance.mp4
📄 [5.1.4]–04-A-04. Voronoi.mp4
📄 [5.1.3]–04-A-03. More Analogies & Applic.mp4
📄 [5.8.3]–04-H-03. Voronoi Diagram As A Ge.srt
📄 [5.8.1]–04-H-01. Convex Hull Made Easier.mp4
📄 [5.8.3]–04-H-03. Voronoi Diagram As A Ge.mp4
📄 [5.8.2]–04-H-02. Convex Hull As A Combin.mp4
📄 [5.8.1]–04-H-01. Convex Hull Made Easier.srt
📄 [5.8.2]–04-H-02. Convex Hull As A Combin.srt
📄 [5.12.3]–04-L-03. Contour.srt
📄 [5.12.6]–04-L-06. Common Tangents.srt
📄 [5.12.11]–04-L-11. Avoiding Rescans.srt
📄 [5.12.3]–04-L-03. Contour.mp4
📄 [5.12.5]–04-L-05. Y-Monotonicity.srt
📄 [5.12.8]–04-L-08. Clip & Stitch.mp4
📄 [5.12.5]–04-L-05. Y-Monotonicity.mp4
📄 [5.12.10]–04-L-10. Convexity.mp4
📄 [5.12.7]–04-L-07. Contour Length.srt
📄 [5.12.7]–04-L-07. Contour Length.mp4
📄 [5.12.4]–04-L-04. Bisectors.srt
📄 [5.12.4]–04-L-04. Bisectors.mp4
📄 [5.12.2]–04-L-02. Solving Overlaps.srt
📄 [5.12.6]–04-L-06. Common Tangents.mp4
📄 [5.12.9]–04-L-09. Intersecting with Cells.srt
📄 [5.12.9]–04-L-09. Intersecting with Cells.mp4
📄 [5.12.10]–04-L-10. Convexity.srt
📄 [5.12.2]–04-L-02. Solving Overlaps.mp4
📄 [5.12.11]–04-L-11. Avoiding Rescans.mp4
📄 [5.12.8]–04-L-08. Clip & Stitch.srt
📄 [5.12.1]–04-L-01. Strategy.mp4
📄 [5.12.1]–04-L-01. Strategy.srt
📄 [5.10.1]–J. Naive Construction.srt
📄 [5.10.1]–J. Naive Construction.mp4
📄 [5.2.1]–04-B-01. Site & Cell.srt
📄 [5.2.2]–04-B-02. Intersecting Halfspaces.srt
📄 [5.2.1]–04-B-01. Site & Cell.mp4
📄 [5.2.2]–04-B-02. Intersecting Halfspaces.mp4
📄 [5.2.3]–04-B-03. Voronoi Diagra.srt
📄 [5.2.4]–04-B-04. Planar Voronoi Diagra.mp4
📄 [5.2.4]–04-B-04. Planar Voronoi Diagra.srt
📄 [5.2.3]–04-B-03. Voronoi Diagra.mp4
📄 [4.5.1]–03-D-01. Necessity of floor(n 4).mp4
📄 [4.5.2]–03-D-02. Sufficiency by Convex Q.srt
📄 [4.5.3]–03-D-03. Generalization.mp4
📄 [4.5.2]–03-D-02. Sufficiency by Convex Q.mp4
📄 [4.5.3]–03-D-03. Generalization.srt
📄 [4.5.1]–03-D-01. Necessity of floor(n 4).srt
📄 [4.3.1]–03-B-01. Necessity of floor(n 3).srt
📄 [4.3.2]–03-B-02. Sufficiency by Fan Deco.mp4
📄 [4.3.1]–03-B-01. Necessity of floor(n 3).mp4
📄 [4.3.2]–03-B-02. Sufficiency by Fan Deco.srt
📄 [4.9.2]–03-I-02. Schonhardt's Polyhedron.srt
📄 [4.9.2]–03-I-02. Schonhardt's Polyhedron.mp4
📄 [4.9.1]–03-I-01. Polyhedron Decompositio.mp4
📄 [4.9.3]–03-I-03. Seidel's Polygon.srt
📄 [4.9.3]–03-I-03. Seidel's Polygon.mp4
📄 [4.9.1]–03-I-01. Polyhedron Decompositio.srt
📄 [4.1.1]–03-0. Methodology.mp4
📄 [4.1.1]–03-0. Methodology.srt
📄 [4.4.5]–03-C-05. Generalization.mp4
📄 [4.4.4]–03-C-04. Pigeon-Hole Principle.mp4
📄 [4.4.3]–03-C-03. Domination.mp4
📄 [4.4.1]–03-C-01. Triangulation.mp4
📄 [4.4.4]–03-C-04. Pigeon-Hole Principle.srt
📄 [4.4.3]–03-C-03. Domination.srt
📄 [4.4.2]–03-C-02. 3-Coloring.srt
📄 [4.4.5]–03-C-05. Generalization.srt
📄 [4.4.2]–03-C-02. 3-Coloring.mp4
📄 [4.4.1]–03-C-01. Triangulation.srt
📄 [4.8.4]–03-G-04. Sweep-Line Status.srt
📄 [4.8.1]–03-G-01. Cusps.srt
📄 [4.8.6]–03-G-06. Example.srt
📄 [4.8.6]–03-G-06. Example.mp4
📄 [4.8.3]–03-G-03. Helper Candidate.mp4
📄 [4.8.7]–03-G-07. Analysis.srt
📄 [4.8.1]–03-G-01. Cusps.mp4
📄 [4.8.5]–03-G-05. Possible Cases.mp4
📄 [4.8.5]–03-G-05. Possible Cases.srt
📄 [4.8.7]–03-G-07. Analysis.mp4
📄 [4.8.3]–03-G-03. Helper Candidate.srt
📄 [4.8.4]–03-G-04. Sweep-Line Status.mp4
📄 [4.8.2]–03-G-02. Helper.mp4
📄 [4.8.2]–03-G-02. Helper.srt
📄 [4.6.7]–03-E-07. Well-Order (Again).mp4
📄 [4.6.6]–03-E-06. Induction.mp4
📄 [4.6.6]–03-E-06. Induction.srt
📄 [4.6.5]–03-E-05. Ear Candidate.srt
📄 [4.6.5]–03-E-05. Ear Candidate.mp4
📄 [4.6.8]–03-E-08. Properties.mp4
📄 [4.6.8]–03-E-08. Properties.srt
📄 [4.6.2]–03-E-02. Ear & Mouth.srt
📄 [4.6.4]–03-E-04. Well-Order.mp4
📄 [4.6.1]–03-E-01. Existence.mp4
📄 [4.6.1]–03-E-01. Existence.srt
📄 [4.6.3]–03-E-03. Two-Ear Theore.mp4
📄 [4.6.4]–03-E-04. Well-Order.srt
📄 [4.6.2]–03-E-02. Ear & Mouth.mp4
📄 [4.6.7]–03-E-07. Well-Order (Again).srt
📄 [4.6.3]–03-E-03. Two-Ear Theore.srt
📄 [4.7.3]–03-F-03. Strategy.srt
📄 [4.7.8]–03-F-08. Example.srt
📄 [4.7.3]–03-F-03. Strategy.mp4
📄 [4.7.9]–03-F-09. Analysis.mp4
📄 [4.7.5]–03-F-05. Same Side + Reflex.srt
📄 [4.7.4]–03-F-04. Stack-Chain Consistency.srt
📄 [4.7.7]–03-F-07. Opposite Side.mp4
📄 [4.7.5]–03-F-05. Same Side + Reflex.mp4
📄 [4.7.9]–03-F-09. Analysis.srt
📄 [4.7.6]–03-F-06. Same Side + Convex.srt
📄 [4.7.1]–03-F-01. Monotone Polygon.srt
📄 [4.7.4]–03-F-04. Stack-Chain Consistency.mp4
📄 [4.7.6]–03-F-06. Same Side + Convex.mp4
📄 [4.7.7]–03-F-07. Opposite Side.srt
📄 [4.7.2]–03-F-02. Monotonicity Testing.srt
📄 [4.7.8]–03-F-08. Example.mp4
📄 [4.7.1]–03-F-01. Monotone Polygon.mp4
📄 [4.7.2]–03-F-02. Monotonicity Testing.mp4
📄 [4.2.1]–03-A-01. Definition.srt
📄 [4.2.2]–03-A-02. Lower & Upper Bounds.srt
📄 [4.2.4]–03-A-04. Approximation & Classif.srt
📄 [4.2.1]–03-A-01. Definition.mp4
📄 [4.2.3]–03-A-03. Hardness.srt
📄 [4.2.4]–03-A-04. Approximation & Classif.mp4
📄 [4.2.2]–03-A-02. Lower & Upper Bounds.mp4
📄 [4.2.3]–03-A-03. Hardness.mp4
📄 [8.8.3]–07-H-03. Query Time.mp4
📄 [8.8.4]–07-H-04. Beyond 2D.srt
📄 [8.8.3]–07-H-03. Query Time.srt
📄 [8.8.4]–07-H-04. Beyond 2D.mp4
📄 [8.8.2]–07-H-02. Preprocessing Time.srt
📄 [8.8.2]–07-H-02. Preprocessing Time.mp4
📄 [8.8.1]–07-H-01. Storage.srt
📄 [8.8.1]–07-H-01. Storage.mp4
📄 [8.1.2]–07-A-02. Brute-force.srt
📄 [8.1.1]–07-A-01. 1-Dimensional Range Que.mp4
📄 [8.1.5]–07-A-05. Planar Range Query.mp4
📄 [8.1.4]–07-A-04. Output Sensitivity.mp4
📄 [8.1.3]–07-A-03. Binary Search.srt
📄 [8.1.3]–07-A-03. Binary Search.mp4
📄 [8.1.4]–07-A-04. Output Sensitivity.srt
📄 [8.1.1]–07-A-01. 1-Dimensional Range Que.srt
📄 [8.1.2]–07-A-02. Brute-force.mp4
📄 [8.1.5]–07-A-05. Planar Range Query.srt
📄 [8.2.2]–07-B-02. Lowest Common Ancestor.srt
📄 [8.2.3]–07-B-03. Query Algorith.mp4
📄 [8.2.1]–07-B-01. Structure.srt
📄 [8.2.1]–07-B-01. Structure.mp4
📄 [8.2.2]–07-B-02. Lowest Common Ancestor.mp4
📄 [8.2.4]–07-B-04. Complexity (1).mp4
📄 [8.2.4]–07-B-04. Complexity (1).srt
📄 [8.2.5]–07-B-05. Complexity (2).mp4
📄 [8.2.3]–07-B-03. Query Algorith.srt
📄 [8.2.5]–07-B-05. Complexity (2).srt
📄 [8.6.3]–07-F-03. x-Query y-Queries.mp4
📄 [8.6.1]–07-F-01. x-Query + y-Query.mp4
📄 [8.6.2]–07-F-02. Worst Case.srt
📄 [8.6.2]–07-F-02. Worst Case.mp4
📄 [8.6.1]–07-F-01. x-Query + y-Query.srt
📄 [8.6.3]–07-F-03. x-Query y-Queries.srt
📄 [8.5.1]–07-E-01. Preprocessing Time + St.mp4
📄 [8.5.2]–07-E-02. Query Time.srt
📄 [8.5.2]–07-E-02. Query Time.mp4
📄 [8.5.3]–07-E-03. Beyond 2D.srt
📄 [8.5.1]–07-E-01. Preprocessing Time + St.srt
📄 [8.5.3]–07-E-03. Beyond 2D.mp4
📄 [8.3.1]–07-C-01. 2d-Tree.mp4
📄 [8.3.4]–07-C-04. Example.srt
📄 [8.3.1]–07-C-01. 2d-Tree.srt
📄 [8.3.4]–07-C-04. Example.mp4
📄 [8.3.3]–07-C-03. Construction.srt
📄 [8.3.2]–07-C-02. Example.mp4
📄 [8.3.5]–07-C-05. Canonical Subsets.mp4
📄 [8.3.2]–07-C-02. Example.srt
📄 [8.3.5]–07-C-05. Canonical Subsets.srt
📄 [8.3.3]–07-C-03. Construction.mp4
📄 [8.9.2]–07-I-02. Coherence.mp4
📄 [8.9.4]–07-I-04. Fractional Cascading.srt
📄 [8.9.3]–07-I-03. Idea.mp4
📄 [8.9.1]–07-I-01. Y-Lists.srt
📄 [8.9.2]–07-I-02. Coherence.srt
📄 [8.9.3]–07-I-03. Idea.srt
📄 [8.9.4]–07-I-04. Fractional Cascading.mp4
📄 [8.9.5]–07-I-05. Complexity.mp4
📄 [8.9.5]–07-I-05. Complexity.srt
📄 [8.9.1]–07-I-01. Y-Lists.mp4
📄 [8.7.1]–07-G-01. Painters' Strategy.mp4
📄 [8.7.4]–07-G-04. Algorith.srt
📄 [8.7.3]–07-G-03. Y-Trees.srt
📄 [8.7.1]–07-G-01. Painters' Strategy.srt
📄 [8.7.2]–07-G-02. X-Tree.mp4
📄 [8.7.2]–07-G-02. X-Tree.srt
📄 [8.7.3]–07-G-03. Y-Trees.mp4
📄 [8.7.4]–07-G-04. Algorith.mp4
📄 [8.4.1]–07-D-01. Query.mp4
📄 [8.4.1]–07-D-01. Query.srt
📄 [8.4.2]–07-D-02. Example.srt
📄 [8.4.2]–07-D-02. Example.mp4
📄 [8.4.3]–07-D-03. Optimization.srt
📄 [8.4.3]–07-D-03. Optimization.mp4
