Professor:Tsai-Yen Li
Date:2020-05-19
views: 1063
  • 00:00 1.
    Geometric Reasoning and Applications: Delaunay Triangulation
  • 00:15 2.
    Delaunay Triangulation
  • 03:05 3.
    Problem of Triangulating a Terrain
  • 05:56 4.
    Triangulations of Planar Point Sets
  • 11:55 5.
    Basic Properties (I)
  • 14:19 6.
    Basic Properties (II)
  • 17:24 7.
    Basic Properties (III)
  • 19:27 8.
    Legal Triangulation
  • 21:14 9.
    LegalTriangulation(T)
  • 22:13 10.
    Voronoi Diagram and Dual Graph
  • 24:31 11.
    Dual Graph and Delaunay Graph
  • 26:18 12.
    Delaunay Graph and Triangulation
  • 27:45 13.
    Basic Properties of Delaunay Triangulations (I)
  • 30:30 14.
    Basic Properties of Delaunay Triangulations (II)
  • 31:46 15.
    Computing Delaunay Triangulation
  • 34:27 16.
    Two Cases When Adding a Point pr
  • 36:35 17.
    DelaunayTriangulation(P)
  • 40:10 18.
    DelaunayTriangulation(P)
  • 42:12 19.
    LegalizeEdge(pr , pi pj , T)
  • 47:14 20.
    Find Triangle Containing Pr
  • 50:37 21.
    Maintaining Data Structure D
  • 53:34 22.
    Maintaining Data Structure D
  • 54:50 23.
    How to Pick a Big Triangle
  • 57:03 24.
    Algorithm Analysis
  • Index
  • Notes
  • Fullscreen
gra09
Duration: 1:02:24, Browse: 1064, Last Updated: 2020-05-19
    • 00:00 1.
      Geometric Reasoning and Applications: Delaunay Triangulation
    • 00:15 2.
      Delaunay Triangulation
    • 03:05 3.
      Problem of Triangulating a Terrain
    • 05:56 4.
      Triangulations of Planar Point Sets
    • 11:55 5.
      Basic Properties (I)
    • 14:19 6.
      Basic Properties (II)
    • 17:24 7.
      Basic Properties (III)
    • 19:27 8.
      Legal Triangulation
    • 21:14 9.
      LegalTriangulation(T)
    • 22:13 10.
      Voronoi Diagram and Dual Graph
    • 24:31 11.
      Dual Graph and Delaunay Graph
    • 26:18 12.
      Delaunay Graph and Triangulation
    • 27:45 13.
      Basic Properties of Delaunay Triangulations (I)
    • 30:30 14.
      Basic Properties of Delaunay Triangulations (II)
    • 31:46 15.
      Computing Delaunay Triangulation
    • 34:27 16.
      Two Cases When Adding a Point pr
    • 36:35 17.
      DelaunayTriangulation(P)
    • 40:10 18.
      DelaunayTriangulation(P)
    • 42:12 19.
      LegalizeEdge(pr , pi pj , T)
    • 47:14 20.
      Find Triangle Containing Pr
    • 50:37 21.
      Maintaining Data Structure D
    • 53:34 22.
      Maintaining Data Structure D
    • 54:50 23.
      How to Pick a Big Triangle
    • 57:03 24.
      Algorithm Analysis
    Location
    Folder name
    資科系 李蔡彥老師
    Author
    李蔡彥
    Branch
    nccu
    Created
    2020-05-19 21:06:49
    Last Updated
    2020-05-19 23:56:15
    Duration
    1:02:24