講者：Tsai-Yen Li
日期：2020-06-07
觀看: 980
  • 00:00 1.
    Geometric Reasoning and Applications: Binary Space Partitioning and Quadtree
  • 02:17 2.
    Binary Space Partitionings: Introduction
  • 13:15 3.
    An Example of BSP
  • 17:13 4.
    Definition of BSP Trees
  • 19:19 5.
    Auto-Partitioning
  • 23:40 6.
    Painter’s Algorithm
  • 23:53 7.
    Auto-Partitioning
  • 24:05 8.
    Painter’s Algorithm
  • 32:09 9.
    Constructing a BSP Tree
  • 34:39 10.
    Constructing a BSP Tree
  • 38:04 11.
    Algorithm Analysis
  • 49:06 12.
    Quadtrees: Introduction
  • 59:35 13.
    Uniform and Non-Uniform Meshes
  • 1:03:09 14.
    Desired Properties of Triangle Meshes
  • 1:06:25 15.
    Definition of Quadtree
  • 1:08:06 16.
    Quadtree Construction for Point Sets
  • 1:09:34 17.
    Data Structure Analysis
  • 1:17:05 18.
    Neighbor Finding Operation
  • 1:18:51 19.
    Data Structure Analysis
  • 1:19:36 20.
    Neighbor Finding Operation
  • 1:20:18 21.
    Data Structure Analysis
  • 1:21:02 22.
    Neighbor Finding Operation
  • 1:22:31 23.
    Neighbor Finding Algorithm
  • 1:28:41 24.
    Definition of Balanced Quadtree
  • 1:31:00 25.
    BalanceQuadTree Algorithm
  • 1:34:44 26.
    Implementation and Complexity for Building a Balanced Quadtree
  • 1:38:13 27.
    Data Structure Analysis
  • 1:39:33 28.
    BalanceQuadTree Algorithm
  • 1:39:45 29.
    Implementation and Complexity for Building a Balanced Quadtree
  • 1:42:23 30.
    Mesh Generation
  • 1:44:39 31.
    GenerateMesh(S)
  • 索引
  • 筆記
  • 全螢幕
gra11
長度: 1:55:11, 瀏覽: 981, 最近修訂: 2020-06-07
    上一篇 下一篇
    • 00:00 1.
      Geometric Reasoning and Applications: Binary Space Partitioning and Quadtree
    • 02:17 2.
      Binary Space Partitionings: Introduction
    • 13:15 3.
      An Example of BSP
    • 17:13 4.
      Definition of BSP Trees
    • 19:19 5.
      Auto-Partitioning
    • 23:40 6.
      Painter’s Algorithm
    • 23:53 7.
      Auto-Partitioning
    • 24:05 8.
      Painter’s Algorithm
    • 32:09 9.
      Constructing a BSP Tree
    • 34:39 10.
      Constructing a BSP Tree
    • 38:04 11.
      Algorithm Analysis
    • 49:06 12.
      Quadtrees: Introduction
    • 59:35 13.
      Uniform and Non-Uniform Meshes
    • 1:03:09 14.
      Desired Properties of Triangle Meshes
    • 1:06:25 15.
      Definition of Quadtree
    • 1:08:06 16.
      Quadtree Construction for Point Sets
    • 1:09:34 17.
      Data Structure Analysis
    • 1:17:05 18.
      Neighbor Finding Operation
    • 1:18:51 19.
      Data Structure Analysis
    • 1:19:36 20.
      Neighbor Finding Operation
    • 1:20:18 21.
      Data Structure Analysis
    • 1:21:02 22.
      Neighbor Finding Operation
    • 1:22:31 23.
      Neighbor Finding Algorithm
    • 1:28:41 24.
      Definition of Balanced Quadtree
    • 1:31:00 25.
      BalanceQuadTree Algorithm
    • 1:34:44 26.
      Implementation and Complexity for Building a Balanced Quadtree
    • 1:38:13 27.
      Data Structure Analysis
    • 1:39:33 28.
      BalanceQuadTree Algorithm
    • 1:39:45 29.
      Implementation and Complexity for Building a Balanced Quadtree
    • 1:42:23 30.
      Mesh Generation
    • 1:44:39 31.
      GenerateMesh(S)
    位置
    1. 知識庫
    2. ...
    3. 資科系 李蔡彥老師
    資料夾名稱
    資科系 李蔡彥老師
    發表人
    李蔡彥
    單位
    nccu
    建立
    2020-06-07 21:28:59
    最近修訂
    2020-06-07 23:25:21
    長度
    1:55:11
    © Copyright since 2016 by NATIONAL CHENGCHI UNIVERSITY
    All rights reserved.