Professor:Tsai-Yen Li
Date:2021-12-23
views: 1001
  • 00:00 1.
    Geometric Reasoning and Applications: Binary Space Partitioning and Quadtree
  • 00:38 2.
    Binary Space Partitionings: Introduction
  • 08:09 3.
    An Example of BSP
  • 11:52 4.
    Definition of BSP Trees
  • 13:03 5.
    An Example of BSP
  • 13:49 6.
    Definition of BSP Trees
  • 14:20 7.
    Auto-Partitioning
  • 16:32 8.
    Painter’s Algorithm
  • 21:06 9.
    Auto-Partitioning
  • 21:06 10.
    Definition of BSP Trees
  • 21:07 11.
    An Example of BSP
  • 22:08 12.
    Definition of BSP Trees
  • 22:09 13.
    Auto-Partitioning
  • 22:09 14.
    Painter’s Algorithm
  • 23:48 15.
    Auto-Partitioning
  • 23:48 16.
    Definition of BSP Trees
  • 23:49 17.
    An Example of BSP
  • 24:29 18.
    Definition of BSP Trees
  • 24:29 19.
    Auto-Partitioning
  • 24:31 20.
    Painter’s Algorithm
  • 24:57 21.
    Constructing a BSP Tree
  • 28:07 22.
    Constructing a BSP Tree
  • 31:04 23.
    Algorithm Analysis
  • 40:32 24.
    Quadtrees: Introduction
  • 48:26 25.
    Uniform and Non-Uniform Meshes
  • 51:27 26.
    Desired Properties of Triangle Meshes
  • 53:42 27.
    Definition of Quadtree
  • 56:17 28.
    Quadtree Construction for Point Sets
  • 58:49 29.
    Data Structure Analysis
  • 1:06:54 30.
    Neighbor Finding Operation
  • 1:07:15 31.
    Data Structure Analysis
  • 1:09:02 32.
    Neighbor Finding Operation
  • 1:14:13 33.
    Neighbor Finding Algorithm
  • 1:19:15 34.
    Definition of Balanced Quadtree
  • 1:22:09 35.
    BalanceQuadTree Algorithm
  • 1:27:43 36.
    Implementation and Complexity for Building a Balanced Quadtree
  • 1:32:46 37.
    Mesh Generation
  • 1:42:40 38.
    GenerateMesh(S)
  • 1:52:12 39.
    Mesh Generation
  • 1:52:13 40.
    Implementation and Complexity for Building a Balanced Quadtree
  • 1:52:13 41.
    BalanceQuadTree Algorithm
  • 1:52:13 42.
    Definition of Balanced Quadtree
  • 1:52:14 43.
    Neighbor Finding Algorithm
  • 1:52:14 44.
    Neighbor Finding Operation
  • 1:52:14 45.
    Data Structure Analysis
  • 1:52:15 46.
    Quadtree Construction for Point Sets
  • 1:52:15 47.
    Definition of Quadtree
  • 1:52:15 48.
    Desired Properties of Triangle Meshes
  • 1:52:16 49.
    Uniform and Non-Uniform Meshes
  • 1:52:16 50.
    Quadtrees: Introduction
  • 1:54:45 51.
    GenerateMesh(S)
  • Index
  • Notes
  • Fullscreen
gra11
Duration: 2:01:46, Browse: 1002, Last Updated: 2021-12-23
    • 00:00 1.
      Geometric Reasoning and Applications: Binary Space Partitioning and Quadtree
    • 00:38 2.
      Binary Space Partitionings: Introduction
    • 08:09 3.
      An Example of BSP
    • 11:52 4.
      Definition of BSP Trees
    • 13:03 5.
      An Example of BSP
    • 13:49 6.
      Definition of BSP Trees
    • 14:20 7.
      Auto-Partitioning
    • 16:32 8.
      Painter’s Algorithm
    • 21:06 9.
      Auto-Partitioning
    • 21:06 10.
      Definition of BSP Trees
    • 21:07 11.
      An Example of BSP
    • 22:08 12.
      Definition of BSP Trees
    • 22:09 13.
      Auto-Partitioning
    • 22:09 14.
      Painter’s Algorithm
    • 23:48 15.
      Auto-Partitioning
    • 23:48 16.
      Definition of BSP Trees
    • 23:49 17.
      An Example of BSP
    • 24:29 18.
      Definition of BSP Trees
    • 24:29 19.
      Auto-Partitioning
    • 24:31 20.
      Painter’s Algorithm
    • 24:57 21.
      Constructing a BSP Tree
    • 28:07 22.
      Constructing a BSP Tree
    • 31:04 23.
      Algorithm Analysis
    • 40:32 24.
      Quadtrees: Introduction
    • 48:26 25.
      Uniform and Non-Uniform Meshes
    • 51:27 26.
      Desired Properties of Triangle Meshes
    • 53:42 27.
      Definition of Quadtree
    • 56:17 28.
      Quadtree Construction for Point Sets
    • 58:49 29.
      Data Structure Analysis
    • 1:06:54 30.
      Neighbor Finding Operation
    • 1:07:15 31.
      Data Structure Analysis
    • 1:09:02 32.
      Neighbor Finding Operation
    • 1:14:13 33.
      Neighbor Finding Algorithm
    • 1:19:15 34.
      Definition of Balanced Quadtree
    • 1:22:09 35.
      BalanceQuadTree Algorithm
    • 1:27:43 36.
      Implementation and Complexity for Building a Balanced Quadtree
    • 1:32:46 37.
      Mesh Generation
    • 1:42:40 38.
      GenerateMesh(S)
    • 1:52:12 39.
      Mesh Generation
    • 1:52:13 40.
      Implementation and Complexity for Building a Balanced Quadtree
    • 1:52:13 41.
      BalanceQuadTree Algorithm
    • 1:52:13 42.
      Definition of Balanced Quadtree
    • 1:52:14 43.
      Neighbor Finding Algorithm
    • 1:52:14 44.
      Neighbor Finding Operation
    • 1:52:14 45.
      Data Structure Analysis
    • 1:52:15 46.
      Quadtree Construction for Point Sets
    • 1:52:15 47.
      Definition of Quadtree
    • 1:52:15 48.
      Desired Properties of Triangle Meshes
    • 1:52:16 49.
      Uniform and Non-Uniform Meshes
    • 1:52:16 50.
      Quadtrees: Introduction
    • 1:54:45 51.
      GenerateMesh(S)
    Location
    Folder name
    資科系 李蔡彥老師
    Author
    李蔡彥
    Branch
    nccu
    Created
    2021-12-23 11:48:08
    Last Updated
    2021-12-23 12:15:30
    Duration
    2:01:46