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