Description: I have written triangulation algorithm. Discrete points on the triangular net generation, the traditional Delaunay triangulation to improve the procedures, speed can also be. Members exchange.
To Search:
- [createDelaunay] - Construction of Delaunay Triangulation V
- [Delaunay_Product] - Delaunay triangulation to generate the u
- [polygen2tri] - Implementation of the complex plane [inc
- [data] - Triangular mesh generation, the use of d
File list (Check if you may need any files):
docking_zyb
...........\Debug
...........\QQHideWnd.aps
...........\QQHideWnd.clw
...........\QQHideWnd.cpp
...........\QQHideWnd.dsp
...........\QQHideWnd.dsw
...........\QQHideWnd.h
...........\QQHideWnd.ncb
...........\QQHideWnd.opt
...........\QQHideWnd.plg
...........\QQHideWnd.rc
...........\QQHideWndDlg.cpp
...........\QQHideWndDlg.h
...........\ReadMe.txt
...........\Release
...........\res
...........\...\ColorButton_Normal.bmp
...........\...\MinButton_Down.bmp
...........\...\MinButton_Hover.bmp
...........\...\MinButton_Normal.bmp
...........\...\QQHideWnd.ico
...........\...\QQHideWnd.rc2
...........\Resource.h
...........\StdAfx.cpp
...........\StdAfx.h