CGAL 5.6 - 2D Triangulations
Loading...
Searching...
No Matches
Triangulation_2/terrain.cpp
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Projection_traits_xy_3.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <fstream>
typedef K::Point_3 Point;
int main()
{
std::ifstream in("data/terrain.cin");
std::istream_iterator<Point> begin(in);
std::istream_iterator<Point> end;
Delaunay dt(begin, end);
std::cout << dt.number_of_vertices() << std::endl;
return 0;
}
The class Delaunay_triangulation_2 is designed to represent the Delaunay triangulation of a set of po...
Definition: Delaunay_triangulation_2.h:80