1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
// Copyright (c) 2014 GeometryFactory (France). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 3 of the License,
// or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
//
//
// Author(s) : Philipp Moeller
#ifndef CGAL_GRAPH_CONCEPTS_H
#define CGAL_GRAPH_CONCEPTS_H
#include <boost/graph/graph_concepts.hpp>
#include <boost/concept/detail/concept_def.hpp>
namespace CGAL {
namespace concepts {
BOOST_concept(HalfedgeGraph,(G))
: boost::concepts::Graph<G>
{
typedef typename boost::graph_traits<G>::halfedge_descriptor halfedge_descriptor;
BOOST_CONCEPT_USAGE(HalfedgeGraph)
{
BOOST_CONCEPT_ASSERT((boost::DefaultConstructible<halfedge_descriptor>));
BOOST_CONCEPT_ASSERT((boost::EqualityComparable<halfedge_descriptor>));
BOOST_CONCEPT_ASSERT((boost::Assignable<halfedge_descriptor>));
e = edge(h, g);
h = halfedge(e, g);
h = halfedge(v, g);
hp = halfedge(u, v, g);
h = opposite(h, g);
v = source(h, g);
v = target(h, g);
h = next(h, g);
h = prev(h, g);
const_constraints(g);
}
void const_constraints(const G& cg)
{
e = edge(h, cg);
h = halfedge(e, cg);
h = halfedge(v, cg);
hp = halfedge(u, v, cg);
h = opposite(h, cg);
v = source(h, cg);
v = target(h, cg);
h = next(h, cg);
h = prev(h, cg);
}
G g;
typename boost::graph_traits<G>::vertex_descriptor v, u;
typename boost::graph_traits<G>::edge_descriptor e;
typename boost::graph_traits<G>::halfedge_descriptor h;
std::pair<halfedge_descriptor, bool> hp;
};
BOOST_concept(HalfedgeListGraph,(G))
: HalfedgeGraph<G>
{
typedef typename boost::graph_traits<G>::halfedge_iterator halfedge_iterator;
typedef typename boost::graph_traits<G>::halfedges_size_type halfedges_size_type;
BOOST_CONCEPT_USAGE(HalfedgeListGraph)
{
// BOOST_CONCEPT_ASSERT((boost::BidirectionalIterator<halfedge_iterator>));
h_num = num_halfedges(g);
p = halfedges(g);
this->h = *p.first;
const_constraints(g);
}
void const_constraints(const G& cg)
{
h_num = num_halfedges(cg);
p = halfedges(cg);
this->h = *p.first;
}
G g;
halfedges_size_type h_num;
std::pair<halfedge_iterator, halfedge_iterator> p;
};
BOOST_concept(FaceGraph,(G))
: HalfedgeGraph<G>
{
typedef typename boost::graph_traits<G>::face_descriptor face_descriptor;
BOOST_CONCEPT_USAGE(FaceGraph)
{
BOOST_CONCEPT_ASSERT((boost::DefaultConstructible<face_descriptor>));
BOOST_CONCEPT_ASSERT((boost::EqualityComparable<face_descriptor>));
BOOST_CONCEPT_ASSERT((boost::Assignable<face_descriptor>));
f = face(h, g);
h = halfedge(f, g);
boost::graph_traits<G>::null_face();
const_constraints(g);
}
void const_constraints(const G& cg)
{
f = face(h, cg);
h = halfedge(f, cg);
}
G g;
face_descriptor f;
typename boost::graph_traits<G>::halfedge_descriptor h;
};
BOOST_concept(FaceListGraph,(G))
: FaceGraph<G>
{
typedef typename boost::graph_traits<G>::face_iterator face_iterator;
typedef typename boost::graph_traits<G>::faces_size_type faces_size_type;
BOOST_CONCEPT_USAGE(FaceListGraph)
{
// BOOST_CONCEPT_ASSERT((boost::BidirectionalIterator<face_iterator>));
p = faces(g);
nf = num_faces(g);
this->f = *p.first;
const_constraints(g);
}
void const_constraints(const G& cg)
{
p = faces(cg);
nf = num_faces(cg);
this->f = *p.first;
}
G g;
std::pair<face_iterator, face_iterator> p;
typename boost::graph_traits<G>::faces_size_type nf;
};
BOOST_concept(MutableFaceGraph,(G))
: FaceGraph<G>
{
BOOST_CONCEPT_USAGE(MutableFaceGraph)
{
f = add_face(g);
remove_face(f, g);
set_face(h, f, g);
set_halfedge(f, h, g);
}
G g;
typename boost::graph_traits<G>::face_descriptor f;
typename boost::graph_traits<G>::halfedge_descriptor h;
};
BOOST_concept(MutableHalfedgeGraph,(G))
: HalfedgeGraph<G>
{
BOOST_CONCEPT_USAGE(MutableHalfedgeGraph)
{
v = add_vertex(g);
remove_vertex(v, g);
e = add_edge(g);
remove_edge(e, g);
set_target(h1, v, g);
set_next(h1, h2, g);
set_halfedge(v, h1, g);
}
G g;
typename boost::graph_traits<G>::edge_descriptor e;
typename boost::graph_traits<G>::vertex_descriptor v;
typename boost::graph_traits<G>::halfedge_descriptor h1, h2;
};
} // concepts
using CGAL::concepts::HalfedgeGraphConcept;
using CGAL::concepts::HalfedgeListGraphConcept;
using CGAL::concepts::FaceGraphConcept;
using CGAL::concepts::FaceListGraphConcept;
using CGAL::concepts::MutableFaceGraphConcept;
using CGAL::concepts::MutableHalfedgeGraphConcept;
} // CGAL
#include <boost/concept/detail/concept_undef.hpp>
#endif /* CGAL_GRAPH_CONCEPTS_H */
|
