从 CGAL 的德劳奈约束三角测量中检索折点

Question

我有一个2D点的列表，它们描述了一个简单的多边形。由于CGAL，我计算了Delaunay约束。

    Polygon_2 polygon;
    //Create a polygon from a vector
    for(int j=0; j < (*itVectorPoint2D).size(); j++) {
        polygon.push_back(Point((*itVectorPoint2D)[j].x,(*itVectorPoint2D)[j].y));
    }
    //Insert the polygon into a constrained triangulation
    CDT cdt;
    insert_polygon(cdt,polygon);
    //Mark facets that are inside the domain bounded by the polygon
    mark_domains(cdt);
    for (CDT::Finite_faces_iterator fit=cdt.finite_faces_begin(); fit!=cdt.finite_faces_end();++fit)
    {
        if (fit->info().in_domain()) {
            std::cout << (*(fit->vertex(0))) << ";" << (*(fit->vertex(1))) << ";" << (*(fit->vertex(2))) << std::endl;
        }
    }

我的问题是，我想从初始向量中检索每个具有三元组索引的三角形。例如，对于由0：（0,0）1（1,0）2∶（1,1）和3:（0,1）定义的正方形，我想要检索（0、1，2）和（0和3）。我可以检索当前顶点的坐标，并将其与向量中的每个点进行比较，但我认为这很难看（而且效率低下，可能是问题的根源？）。

有办法做到这一点吗？

Answer 1

以下内容适用于CGAL 4.2。注意，对于CGAL 4.3，将有一个专用函数以更集成的方式完成这项工作，就像这里为Delaunay_triangulation_2类所做的那样。

#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
#include <CGAL/Triangulation_vertex_base_with_info_2.h>
#include <CGAL/Spatial_sort_traits_adapter_2.h>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Triangulation_vertex_base_with_info_2<unsigned, K> Vb;
typedef CGAL::Constrained_triangulation_face_base_2<K>           Fb;
typedef CGAL::Triangulation_data_structure_2<Vb,Fb>              TDS;
typedef CGAL::Exact_predicates_tag                               Itag;
typedef CGAL::Constrained_Delaunay_triangulation_2<K, TDS, Itag> CDT;
typedef CDT::Point          Point;
typedef CGAL::Spatial_sort_traits_adapter_2<K,Point*> Search_traits;
template <class InputIterator>
void insert_with_info(CDT& cdt, InputIterator first,InputIterator last)
{
  std::vector<std::ptrdiff_t> indices;
  std::vector<Point> points;
  std::ptrdiff_t index=0;
  for (InputIterator it=first;it!=last;++it){
    points.push_back( *it);
    indices.push_back(index++);
  }
  CGAL::spatial_sort(indices.begin(),indices.end(),Search_traits(&(points[0]),cdt.geom_traits()));
  CDT::Vertex_handle v_hint;
  CDT::Face_handle hint;
  for (typename std::vector<std::ptrdiff_t>::const_iterator
    it = indices.begin(), end = indices.end();
    it != end; ++it){
    v_hint = cdt.insert(points[*it], hint);
    if (v_hint!=CDT::Vertex_handle()){
      v_hint->info()=*it;
      hint=v_hint->face();
    }
  }
}
int main()
{
  std::vector< Point > points;
  points.push_back( Point(0,0) );
  points.push_back( Point(1,0) );
  points.push_back( Point(0,1) );
  points.push_back( Point(14,4) );
  points.push_back( Point(2,2) );
  points.push_back( Point(-4,0) );

  CDT cdt;
  insert_with_info(cdt, points.begin(), points.end());
  CGAL_assertion( cdt.number_of_vertices() == 6 );
  // check that the info was correctly set.
  CDT::Finite_vertices_iterator vit;
  for (vit = cdt.finite_vertices_begin(); vit != cdt.finite_vertices_end(); ++vit)
    if( points[ vit->info() ] != vit->point() ){
      std::cerr << "Error different info" << std::endl;
      exit(EXIT_FAILURE);
    }
  std::cout << "OK" << std::endl;
}