清华大学邓俊辉教授《计算几何》- 学堂在线精品课程
├─{1}--00 Introduction
│├─{1}--Before we start
││ #1.1.1#--html.pdf
││
│├─{2}--Evaluation
││ #1.2.1#--html.pdf
││
│├─{3}--Online Judge
││ #1.3.1#--html.pdf
││
│├─{4}--Lecture notes
││ #1.4.1#--html.pdf
││
│├─{5}--Discussion
││ #1.5.1#--html.pdf
││
│├─{6}--A History of This Course
││ --00-A. History of This Course.mp4
││ --00-A. History of This Course.srt
││
│├─{7}--B What's Computational Geometry
││ --00-B. What's Computational Geome.mp4
││ --00-B. What's Computational Geome.srt
││
│├─{8}--C How to Learn CG Better
││ --00-C. How to Learn CG Better.mp4
││ --00-C. How to Learn CG Better.srt
││
│└─{9}--D Why English
│ --00-D. Why English.mp4
│ --00-D. Why English.srt
│
├─{2}--01 Convex Hull
│├─{10}--J Graham Scan Analysis
││ --01-J-01. Ω(n) Backtracks.mp4
││ --01-J-01. Ω(n) Backtracks.srt
││ --01-J-02. Planarity.mp4
││ --01-J-02. Planarity.srt
││ --01-J-03. Amortization.mp4
││ --01-J-03. Amortization.srt
││ --01-J-04. Simplification.mp4
││ --01-J-04. Simplification.srt
││
│├─{11}--K Divide-And-Conquer (1)
││ --01-K-01. Merge.mp4
││ --01-K-01. Merge.srt
││ --01-K-02. Common Kernel.mp4
││ --01-K-02. Common Kernel.srt
││ --01-K-03. Interior.mp4
││ --01-K-03. Interior.srt
││ --01-K-04. Exterior.mp4
││ --01-K-04. Exterior.srt
││
│├─{12}--L Divide-And-Conquer (2)
││ --01-L-01. Preprocessing.mp4
││ --01-L-01. Preprocessing.srt
││ --01-L-02. Common Tangents.mp4
││ --01-L-02. Common Tangents.srt
││ --01-L-03. Topmost + Bottommost.mp4
││ --01-L-03. Topmost + Bottommost.srt
││ --01-L-04. Stitch.mp4
││ --01-L-04. Stitch.srt
││ --01-L-05. Zig-Zag.mp4
││ --01-L-05. Zig-Zag.srt
││ --01-L-06. Time Cost.mp4
││ --01-L-06. Time Cost.srt
││ --01-L-07. More Considerations.mp4
││ --01-L-07. More Considerations.srt
││
│├─{13}--M Wrap-Up
││ --01-M. Wrap-U.mp4
││ --01-M. Wrap-U.srt
││
│├─{1}--A Convexity
││ --01-A-01. Why Convex Hull.mp4
││ --01-A-01. Why Convex Hull.srt
││ --01-A-02. Nails In The Table.mp4
││ --01-A-02. Nails In The Table.srt
││ --01-A-03. Paint Blending.mp4
││ --01-A-03. Paint Blending.srt
││ --01-A-04. Color Space.mp4
││ --01-A-04. Color Space.srt
││ --01-A-05. Convex Hull.mp4
││ --01-A-05. Convex Hull.srt
││
│├─{2}--B Extreme Points
││ --01-B-01. Extremity.mp4
││ --01-B-01. Extremity.srt
││ --01-B-02. Strategy.mp4
││ --01-B-02. Strategy.srt
││ --01-B-03. In-Triangle Test.mp4
││ --01-B-03. In-Triangle Test.srt
││ --01-B-04. To-Left Test.mp4
││ --01-B-04. To-Left Test.srt
││ --01-B-05. Determinant.mp4
││ --01-B-05. Determinant.srt
││
│├─{3}--C Extreme Edges
││ --01-C-01. Definition.mp4
││ --01-C-01. Definition.srt
││ --01-C-02. Algorith.mp4
││ --01-C-02. Algorith.srt
││ --01-C-03. Demonstration.mp4
││ --01-C-03. Demonstration.srt
││
│├─{4}--D Incremental Construction
││ --01-D-01. Decrease and Conquer.mp4
││ --01-D-01. Decrease and Conquer.srt
││ --01-D-02. In-Convex-Polygon Test.mp4
││ --01-D-02. In-Convex-Polygon Test.srt
││ --01-D-03. Why Not Binary Search.mp4
││ --01-D-03. Why Not Binary Search.srt
││ --01-D-04. Support-Lines.mp4
││ --01-D-04. Support-Lines.srt
││ --01-D-05. Pattern Of Turns.mp4
││ --01-D-05. Pattern Of Turns.srt
││ --01-D-06. Exterior Interior.mp4
││ --01-D-06. Exterior Interior.srt
││
│├─{5}--E Jarvis March
││ --01-E-01. Selectionsort.mp4
││ --01-E-01. Selectionsort.srt
││ --01-E-02. Strategy.mp4
││ --01-E-02. Strategy.srt
││ --01-E-03. Coherence.mp4
││ --01-E-03. Coherence.srt
││ --01-E-04. To-Left Test.mp4
││ --01-E-04. To-Left Test.srt
││ --01-E-05. Degeneracy.mp4
││ --01-E-05. Degeneracy.srt
││ --01-E-06. Lowest-Then-Leftmost.mp4
││ --01-E-06. Lowest-Then-Leftmost.srt
││ --01-E-07. Implementation.mp4
││ --01-E-07. Implementation.srt
││ --01-E-08. Output Sensitivity.mp4
││ --01-E-08. Output Sensitivity.srt
││
│├─{6}--F Lower Bound
││ --01-F-01. Reduction.mp4
││ --01-F-01. Reduction.srt
││ --01-F-02. CAO Chong's Methodology.mp4
││ --01-F-02. CAO Chong's Methodology.srt
││ --01-F-03. Transitivity.mp4
││ --01-F-03. Transitivity.srt
││ --01-F-04. Reduction Input.mp4
││ --01-F-04. Reduction Input.srt
││ --01-F-05. Reduction Output.mp4
││ --01-F-05. Reduction Output.srt
││ --01-F-06. Sorting ≤_N 2d-CH.mp4
││ --01-F-06. Sorting ≤_N 2d-CH.srt
││
│├─{7}--G Graham Scan Algorithm
││ --01-G-01. Preprocessing.mp4
││ --01-G-01. Preprocessing.srt
││ --01-G-02. Scan.mp4
││ --01-G-02. Scan.srt
││ --01-G-03. Simplest Cases.mp4
││ --01-G-03. Simplest Cases.srt
││
│├─{8}--H Graham Scan Example
││ --01-H-01. Example (1 2).mp4
││ --01-H-01. Example (1 2).srt
││ --01-H-02. Example (2 2).mp4
││ --01-H-02. Example (2 2).srt
││
│└─{9}--I Graham Scan Correctness
│ --01-I-01. Left Turn.mp4
│ --01-I-01. Left Turn.srt
│ --01-I-02. Right Turn.mp4
│ --01-I-02. Right Turn.srt
│ --01-I-03. Presorting.mp4
│ --01-I-03. Presorting.srt
│
├─{3}--02 Geometric Intersection
│├─{10}--I Plane Sweeping
││ --02-I. Plane Sweeping.mp4
││ --02-I. Plane Sweeping.srt
││
│├─{11}--J Halfplane Intersection Constru
││ --02-J-01. The Proble.mp4
││ --02-J-01. The Proble.srt
││ --02-J-02. Lower Bound.mp4
││ --02-J-02. Lower Bound.srt
││ --02-J-03. Divide-And-Conquer.mp4
││ --02-J-03. Divide-And-Conquer.srt
││
│├─{1}--0 Introduction
││ --02-0. Introduction.mp4
││ --02-0. Introduction.srt
││
│├─{2}--A Preliminary
││ --02-A-01. EU.mp4
││ --02-A-01. EU.srt
││ --02-A-02. Min-Ga.mp4
││ --02-A-02. Min-Ga.srt
││ --02-A-03. Max-Ga.mp4
││ --02-A-03. Max-Ga.srt
││ --02-A-04. IEU.mp4
││ --02-A-04. IEU.srt
││
│├─{3}--B Interval Intersection Detectio
││ --02-B-01. Algorith.mp4
││ --02-B-01. Algorith.srt
││ --02-B-02. Lower Bound.mp4
││ --02-B-02. Lower Bound.srt
││
│├─{4}--C Segment Intersection Reporting
││ --02-C-01. Brute-force.mp4
││ --02-C-01. Brute-force.srt
││ --02-C-02. Hardness.mp4
││ --02-C-02. Hardness.srt
││
│├─{5}--D BO Algorithm Strategy
││ --02-D-01. Proximity & Separabilit.mp4
││ --02-D-01. Proximity & Separabilit.srt
││ --02-D-02. Comparability & Orderin.mp4
││ --02-D-02. Comparability & Orderin.srt
││ --02-D-03. Data Structures.mp4
││ --02-D-03. Data Structures.srt
││ --02-D-04. Possible Cases.mp4
││ --02-D-04. Possible Cases.srt
││
│├─{6}--E BO Algorithm Implementation
││ --02-E-01. Degeneracy.mp4
││ --02-E-01. Degeneracy.srt
││ --02-E-02. Event Queue.mp4
││ --02-E-02. Event Queue.srt
││ --02-E-03. Events & Operations.mp4
││ --02-E-03. Events & Operations.srt
││ --02-E-04. Sweepline Status.mp4
││ --02-E-04. Sweepline Status.srt
││
│├─{7}--F BO Algorithm Analysis
││ --02-F-01. Correctness.mp4
││ --02-F-01. Correctness.srt
││ --02-F-02. Example.mp4
││ --02-F-02. Example.srt
││ --02-F-03. Retesting.mp4
││ --02-F-03. Retesting.srt
││ --02-F-04. Complexity of Event Que.mp4
││ --02-F-04. Complexity of Event Que.srt
││ --02-F-05. Complexity of Status St.mp4
││ --02-F-05. Complexity of Status St.srt
││
│├─{8}--G Convex Polygon Intersection De
││ --02-G-01. Problem Specification.mp4
││ --02-G-01. Problem Specification.srt
││ --02-G-02. Monotone Partitioning.mp4
││ --02-G-02. Monotone Partitioning.srt
││ --02-G-03. Criterion.mp4
││ --02-G-03. Criterion.srt
││ --02-G-04. Decrease-And-Conquer.mp4
││ --02-G-04. Decrease-And-Conquer.srt
││ --02-G-05. Example Cases.mp4
││ --02-G-05. Example Cases.srt
││ --02-G-06. Complexity.mp4
││ --02-G-06. Complexity.srt
││
│└─{9}--H Edge Chasing
│ --02-H-01. Eliminating Sickles.mp4
│ --02-H-01. Eliminating Sickles.srt
│ --02-H-02. Example.mp4
│ --02-H-02. Example.srt
│ --02-H-03. Analysis.mp4
│ --02-H-03. Analysis.srt
│
├─{4}--03 Triangulation
│├─{1}--0 Methodology
││ --03-0. Methodology.mp4
││ --03-0. Methodology.srt
││
│├─{2}--A Art Gallery Problem
││ --03-A-01. Definition.mp4
││ --03-A-01. Definition.srt
││ --03-A-02. Lower & Upper Bounds.mp4
││ --03-A-02. Lower & Upper Bounds.srt
││ --03-A-03. Hardness.mp4
││ --03-A-03. Hardness.srt
││ --03-A-04. Approximation & Classif.mp4
││ --03-A-04. Approximation & Classif.srt
││
│├─{3}--B Art Gallery Theorem
││ --03-B-01. Necessity of floor(n 3).mp4
││ --03-B-01. Necessity of floor(n 3).srt
││ --03-B-02. Sufficiency by Fan Deco.mp4
││ --03-B-02. Sufficiency by Fan Deco.srt
││
│├─{4}--C Fisk's Proof
││ --03-C-01. Triangulation.mp4
││ --03-C-01. Triangulation.srt
││ --03-C-02. 3-Coloring.mp4
││ --03-C-02. 3-Coloring.srt
││ --03-C-03. Domination.mp4
││ --03-C-03. Domination.srt
││ --03-C-04. Pigeon-Hole Principle.mp4
││ --03-C-04. Pigeon-Hole Principle.srt
││ --03-C-05. Generalization.mp4
││ --03-C-05. Generalization.srt
││
│├─{5}--D Orthogonal Polygons
││ --03-D-01. Necessity of floor(n 4).mp4
││ --03-D-01. Necessity of floor(n 4).srt
││ --03-D-02. Sufficiency by Convex Q.mp4
││ --03-D-02. Sufficiency by Convex Q.srt
││ --03-D-03. Generalization.mp4
││ --03-D-03. Generalization.srt
││
│├─{6}--E Triangulation
││ --03-E-01. Existence.mp4
││ --03-E-01. Existence.srt
││ --03-E-02. Ear & Mouth.mp4
││ --03-E-02. Ear & Mouth.srt
││ --03-E-03. Two-Ear Theore.mp4
││ --03-E-03. Two-Ear Theore.srt
││ --03-E-04. Well-Order.mp4
││ --03-E-04. Well-Order.srt
││ --03-E-05. Ear Candidate.mp4
││ --03-E-05. Ear Candidate.srt
││ --03-E-06. Induction.mp4
││ --03-E-06. Induction.srt
││ --03-E-07. Well-Order (Again).mp4
││ --03-E-07. Well-Order (Again).srt
││ --03-E-08. Properties.mp4
││ --03-E-08. Properties.srt
││
│├─{7}--F Triangulating Monotone Polygon
││ --03-F-01. Monotone Polygon.mp4
││ --03-F-01. Monotone Polygon.srt
││ --03-F-02. Monotonicity Testing.mp4
││ --03-F-02. Monotonicity Testing.srt
││ --03-F-03. Strategy.mp4
││ --03-F-03. Strategy.srt
││ --03-F-04. Stack-Chain Consistency.mp4
││ --03-F-04. Stack-Chain Consistency.srt
││ --03-F-05. Same Side + Reflex.mp4
││ --03-F-05. Same Side + Reflex.srt
││ --03-F-06. Same Side + Convex.mp4
││ --03-F-06. Same Side + Convex.srt
││ --03-F-07. Opposite Side.mp4
││ --03-F-07. Opposite Side.srt
││ --03-F-08. Example.mp4
││ --03-F-08. Example.srt
││ --03-F-09. Analysis.mp4
││ --03-F-09. Analysis.srt
││
│├─{8}--G Monotone Decomposition
││ --03-G-01. Cusps.mp4
││ --03-G-01. Cusps.srt
││ --03-G-02. Helper.mp4
││ --03-G-02. Helper.srt
││ --03-G-03. Helper Candidate.mp4
││ --03-G-03. Helper Candidate.srt
││ --03-G-04. Sweep-Line Status.mp4
││ --03-G-04. Sweep-Line Status.srt
││ --03-G-05. Possible Cases.mp4
││ --03-G-05. Possible Cases.srt
││ --03-G-06. Example.mp4
││ --03-G-06. Example.srt
││ --03-G-07. Analysis.mp4
││ --03-G-07. Analysis.srt
││
│└─{9}--I Tetrahedralization
│ --03-I-01. Polyhedron Decompositio.mp4
│ --03-I-01. Polyhedron Decompositio.srt
│ --03-I-02. Schonhardt's Polyhedron.mp4
│ --03-I-02. Schonhardt's Polyhedron.srt
│ --03-I-03. Seidel's Polygon.mp4
│ --03-I-03. Seidel's Polygon.srt
│
├─{5}--04 Voronoi Diagram
│├─{10}--J Naive Construction
││ --J. Naive Construction.mp4
││ --J. Naive Construction.srt
││
│├─{11}--K Incremental Construction
││ --04-K-01. Royal Garden.mp4
││ --04-K-01. Royal Garden.srt
││ --04-K-02. Disjoint Union.mp4
││ --04-K-02. Disjoint Union.srt
││ --04-K-03. Complexity.mp4
││ --04-K-03. Complexity.srt
││
│├─{12}--L Divide-And-Conquer
││ --04-L-10. Convexity.mp4
││ --04-L-10. Convexity.srt
││ --04-L-11. Avoiding Rescans.mp4
││ --04-L-11. Avoiding Rescans.srt
││ --04-L-01. Strategy.mp4
││ --04-L-01. Strategy.srt
││ --04-L-02. Solving Overlaps.mp4
││ --04-L-02. Solving Overlaps.srt
││ --04-L-03. Contour.mp4
││ --04-L-03. Contour.srt
││ --04-L-04. Bisectors.mp4
││ --04-L-04. Bisectors.srt
││ --04-L-05. Y-Monotonicity.mp4
││ --04-L-05. Y-Monotonicity.srt
││ --04-L-06. Common Tangents.mp4
││ --04-L-06. Common Tangents.srt
││ --04-L-07. Contour Length.mp4
││ --04-L-07. Contour Length.srt
││ --04-L-08. Clip & Stitch.mp4
││ --04-L-08. Clip & Stitch.srt
││ --04-L-09. Intersecting with Cells.mp4
││ --04-L-09. Intersecting with Cells.srt
││
│├─{13}--M Plane-Sweep
││ --04-M-10. Circle Event Why.mp4
││ --04-M-10. Circle Event Why.srt
││ --04-M-11. Circle Event How.mp4
││ --04-M-11. Circle Event How.srt
││ --04-M-12. Site Event What.mp4
││ --04-M-12. Site Event What.srt
││ --04-M-13. Site Event How.mp4
││ --04-M-13. Site Event How.srt
││ --04-M-01. A First Glance.mp4
││ --04-M-01. A First Glance.srt
││ --04-M-02. Backtracking.mp4
││ --04-M-02. Backtracking.srt
││ --04-M-03. Fortune's Trick.mp4
││ --04-M-03. Fortune's Trick.srt
││ --04-M-04. Frozen Region.mp4
││ --04-M-04. Frozen Region.srt
││ --04-M-05. Beach Line.mp4
││ --04-M-05. Beach Line.srt
││ --04-M-06. Lower Envelope.mp4
││ --04-M-06. Lower Envelope.srt
││ --04-M-07. Break Points.mp4
││ --04-M-07. Break Points.srt
││ --04-M-08. Events.mp4
││ --04-M-08. Events.srt
││ --04-M-09. Circle Event What, When.mp4
││ --04-M-09. Circle Event What, When.srt
││
│├─{1}--A Introduction
││ --04-A-01. A First Glance.mp4
││ --04-A-01. A First Glance.srt
││ --04-A-02. Dining Halls on Campus.mp4
││ --04-A-02. Dining Halls on Campus.srt
││ --04-A-03. More Analogies & Applic.mp4
││ --04-A-03. More Analogies & Applic.srt
││ --04-A-04. Voronoi.mp4
││ --04-A-04. Voronoi.srt
││
│├─{2}--B Terminologies
││ --04-B-01. Site & Cell.mp4
││ --04-B-01. Site & Cell.srt
││ --04-B-02. Intersecting Halfspaces.mp4
││ --04-B-02. Intersecting Halfspaces.srt
││ --04-B-03. Voronoi Diagra.mp4
││ --04-B-03. Voronoi Diagra.srt
││ --04-B-04. Planar Voronoi Diagra.mp4
││ --04-B-04. Planar Voronoi Diagra.srt
││
│├─{3}--C Properties
││ --04-C-01. Non-Empty Cells.mp4
││ --04-C-01. Non-Empty Cells.srt
││ --04-C-02. Empty Disks.mp4
││ --04-C-02. Empty Disks.srt
││ --04-C-03. Nearest = Concyclic.mp4
││ --04-C-03. Nearest = Concyclic.srt
││ --04-C-04. Number of Nearest Sites.mp4
││ --04-C-04. Number of Nearest Sites.srt
││ --04-C-05. Split & Merge.mp4
││ --04-C-05. Split & Merge.srt
││
│├─{4}--D Complexity
││ --04-D-01. Linearity.mp4
││ --04-D-01. Linearity.srt
││ --04-D-02. Proof.mp4
││ --04-D-02. Proof.srt
││
│├─{5}--E Representation
││ --04-E-01. Subdivision.mp4
││ --04-E-01. Subdivision.srt
││ --04-E-02. Fary's Theore.mp4
││ --04-E-02. Fary's Theore.srt
││ --04-E-03. Representing VD.mp4
││ --04-E-03. Representing VD.srt
││
│├─{6}--F DCEL
││ --04-F-01. Twin Edges.mp4
││ --04-F-01. Twin Edges.srt
││ --04-F-02. Half-Edge.mp4
││ --04-F-02. Half-Edge.srt
││ --04-F-03. Vertex & Face.mp4
││ --04-F-03. Vertex & Face.srt
││ --04-F-04. Traversal.mp4
││ --04-F-04. Traversal.srt
││ --04-F-05. True Or False.mp4
││ --04-F-05. True Or False.srt
││ --04-F-06. Application.mp4
││ --04-F-06. Application.srt
││
│├─{7}--G Hardness
││ --04-G-01. 1D Voronoi Diagra.mp4
││ --04-G-01. 1D Voronoi Diagra.srt
││ --04-G-02. 2D Voronoi Diagra.mp4
││ --04-G-02. 2D Voronoi Diagra.srt
││ --04-G-03. Voronoi Diagram In Gene.mp4
││ --04-G-03. Voronoi Diagram In Gene.srt
││
│├─{8}--H Sorted Sets
││ --04-H-01. Convex Hull Made Easier.mp4
││ --04-H-01. Convex Hull Made Easier.srt
││ --04-H-02. Convex Hull As A Combin.mp4
││ --04-H-02. Convex Hull As A Combin.srt
││ --04-H-03. Voronoi Diagram As A Ge.mp4
││ --04-H-03. Voronoi Diagram As A Ge.srt
││
│└─{9}--I VD_sorted
│ --04-I-01. ε-Closeness.mp4
│ --04-I-01. ε-Closeness.srt
│ --04-I-02. Lifting.mp4
│ --04-I-02. Lifting.srt
│ --04-I-03. Projection.mp4
│ --04-I-03. Projection.srt
│ --04-I-04. Case A.mp4
│ --04-I-04. Case A.srt
│ --04-I-05. Case B.mp4
│ --04-I-05. Case B.srt
│ --04-I-06. Sorting Not Made Easier.mp4
│ --04-I-06. Sorting Not Made Easier.srt
│
├─{6}--05 Delaunay Triangulation
│├─{10}--J Randomized Incremental Constru
││ --05-J-01. Recursive Implementatio.mp4
││ --05-J-01. Recursive Implementatio.srt
││ --05-J-02. Iterative Implementatio.mp4
││ --05-J-02. Iterative Implementatio.srt
││ --05-J-03. In-Circle Test.mp4
││ --05-J-03. In-Circle Test.srt
││ --05-J-04. Point Location.mp4
││ --05-J-04. Point Location.srt
││
│├─{11}--K RIC Analysis
││ --05-K-10. Further Consideration.mp4
││ --05-K-10. Further Consideration.srt
││ --05-K-01. Time Cost.mp4
││ --05-K-01. Time Cost.srt
││ --05-K-02. Backward Analysis.mp4
││ --05-K-02. Backward Analysis.srt
││ --05-K-03. Preconditions.mp4
││ --05-K-03. Preconditions.srt
││ --05-K-04. Types Of Edge Change.mp4
││ --05-K-04. Types Of Edge Change.srt
││ --05-K-05. Number Of Edge Changes.mp4
││ --05-K-05. Number Of Edge Changes.srt
││ --05-K-06. Average Degree.mp4
││ --05-K-06. Average Degree.srt
││ --05-K-07. Number Of Rebucketings.mp4
││ --05-K-07. Number Of Rebucketings.srt
││ --05-K-08. Probability For Rebucke.mp4
││ --05-K-08. Probability For Rebucke.srt
││ --05-K-09. Expectation.mp4
││ --05-K-09. Expectation.srt
││
│├─{1}--A Point Set Triangulation
││ --05-A-01. Definition.mp4
││ --05-A-01. Definition.srt
││ --05-A-02. Edge Flipping.mp4
││ --05-A-02. Edge Flipping.srt
││ --05-A-03. Upper Bound.mp4
││ --05-A-03. Upper Bound.srt
││ --05-A-04. Lower Bound.mp4
││ --05-A-04. Lower Bound.srt
││
│├─{2}--B Delaunay Triangulation
││ --05-B-01. Dual Graph.mp4
││ --05-B-01. Dual Graph.srt
││ --05-B-02. Triangulation.mp4
││ --05-B-02. Triangulation.srt
││ --05-B-03. Hardness.mp4
││ --05-B-03. Hardness.srt
││ --05-B-04. History.mp4
││ --05-B-04. History.srt
││
│├─{3}--C Properties
││ --05-C-01. Empty Circumcircle.mp4
││ --05-C-01. Empty Circumcircle.srt
││ --05-C-02. Empty Circle.mp4
││ --05-C-02. Empty Circle.srt
││ --05-C-03. Nearest Neighbor.mp4
││ --05-C-03. Nearest Neighbor.srt
││ --05-C-04. Complexity.mp4
││ --05-C-04. Complexity.srt
││
│├─{4}--D Proximity Graph
││ --05-D-01. Gabriel Graph.mp4
││ --05-D-01. Gabriel Graph.srt
││ --05-D-02. Relative Neighborhood G.mp4
││ --05-D-02. Relative Neighborhood G.srt
││ --05-D-03. Lower Bounds.mp4
││ --05-D-03. Lower Bounds.srt
││
│├─{5}--E Euclidean Minimum Spanning Tre
││ --05-E-01. Definition.mp4
││ --05-E-01. Definition.srt
││ --05-E-02. Construction.mp4
││ --05-E-02. Construction.srt
││ --05-E-03. Subgraph of RNG.mp4
││ --05-E-03. Subgraph of RNG.srt
││ --05-E-04. Example.mp4
││ --05-E-04. Example.srt
││
│├─{6}--F Euclidean Traveling Salesman P
││ --05-F-01. Definition.mp4
││ --05-F-01. Definition.srt
││ --05-F-02. NP-Hardness.mp4
││ --05-F-02. NP-Hardness.srt
││ --05-F-03. Approximation.mp4
││ --05-F-03. Approximation.srt
││
│├─{7}--G Minimum Weighted Triangulation
││ --05-G-01. Definition.mp4
││ --05-G-01. Definition.srt
││ --05-G-02. Counter-Example.mp4
││ --05-G-02. Counter-Example.srt
││ --05-G-03. Hardness.mp4
││ --05-G-03. Hardness.srt
││
│├─{8}--H Construction
││ --05-H-01. Subtended Arc.mp4
││ --05-H-01. Subtended Arc.srt
││ --05-H-02. Angle Vector.mp4
││ --05-H-02. Angle Vector.srt
││ --05-H-03. Maximizing The Minimu.mp4
││ --05-H-03. Maximizing The Minimu.srt
││ --05-H-04. Evolution By Edge Fli.mp4
││ --05-H-04. Evolution By Edge Fli.srt
││ --05-H-05. Strategies.mp4
││ --05-H-05. Strategies.srt
││
│└─{9}--I RIC With Example
│ --05-I-01. Idea.mp4
│ --05-I-01. Idea.srt
│ --05-I-02. Point Location.mp4
│ --05-I-02. Point Location.srt
│ --05-I-03. In-Circle Test.mp4
│ --05-I-03. In-Circle Test.srt
│ --05-I-04. Edge Flipping.mp4
│ --05-I-04. Edge Flipping.srt
│ --05-I-05. Frontier.mp4
│ --05-I-05. Frontier.srt
│ --05-I-06. Convergence.mp4
│ --05-I-06. Convergence.srt
│
├─{7}--06 Point Location
│├─{10}--I Constructing Trapezoidal Map
││ --06-I-01. Initialization.mp4
││ --06-I-01. Initialization.srt
││ --06-I-02. Iteration.mp4
││ --06-I-02. Iteration.srt
││ --06-I-03. Challenges.mp4
││ --06-I-03. Challenges.srt
││ --06-I-04. Case 1 Two Endpoints.mp4
││ --06-I-04. Case 1 Two Endpoints.srt
││ --06-I-05. Case 2 One Endpoint.mp4
││ --06-I-05. Case 2 One Endpoint.srt
││ --06-I-06. Case 3 No Endpoints.mp4
││ --06-I-06. Case 3 No Endpoints.srt
││ --06-I-07. Example.mp4
││ --06-I-07. Example.srt
││
│├─{11}--J Performance Of Trapezoidal Map
││ --06-J-10. Probability Of Enclosin.mp4
││ --06-J-10. Probability Of Enclosin.srt
││ --06-J-11. Query Time.mp4
││ --06-J-11. Query Time.srt
││ --06-J-01. Randomization.mp4
││ --06-J-01. Randomization.srt
││ --06-J-02. Expectation.mp4
││ --06-J-02. Expectation.srt
││ --06-J-03. Number Of Ray Trimmed.mp4
││ --06-J-03. Number Of Ray Trimmed.srt
││ --06-J-04. Number Of Trapezoidals.mp4
││ --06-J-04. Number Of Trapezoidals.srt
││ --06-J-05. Number Of Trapezoidals.mp4
││ --06-J-05. Number Of Trapezoidals.srt
││ --06-J-06. Time For Point Location.mp4
││ --06-J-06. Time For Point Location.srt
││ --06-J-07. Size Of Search Structur.mp4
││ --06-J-07. Size Of Search Structur.srt
││ --06-J-08. Fixed Query Point + Ran.mp4
││ --06-J-08. Fixed Query Point + Ran.srt
││ --06-J-09. Each Single Ste.mp4
││ --06-J-09. Each Single Ste.srt
││
│├─{1}--0 OnlineOffline Algorithms
││ --06-0. OnlineOffline Algorithms.mp4
││ --06-0. OnlineOffline Algorithms.srt
││
│├─{2}--A Introduction
││ --06-A-01. Where Am I.mp4
││ --06-A-01. Where Am I.srt
││ --06-A-02. Point Location.mp4
││ --06-A-02. Point Location.srt
││ --06-A-03. Assumptions For Clarity.mp4
││ --06-A-03. Assumptions For Clarity.srt
││ --06-A-04. Input Size.mp4
││ --06-A-04. Input Size.srt
││ --06-A-05. Performance Measurement.mp4
││ --06-A-05. Performance Measurement.srt
││ --06-A-06. A Global View.mp4
││ --06-A-06. A Global View.srt
││
│├─{3}--B Slab Method
││ --06-B-01. Slab Decomposition.mp4
││ --06-B-01. Slab Decomposition.srt
││ --06-B-02. Ordering Trapezoids.mp4
││ --06-B-02. Ordering Trapezoids.srt
││ --06-B-03. Tree of Trees.mp4
││ --06-B-03. Tree of Trees.srt
││ --06-B-04. Example.mp4
││ --06-B-04. Example.srt
││ --06-B-05. Query Time.mp4
││ --06-B-05. Query Time.srt
││ --06-B-06. Preprocessing Time.mp4
││ --06-B-06. Preprocessing Time.srt
││ --06-B-07. Storage Cost.mp4
││ --06-B-07. Storage Cost.srt
││ --06-B-08. Worst Case.mp4
││ --06-B-08. Worst Case.srt
││
│├─{4}--C Persistence
││ --06-C-01. Ephemeral Structure.mp4
││ --06-C-01. Ephemeral Structure.srt
││ --06-C-02. Persistent Structure.mp4
││ --06-C-02. Persistent Structure.srt
││ --06-C-03. Persistent Slabs.mp4
││ --06-C-03. Persistent Slabs.srt
││
│├─{5}--D Path Copying
││ --06-D-01. Strategy.mp4
││ --06-D-01. Strategy.srt
││ --06-D-02. X-Search.mp4
││ --06-D-02. X-Search.srt
││ --06-D-03. Storage Optimization.mp4
││ --06-D-03. Storage Optimization.srt
││
│├─{6}--E Node Copying
││ --06-E-01. O(1) Rotation.mp4
││ --06-E-01. O(1) Rotation.srt
││ --06-E-02. Strategy.mp4
││ --06-E-02. Strategy.srt
││ --06-E-03. Why Red-Black.mp4
││ --06-E-03. Why Red-Black.srt
││ --06-E-04. Linear Space.mp4
││ --06-E-04. Linear Space.srt
││ --06-E-05. Time Penalty.mp4
││ --06-E-05. Time Penalty.srt
││
│├─{7}--F Limited Node Copying
││ --06-F-01. Idea.mp4
││ --06-F-01. Idea.srt
││ --06-F-02. Split.mp4
││ --06-F-02. Split.srt
││ --06-F-03. Complexity.mp4
││ --06-F-03. Complexity.srt
││ --06-F-04. Recoloring.mp4
││ --06-F-04. Recoloring.srt
││
│├─{8}--G Kirkpatrick Structure
││ --06-G-10. Construction Of Indepen.mp4
││ --06-G-10. Construction Of Indepen.srt
││ --06-G-11. DAG.mp4
││ --06-G-11. DAG.srt
││ --06-G-01. Optimal And Simpler.mp4
││ --06-G-01. Optimal And Simpler.srt
││ --06-G-02. Triangulation.mp4
││ --06-G-02. Triangulation.srt
││ --06-G-03. Example.mp4
││ --06-G-03. Example.srt
││ --06-G-04. Hierarchy.mp4
││ --06-G-04. Hierarchy.srt
││ --06-G-05. Independent Subset.mp4
││ --06-G-05. Independent Subset.srt
││ --06-G-06. The More The Better.mp4
││ --06-G-06. The More The Better.srt
││ --06-G-07. The Fewer The Better.mp4
││ --06-G-07. The Fewer The Better.srt
││ --06-G-08. Degree.mp4
││ --06-G-08. Degree.srt
││ --06-G-09. Existence Of Independen.mp4
││ --06-G-09. Existence Of Independen.srt
││
│└─{9}--H Trapezoidal Map
│ --06-H-01. Ray Shooting.mp4
│ --06-H-01. Ray Shooting.srt
│ --06-H-02. Decomposition.mp4
│ --06-H-02. Decomposition.srt
│ --06-H-03. Properties & Complexity.mp4
│ --06-H-03. Properties & Complexity.srt
│ --06-H-04. Search Structure Exampl.mp4
│ --06-H-04. Search Structure Exampl.srt
│ --06-H-05. Search Structure Nodes.mp4
│ --06-H-05. Search Structure Nodes.srt
│ --06-H-06. Search Structure Perfor.mp4
│ --06-H-06. Search Structure Perfor.srt
│
├─{8}--07 Geometric Range Search
│├─{1}--A Range Query
││ --07-A-01. 1-Dimensional Range Que.mp4
││ --07-A-01. 1-Dimensional Range Que.srt
││ --07-A-02. Brute-force.mp4
││ --07-A-02. Brute-force.srt
││ --07-A-03. Binary Search.mp4
││ --07-A-03. Binary Search.srt
││ --07-A-04. Output Sensitivity.mp4
││ --07-A-04. Output Sensitivity.srt
││ --07-A-05. Planar Range Query.mp4
││ --07-A-05. Planar Range Query.srt
││
│├─{2}--B BBST
││ --07-B-01. Structure.mp4
││ --07-B-01. Structure.srt
││ --07-B-02. Lowest Common Ancestor.mp4
││ --07-B-02. Lowest Common Ancestor.srt
││ --07-B-03. Query Algorith.mp4
││ --07-B-03. Query Algorith.srt
││ --07-B-04. Complexity (1).mp4
││ --07-B-04. Complexity (1).srt
││ --07-B-05. Complexity (2).mp4
││ --07-B-05. Complexity (2).srt
││
│├─{3}--C kd-Tree Structure
││ --07-C-01. 2d-Tree.mp4
││ --07-C-01. 2d-Tree.srt
││ --07-C-02. Example.mp4
││ --07-C-02. Example.srt
││ --07-C-03. Construction.mp4
││ --07-C-03. Construction.srt
││ --07-C-04. Example.mp4
││ --07-C-04. Example.srt
││ --07-C-05. Canonical Subsets.mp4
││ --07-C-05. Canonical Subsets.srt
││
│├─{4}--D kd-Tree Algorithm
││ --07-D-01. Query.mp4
││ --07-D-01. Query.srt
││ --07-D-02. Example.mp4
││ --07-D-02. Example.srt
││ --07-D-03. Optimization.mp4
││ --07-D-03. Optimization.srt
││
│├─{5}--E kd-Tree Performance
││ --07-E-01. Preprocessing Time + St.mp4
││ --07-E-01. Preprocessing Time + St.srt
││ --07-E-02. Query Time.mp4
││ --07-E-02. Query Time.srt
││ --07-E-03. Beyond 2D.mp4
││ --07-E-03. Beyond 2D.srt
││
│├─{6}--F Range Tree Structure
││ --07-F-01. x-Query + y-Query.mp4
││ --07-F-01. x-Query + y-Query.srt
││ --07-F-02. Worst Case.mp4
││ --07-F-02. Worst Case.srt
││ --07-F-03. x-Query y-Queries.mp4
││ --07-F-03. x-Query y-Queries.srt
││
..................
**** Hidden Message *****
这个帖一般般，还可以哦。 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！ 啥也不说了，感谢楼主分享哇！
页:
[1]
2