Professor:Tsai-Yen Li
Date:2020-04-28
views: 583
  • 01:02 1.
    Geometric Reasoning and Applications: Orthogonal Range Searching
  • 01:54 2.
    Orthogonal Range Searching
  • 03:57 3.
    Interpret DB Queries Geometrically
  • 04:38 4.
    1-D Range Searching (I)
  • 03:56 5.
    1-D Range Searching (II)
  • 05:32 6.
    Finding the Split Node
  • 02:58 7.
    1D Range Query Algorithm (I)
  • 11:40 8.
    1D Range Query Algorithm (II)
  • 03:34 9.
    1D-Range Search Algorithm: Analysis
  • 00:59 10.
    Kd-Trees (I)
  • 01:10 11.
    Kd-Trees (I)
  • 04:33 12.
    Kd-Trees (II)
  • 03:24 13.
    The BuildKDTree Algorithm
  • 00:25 14.
    The BuildKDTree Algorithm
  • 13:01 15.
    Construction Time Analysis
  • 03:24 16.
    Querying on a kd-Tree (I)
  • 10:32 17.
    Querying on a kd-Tree (II)
  • 00:34 18.
    Querying on a kd-Tree (II)
  • 00:39 19.
    Querying on a kd-Tree (III)
  • 02:40 20.
    The SearchKDTree Algorithm
  • 07:26 21.
    2D KD-Tree Query Time Analysis
  • 01:06 22.
    KD-Tree Query Time Analysis
  • 00:13 23.
    Basics of Range Trees
  • 02:39 24.
    Basics of Range Trees
  • 04:00 25.
    Range Trees
  • 01:45 26.
    Example of Range Tree
  • 03:16 27.
    The Build2DRangeTree Algorithm
  • 00:26 28.
    The 2DRangeQuery Algorithm (I)
  • 01:32 29.
    The 2DRangeQuery Algorithm (II)
  • 09:11 30.
    Range Tree Algorithm Analysis
  • 01:49 31.
    Range Tree in Higher Dimensions
  • 03:17 32.
    General Sets of Points
  • 10:17 33.
    Basics of Fractional Cascading (I)
  • 01:16 34.
    Basics of Fractional Cascading (II)
  • 04:23 35.
    Fractional Cascading Algorithm Analysis
  • Index
  • Notes
  • Fullscreen
gra05
Duration: 2:13:26, Browse: 583, Last Updated: 2020-04-28
    • 01:02 1.
      Geometric Reasoning and Applications: Orthogonal Range Searching
    • 01:54 2.
      Orthogonal Range Searching
    • 03:57 3.
      Interpret DB Queries Geometrically
    • 04:38 4.
      1-D Range Searching (I)
    • 03:56 5.
      1-D Range Searching (II)
    • 05:32 6.
      Finding the Split Node
    • 02:58 7.
      1D Range Query Algorithm (I)
    • 11:40 8.
      1D Range Query Algorithm (II)
    • 03:34 9.
      1D-Range Search Algorithm: Analysis
    • 00:59 10.
      Kd-Trees (I)
    • 01:10 11.
      Kd-Trees (I)
    • 04:33 12.
      Kd-Trees (II)
    • 03:24 13.
      The BuildKDTree Algorithm
    • 00:25 14.
      The BuildKDTree Algorithm
    • 13:01 15.
      Construction Time Analysis
    • 03:24 16.
      Querying on a kd-Tree (I)
    • 10:32 17.
      Querying on a kd-Tree (II)
    • 00:34 18.
      Querying on a kd-Tree (II)
    • 00:39 19.
      Querying on a kd-Tree (III)
    • 02:40 20.
      The SearchKDTree Algorithm
    • 07:26 21.
      2D KD-Tree Query Time Analysis
    • 01:06 22.
      KD-Tree Query Time Analysis
    • 00:13 23.
      Basics of Range Trees
    • 02:39 24.
      Basics of Range Trees
    • 04:00 25.
      Range Trees
    • 01:45 26.
      Example of Range Tree
    • 03:16 27.
      The Build2DRangeTree Algorithm
    • 00:26 28.
      The 2DRangeQuery Algorithm (I)
    • 01:32 29.
      The 2DRangeQuery Algorithm (II)
    • 09:11 30.
      Range Tree Algorithm Analysis
    • 01:49 31.
      Range Tree in Higher Dimensions
    • 03:17 32.
      General Sets of Points
    • 10:17 33.
      Basics of Fractional Cascading (I)
    • 01:16 34.
      Basics of Fractional Cascading (II)
    • 04:23 35.
      Fractional Cascading Algorithm Analysis
    Location
    Folder name
    資科系 李蔡彥老師
    Author
    李蔡彥
    Branch
    nccu
    Created
    2020-04-28 09:10:10
    Last Updated
    2020-04-28 11:20:04
    Browse
    583
    Duration
    2:13:26