Description: Triangulation of simple polygon in computer graphics and three-dimensional reconstruction to study the problem has wide application areas. According to the definition of a simple polygon and triangulation principle, a simple polygon triangulation algorithm, the algorithm for determining whether a between the vertex and edge location-based implementation of a simple polygon triangulation algorithm is simple and easy to understand for any triangulation of simple polygon
To Search:
File list (Check if you may need any files):
testDelaunay\Debug\MainFrm.obj
............\.....\StdAfx.obj
............\.....\testDelaunay.exe
............\.....\testDelaunay.ilk
............\.....\testDelaunay.obj
............\.....\testDelaunay.pch
............\.....\testDelaunay.pdb
............\.....\testDelaunay.res
............\.....\testDelaunayDoc.obj
............\.....\testDelaunayView.obj
............\.....\vc60.idb
............\.....\vc60.pdb
............\debug.txt
............\MainFrm.cpp
............\MainFrm.h
............\ReadMe.txt
............\res\testDelaunay.ico
............\...\testDelaunay.rc2
............\...\testDelaunayDoc.ico
............\...\Toolbar.bmp
............\Resource.h
............\StdAfx.cpp
............\StdAfx.h
............\testDelaunay.aps
............\testDelaunay.clw
............\testDelaunay.cpp
............\testDelaunay.dsp
............\testDelaunay.dsw
............\testDelaunay.h
............\testDelaunay.ncb
............\testDelaunay.opt
............\testDelaunay.plg
............\testDelaunay.rc
............\testDelaunayDoc.cpp
............\testDelaunayDoc.h
............\testDelaunayView.cpp
............\testDelaunayView.h
............\Debug
............\res
testDelaunay
Download