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