使用CGAL::Constrained_Delaunay_triangulation_2三角剖分多边形

Question

我正在尝试使用CGAL`s的约束Delaunay三角剖分来对2D多边形进行三角剖分。但是程序生成了这个运行时错误：

~ what()：CGAL错误:违反前提条件！Expr: vaa != vbb文件: /usr/include/CGAL/Constrained_triangulation_2.h行: 463程序意外结束。~

有人知道这是什么吗？

这是cpp文件：

void CTriangulation3D::loadFeaturePoints(std::list<Point3DTexturable*> tlist){
//Loads Triangulation from points of tlist (closed polygon with no hole)

std::list<Point3DTexturable*>::iterator it;

Point3DTexturable *q;

for (it = tlist.begin(); it != tlist.end() ; it++){
    q = *it;
    polygon.push_back(CPoint(q->getX(), q->getZ()));
}

if ( polygon.is_empty() ) return;

//Tries to load triangulation and close a polygon using insert_constraint. Runtime error appears on the first call to insert_constraints

CVertex_handle v_prev = T.insert(*CGAL::cpp11::prev(polygon.vertices_end()));
for (Polygon_2::Vertex_iterator vit = polygon.vertices_begin(); vit != polygon.vertices_end(); ++vit){
    CVertex_handle vh = T.insert(*vit);
    T.insert_constraint(vh,v_prev);
    v_prev=vh;
}
}

这些是声明，我还尝试了不精确的结构和精确的谓词

#ifndef CTRIANGULATION3D_H
#define CTRIANGULATION3D_H

#include "Point3DTexturable.h"
#include "Triangle.h"

#include <CGAL/Triangulation_vertex_base_with_info_2.h>
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_face_base_with_info_2.h>
#include <CGAL/Triangulation_hierarchy_2.h>
#include <CGAL/Polygon_2.h>
#include <iostream>

typedef CGAL::Exact_predicates_exact_constructions_kernel               Ke; 
typedef CGAL::Triangulation_vertex_base_with_info_2<double,Ke>          Vbc;
typedef CGAL::Triangulation_hierarchy_vertex_base_2<Vbc>                Vbhc;
typedef CGAL::Constrained_triangulation_face_base_2<Ke>                 Fb;
typedef CGAL::Triangulation_data_structure_2<Vbhc,Fb>                   TDS;

typedef CGAL::Exact_intersections_tag                                   Itag;
typedef CGAL::Constrained_Delaunay_triangulation_2<Ke, TDS, Itag>       CDT;
typedef CGAL::Triangulation_hierarchy_2<CDT>                            Dhh;

typedef CDT::Point                                                      CPoint;
typedef Dhh::Finite_faces_iterator                      CFinite_faces_iterator;
typedef Dhh::Vertex_handle                                      CVertex_handle;
typedef Dhh::Face_handle                                              CFace_handle;

typedef CGAL::Polygon_2<Ke>                                             Polygon_2;


class CTriangulation3D{

public:

Dhh T;

std::list<double> lheight;

std::list<Triangle> triangles;

Polygon_2 polygon;

CTriangulation3D(std::list<Point3DTexturable*> tlist);

std::list<Triangle*> getTriangleList();

void loadIterationTriangulation();
void loadFeaturePoints(std::list<Point3DTexturable*> tlist);
};



#endif // CTRIANGULATION3D_H

谢谢!

Answer 1

在某些情况下，您需要标记多边形的内部和外部。这是一个有效的example。