Windows下编译Triangle
前言
将我几年前还是“小小小白”时（目前将自己定义为“小白”），编译Triangle库时的场景记录了下来，那时候算是才开始接触开源项目，很多东西都不懂，本着一颗不会不懂就瞎折腾的精神，一路走来，之前在cnblog自己的另一个账号也记录过，现在这个新注册的号，买了会员，手动搬了过来。仅以此祭奠下这几年逝去的时光。
下载源码
http://www.cs.cmu.edu/~quake/triangle.html
解压
说明
showme是基于LINUX下的X11开发的，在windows下无法正常运行使，所以实际上用到的，也就是如下两个文件
编译
环境
win10
vs2017
新建解决方案
添加现有项，并删除原来项
修改项目属性
初次编译，报错
修改头文件
#ifndef _TRIANGLE_HEADER_
#define _TRIANGLE_HEADER_
#ifdef _cplusplus
extern "C" {
#endif
#define REAL double
#define ANSI_DECLARATORS
#define VOID int
#include "triangle.h"
//_____________________________________________________________
//原来代码
//_____________________________________________________________
#ifdef _cplusplus
}
#endif//_cplusplus
#endif//_TRIANGLE_HEADER_
再次编译
修改源文件
再次编译
添加预处理器
再次运行
修改源文件
再次编译
至此debug编译成功
编译release
修改release下的项目属性
复制拷贝lib和头文件
复制头文件至C:\Shared_Folders\VCPKG_201912_installed_x64\include\triangle，注意此时复制的是修改后的头文件
复制C:\Users\Administrator\Documents\Visual Studio 2017\Projects\libTriangle\x64\Debug\libTriangle.lib
至
C:\Shared_Folders\VCPKG_201912_installed_x64\debug\lib\libTriangled.lib
（注意重命名，加以区别release与debug）
复制C:\Users\Administrator\Documents\Visual Studio 2017\Projects\libTriangle\x64\Release\libTriangle.lib
至
C:\Shared_Folders\VCPKG_201912_installed_x64\lib\libTriangle.lib
在目标项目里调用编译好的静态库
运行调用测试代码
struct triangulateio in, mid, out, vorout;
/* Define input points. */
in.numberofpoints = 4;
in.numberofpointattributes = 1;
in.pointlist = (REAL *)malloc(in.numberofpoints * 2 * sizeof(REAL));
in.pointlist[0] = 0.0;
in.pointlist[1] = 0.0;
in.pointlist[2] = 1.0;
in.pointlist[3] = 0.0;
in.pointlist[4] = 1.0;
in.pointlist[5] = 10.0;
in.pointlist[6] = 0.0;
in.pointlist[7] = 10.0;
in.pointattributelist = (REAL *)malloc(in.numberofpoints *
in.numberofpointattributes *
sizeof(REAL));
in.pointattributelist[0] = 0.0;
in.pointattributelist[1] = 1.0;
in.pointattributelist[2] = 11.0;
in.pointattributelist[3] = 10.0;
in.pointmarkerlist = (int *)malloc(in.numberofpoints * sizeof(int));
in.pointmarkerlist[0] = 0;
in.pointmarkerlist[1] = 2;
in.pointmarkerlist[2] = 0;
in.pointmarkerlist[3] = 0;
in.numberofsegments = 0;
in.numberofholes = 0;
in.numberofregions = 1;
in.regionlist = (REAL *)malloc(in.numberofregions * 4 * sizeof(REAL));
in.regionlist[0] = 0.5;
in.regionlist[1] = 5.0;
in.regionlist[2] = 7.0; /* Regional attribute (for whole mesh). */
in.regionlist[3] = 0.1; /* Area constraint that will not be used. */
printf("Input point set:\n\n");
//report(&in, 1, 0, 0, 0, 0, 0);
/* Make necessary initializations so that Triangle can return a */
/* triangulation in `mid' and a voronoi diagram in `vorout'. */
mid.pointlist = (REAL *)NULL; /* Not needed if -N switch used. */
/* Not needed if -N switch used or number of point attributes is zero: */
mid.pointattributelist = (REAL *)NULL;
mid.pointmarkerlist = (int *)NULL; /* Not needed if -N or -B switch used. */
mid.trianglelist = (int *)NULL; /* Not needed if -E switch used. */
/* Not needed if -E switch used or number of triangle attributes is zero: */
mid.triangleattributelist = (REAL *)NULL;
mid.neighborlist = (int *)NULL; /* Needed only if -n switch used. */
/* Needed only if segments are output (-p or -c) and -P not used: */
mid.segmentlist = (int *)NULL;
/* Needed only if segments are output (-p or -c) and -P and -B not used: */
mid.segmentmarkerlist = (int *)NULL;
mid.edgelist = (int *)NULL; /* Needed only if -e switch used. */
mid.edgemarkerlist = (int *)NULL; /* Needed if -e used and -B not used. */
vorout.pointlist = (REAL *)NULL; /* Needed only if -v switch used. */
/* Needed only if -v switch used and number of attributes is not zero: */
vorout.pointattributelist = (REAL *)NULL;
vorout.edgelist = (int *)NULL; /* Needed only if -v switch used. */
vorout.normlist = (REAL *)NULL; /* Needed only if -v switch used. */
/* Triangulate the points. Switches are chosen to read and write a */
/* PSLG (p), preserve the convex hull (c), number everything from */
/* zero (z), assign a regional attribute to each element (A), and */
/* produce an edge list (e), a Voronoi diagram (v), and a triangle */
/* neighbor list (n). */
triangulate("pczAevn", &in, &mid, &vorout);
printf("Initial triangulation:\n\n");
//report(&mid, 1, 1, 1, 1, 1, 0);
printf("Initial Voronoi diagram:\n\n");
//report(&vorout, 0, 0, 0, 0, 1, 1);
/* Attach area constraints to the triangles in preparation for */
/* refining the triangulation. */
/* Needed only if -r and -a switches used: */
mid.trianglearealist = (REAL *)malloc(mid.numberoftriangles * sizeof(REAL));
mid.trianglearealist[0] = 3.0;
mid.trianglearealist[1] = 1.0;
/* Make necessary initializations so that Triangle can return a */
/* triangulation in `out'. */
out.pointlist = (REAL *)NULL; /* Not needed if -N switch used. */
/* Not needed if -N switch used or number of attributes is zero: */
out.pointattributelist = (REAL *)NULL;
out.trianglelist = (int *)NULL; /* Not needed if -E switch used. */
/* Not needed if -E switch used or number of triangle attributes is zero: */
out.triangleattributelist = (REAL *)NULL;
/* Refine the triangulation according to the attached */
/* triangle area constraints. */
triangulate("prazBP", &mid, &out, (struct triangulateio *) NULL);
printf("Refined triangulation:\n\n");
//report(&out, 0, 1, 0, 0, 0, 0);
/* Free all allocated arrays, including those allocated by Triangle. */
free(in.pointlist);
free(in.pointattributelist);
free(in.pointmarkerlist);
free(in.regionlist);
free(mid.pointlist);
free(mid.pointattributelist);
free(mid.pointmarkerlist);
free(mid.trianglelist);
free(mid.triangleattributelist);
free(mid.trianglearealist);
free(mid.neighborlist);
free(mid.segmentlist);
free(mid.segmentmarkerlist);
free(mid.edgelist);
free(mid.edgemarkerlist);
free(vorout.pointlist);
free(vorout.pointattributelist);
free(vorout.edgelist);
free(vorout.normlist);
free(out.pointlist);
free(out.pointattributelist);
free(out.trianglelist);
free(out.triangleattributelist);
QMessageBox::information(NULL, "INFO", "Finish", QMessageBox::Ok, QMessageBox::Ok);
//return 0;
运行目标程序测试
我之前一直以为是自己编的测试数据不符合条件，所以才报错。
后来发现用Triangle库本身所提供的代码测试，仍然报错。就怀疑是编译除了问题。
但是编译时成功。
无意间发现了一个博客上提到的一个问题
https://blog.csdn.net/u010750137/article/details/106028070
浙公网安备 33010602011771号