- 目前在使用cgal构建二维delaunay网,当我从Face_handle访问顶点时发现除了x和y坐标之外,每个点都有更多的关联数据,无法访问三角面的三个顶点对应全局的索引。
因此,我想知道是否可以检索每个点的索引,以便我可以在另一个向量中访问我自己的点结构,经过苦苦寻找,在stackoverflow上找到了解决方案,特此记录一下,采用以下代码可实现目的:
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_vertex_base_with_info_2.h>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel Kernel;
typedef CGAL::Triangulation_vertex_base_with_info_2<unsigned int, Kernel> Vb;
typedef CGAL::Triangulation_data_structure_2<Vb> Tds;
typedef CGAL::Delaunay_triangulation_2<Kernel, Tds> Delaunay;
typedef Kernel::Point_2 Point;
int main() {
std::vector< std::pair<Point,unsigned> > points;
points.push_back( std::make_pair( Point(1,1), 0 ) );
points.push_back( std::make_pair( Point(1,2), 1 ) );
points.push_back( std::make_pair( Point(1,3), 2 ) );
points.push_back( std::make_pair( Point(2,1), 3 ) );
points.push_back( std::make_pair( Point(2,2), 4 ) );
points.push_back( std::make_pair( Point(2,3), 5 ) );
Delaunay triangulation;
triangulation.insert(points.begin(),points.end());
for(Delaunay::Finite_faces_iterator fit = triangulation.finite_faces_begin();
fit != triangulation.finite_faces_end(); ++fit) {
Delaunay::Face_handle face = fit;
unsigned int Vid1 =face->vertex(0)->info();
unsigned int Vid2 =face->vertex(1)->info();
unsigned int Vid3 =face->vertex(2)->info();
std::cout << "Triangle:\t" << triangulation.triangle(face) << std::endl;
std::cout << "Vertex 0:\t" << triangulation.triangle(face)[0] << std::endl;
std::cout << "Vertex 0:\t" << face->vertex(0)->info() << std::endl;
}
}
原文地址:https://stackoverflow.com/questions/19850354/cgal-retrieve-vertex-index-after-delaunay-triangulation
补充:
其他使用方法也可参考官网实例:https://doc.cgal.org/latest/Triangulation_2/index.html#title40