我正在尝试对点集进行德劳内三角剖分,找到离输入点最近的点,并获取它的相关顶点,但是以下代码似乎无法正常工作。
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <fstream>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Delaunay_triangulation_2<K> Triangulation;
typedef Triangulation::Edge_iterator Edge_iterator;
typedef Triangulation::Point Point;
typedef Triangulation::Vertex_handle Vertex_handle;
typedef Triangulation::Vertex_circulator Vertex_circulator;
int main( )
{
std::ifstream in("data.txt");
assert(in);
std::istream_iterator<Point> begin(in);
std::istream_iterator<Point> end;
Triangulation T;
T.insert(begin, end);
std::cout << T.number_of_vertices() <<std::endl;
Vertex_handle handle = T.nearest_vertex(Point(1, 1));
std::cout << handle->point() << std::endl;
std::cout<<"incidents: \n" << std::endl;
Vertex_circulator circulator = T.incident_vertices(handle), done(circulator);
do
{
std::cout << circulator->point() << std::endl;
} while(++circulator != done);
return 0;
}
例如,如果 data.txt 文件是这样的:
2 3
1 1
1 0
输出结果为
3
1 1
incidents:
1 0
2 3
2.02461e-307 6.94896e-308
为什么我的文本末尾会有一个奇怪的空白行?