File: test_delaunay_2.cpp

package info (click to toggle)
cgal 3.3.1-4
  • links: PTS
  • area: non-free
  • in suites: lenny
  • size: 48,220 kB
  • ctags: 82,215
  • sloc: cpp: 382,215; ansic: 71,962; sh: 4,743; makefile: 4,210; awk: 17; sed: 8
file content (24 lines) | stat: -rw-r--r-- 492 bytes parent folder | download 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 
// small example for compilation
// check of Delaunay_triangulation_2 using the kernel concept
// archetype

#include <CGAL/basic.h>
#include <CGAL/Triangulation_2.h>
#include <CGAL/Delaunay_triangulation_2.h>
#include <CGAL/Kernel_archetype.h>

typedef CGAL::Kernel_archetype  K;
typedef K::Point_2              Point;

typedef CGAL::Delaunay_triangulation_2<K>  Delaunay_triang_2;

Delaunay_triang_2 dt;

int main()
{
  std::list<Point> input;
  Point act;

  dt.insert(act);
  return 0;
}