Professor:Tsai-Yen Li
Date:2020-06-01
views: 903
  • 00:00 1.
    Geometric Reasoning and Applications: Geometric Data Structures
  • 00:35 2.
    Geometric Data Structures (I)
  • 03:46 3.
    Geometric Data Structure (II)
  • 07:31 4.
    Orthogonal Window Queries
  • 12:35 5.
    Classification of Segments for xmid (I)
  • 16:46 6.
    Classification of Segments for xmid (II)
  • 22:11 7.
    Classification of Segments for xmid (I)
  • 23:19 8.
    Interval Trees
  • 25:41 9.
    Example of Interval Tree
  • 30:05 10.
    Algorithm ConstructIntervalTree(I)
  • 32:32 11.
    Algorithm QueryIntervalTree(v, qx)
  • 34:58 12.
    Segment Query in an Interval Tree
  • 35:05 13.
    Segment Query in an Interval Tree
  • 39:09 14.
    Algorithm Analysis
  • 43:32 15.
    Priority Search Trees
  • 51:17 16.
    Example of Priority Search Tree
  • 53:14 17.
    Definition of Priority Search Trees
  • 57:01 18.
    ReportInSubTree(v, qx)
  • 1:03:34 19.
    Querying a Priority Search Tree
  • 1:05:38 20.
    QueryPrioSearchTree(T,(-:qx]x[qy:qy’])
  • 1:06:55 21.
    Algorithm Analysis
  • 1:08:36 22.
    Segment Tree Data Structures (I)
  • 1:11:40 23.
    Example of Segment Tree
  • 1:16:32 24.
    Segment Tree Data Structures (II)
  • 1:23:30 25.
    Segment Tree Data Structures (II)
  • 1:25:58 26.
    QuerySegmentTree(v, qx)
  • 1:29:36 27.
    Example of Segment Tree
  • 1:34:51 28.
    QuerySegmentTree(v, qx)
  • 1:35:19 29.
    Constructing Segment Trees
  • 1:37:01 30.
    InsertSegmentTree(v, [x:x’])
  • 1:41:19 31.
    Example of Segment Tree
  • 1:44:33 32.
    Algorithm Analysis
  • Index
  • Notes
  • Fullscreen
gra10
Duration: 2:11:11, Browse: 904, Last Updated: 2020-06-01
    • 00:00 1.
      Geometric Reasoning and Applications: Geometric Data Structures
    • 00:35 2.
      Geometric Data Structures (I)
    • 03:46 3.
      Geometric Data Structure (II)
    • 07:31 4.
      Orthogonal Window Queries
    • 12:35 5.
      Classification of Segments for xmid (I)
    • 16:46 6.
      Classification of Segments for xmid (II)
    • 22:11 7.
      Classification of Segments for xmid (I)
    • 23:19 8.
      Interval Trees
    • 25:41 9.
      Example of Interval Tree
    • 30:05 10.
      Algorithm ConstructIntervalTree(I)
    • 32:32 11.
      Algorithm QueryIntervalTree(v, qx)
    • 34:58 12.
      Segment Query in an Interval Tree
    • 35:05 13.
      Segment Query in an Interval Tree
    • 39:09 14.
      Algorithm Analysis
    • 43:32 15.
      Priority Search Trees
    • 51:17 16.
      Example of Priority Search Tree
    • 53:14 17.
      Definition of Priority Search Trees
    • 57:01 18.
      ReportInSubTree(v, qx)
    • 1:03:34 19.
      Querying a Priority Search Tree
    • 1:05:38 20.
      QueryPrioSearchTree(T,(-:qx]x[qy:qy’])
    • 1:06:55 21.
      Algorithm Analysis
    • 1:08:36 22.
      Segment Tree Data Structures (I)
    • 1:11:40 23.
      Example of Segment Tree
    • 1:16:32 24.
      Segment Tree Data Structures (II)
    • 1:23:30 25.
      Segment Tree Data Structures (II)
    • 1:25:58 26.
      QuerySegmentTree(v, qx)
    • 1:29:36 27.
      Example of Segment Tree
    • 1:34:51 28.
      QuerySegmentTree(v, qx)
    • 1:35:19 29.
      Constructing Segment Trees
    • 1:37:01 30.
      InsertSegmentTree(v, [x:x’])
    • 1:41:19 31.
      Example of Segment Tree
    • 1:44:33 32.
      Algorithm Analysis
    Location
    Folder name
    資科系 李蔡彥老師
    Author
    李蔡彥
    Branch
    nccu
    Created
    2020-06-01 15:48:33
    Last Updated
    2020-06-01 18:00:17
    Duration
    2:11:11