Loading...
Uploaded by KhaMichel on May 22, 2008
Decomposition of an incremental delaunay triangulation on a sphere using flip operation.Data structure is a DCEL + heap for picking the largest triangle and adding a point in the middle.PS : xvidcap + opengl = teh fail
Science & Technology
Standard YouTube License
Load more suggestions
Link to this comment:
All Comments (0)