CGALTriangulation2Ddefs.H
Go to the documentation of this file.
1 /*---------------------------------------------------------------------------*\
2  ========= |
3  \\ / F ield | OpenFOAM: The Open Source CFD Toolbox
4  \\ / O peration |
5  \\ / A nd | Copyright (C) 2013-2015 OpenFOAM Foundation
6  \\/ M anipulation |
7 -------------------------------------------------------------------------------
8 License
9  This file is part of OpenFOAM.
10 
11  OpenFOAM is free software: you can redistribute it and/or modify it
12  under the terms of the GNU General Public License as published by
13  the Free Software Foundation, either version 3 of the License, or
14  (at your option) any later version.
15 
16  OpenFOAM is distributed in the hope that it will be useful, but WITHOUT
17  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
18  FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19  for more details.
20 
21  You should have received a copy of the GNU General Public License
22  along with OpenFOAM. If not, see <http://www.gnu.org/licenses/>.
23 
24 Typedefs
25  CGALTriangulation2Ddefs
26 
27 Description
28  CGAL data structures used for 2D Delaunay meshing.
29 
30  Define CGAL_INEXACT to use Exact_predicates_inexact_constructions kernel
31  otherwise the more robust but much less efficient
32  Exact_predicates_exact_constructions will be used.
33 
34  Define CGAL_HIERARCHY to use hierarchical Delaunay triangulation which is
35  faster but uses more memory than the standard Delaunay triangulation.
36 
37 \*---------------------------------------------------------------------------*/
38 
39 #ifndef CGALTriangulation2Ddefs_H
40 #define CGALTriangulation2Ddefs_H
41 
42 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
43 
45 
46 #include "indexedVertex.H"
47 #include "indexedFace.H"
48 
51 
52 #ifdef CGAL_HIERARCHY
53 
54  // Data structures for hierarchical Delaunay triangulation which is more
55  // efficient but also uses more storage
56  #include "CGAL/Triangulation_hierarchy_2.h"
57 
58  typedef CGAL::Triangulation_hierarchy_vertex_base_2<Vb> Vbh;
59  typedef CGAL::Triangulation_data_structure_2<Vbh, Fb> Tds;
60  typedef CGAL::Delaunay_triangulation_2<K, Tds> DT;
61  typedef CGAL::Triangulation_hierarchy_2<DT> Delaunay;
62 
63 #else
64 
65  // Data structures for standard Delaunay triangulation
66  typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds;
67  typedef CGAL::Delaunay_triangulation_2<K, Tds> Delaunay;
68 
69 #endif
70 
71 
72 // * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * //
73 
74 #endif
75 
76 // ************************************************************************* //
CGAL::indexedVertex< K > Vb
CGAL::Triangulation_data_structure_2< Vb, Fb > Tds
An indexed form of CGAL::Triangulation_vertex_base_3<K> used to keep track of the Delaunay vertices i...
Definition: indexedVertex.H:51
CGAL::Delaunay_triangulation_2< K, Tds > Delaunay
CGAL::indexedFace< K > Fb
An indexed form of CGAL::Triangulation_face_base_2<K> used to keep track of the vertices in the trian...
Definition: indexedFace.H:48