mirror of https://github.com/CGAL/cgal
56 lines
1.8 KiB
C++
56 lines
1.8 KiB
C++
// ============================================================================
|
|
//
|
|
// Copyright (c) 1998 The CGAL Consortium
|
|
//
|
|
// This software and related documentation is part of an INTERNAL release
|
|
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
|
// intended for general use.
|
|
//
|
|
// ----------------------------------------------------------------------------
|
|
//
|
|
// release :
|
|
// release_date :
|
|
//
|
|
// file : test/Triangulation/test_delaunay_hierarchy_2.C
|
|
// source : $URL$
|
|
// revision : $Id$
|
|
// revision_date : $Date$
|
|
// author(s) : Mariette Yvinec (Mariette.Yvinec@sophia.inria.fr)
|
|
//
|
|
// coordinator : INRIA Sophia-Antipolis
|
|
// ============================================================================
|
|
|
|
#include <CGAL/Triangulation_data_structure_2.h>
|
|
#include <CGAL/Delaunay_triangulation_2.h>
|
|
#include <CGAL/Triangulation_hierarchy_2.h>
|
|
|
|
#include <CGAL/Simple_cartesian.h>
|
|
|
|
#include <iostream>
|
|
|
|
#include <CGAL/_test_cls_delaunay_hierarchy_2.h>
|
|
|
|
typedef double Coord_type;
|
|
typedef CGAL::Simple_cartesian<Coord_type> Gt;
|
|
typedef CGAL::Triangulation_vertex_base_2<Gt> Vbb;
|
|
typedef CGAL::Triangulation_hierarchy_vertex_base_2<Vbb> Vb;
|
|
typedef CGAL::Triangulation_face_base_2<Gt> Fb;
|
|
typedef CGAL::Triangulation_data_structure_2<Vb,Fb> Tds;
|
|
typedef CGAL::Delaunay_triangulation_2<Gt,Tds> Dt;
|
|
// Explicit instantiation of the whole class :
|
|
// does not work anymore because of the tag dependent copy
|
|
template class CGAL::Triangulation_hierarchy_2<Dt>;
|
|
|
|
|
|
int main()
|
|
{
|
|
std::cout << "Testing Delaunay_hierarchy_2 " << std::endl;
|
|
std::cout << " with Cartesian<double> points "<< std::endl;
|
|
|
|
typedef CGAL::Triangulation_hierarchy_2<Dt> Dh;
|
|
_test_cls_delaunay_hierarchy_2( Dh() );
|
|
|
|
std::cout << "done" << std::endl;
|
|
return 0;
|
|
}
|