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
|
// Copyright (c) 2004-2006 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Mesh_2/include/CGAL/Mesh_2/Refine_edges_visitor.h $
// $Id: Refine_edges_visitor.h 40626 2007-10-16 14:41:34Z lrineau $
//
//
// Author(s) : Laurent RINEAU
#ifndef CGAL_MESH_2_REFINE_EDGES_VISITOR_H
#define CGAL_MESH_2_REFINE_EDGES_VISITOR_H
#include <CGAL/Mesher_level.h>
namespace CGAL {
namespace Mesh_2 {
/**
* This class is the visitor needed when Refine_edges<Tr> if called from
* Refine_faces<Tr>.
* \param Faces_mesher should be instanciated with Refine_face_base<Tr>.
*/
template <typename Faces_mesher>
class Refine_edges_visitor : public ::CGAL::Null_mesh_visitor
{
public:
typedef typename Faces_mesher::Triangulation Tr;
typedef typename Tr::Edge Edge;
typedef typename Tr::Vertex_handle Vertex_handle;
typedef typename Tr::Face_handle Face_handle;
typedef typename Tr::Point Point;
typedef typename Triangulation_mesher_level_traits_2<Tr>::Zone Zone;
typedef typename details::Refine_edges_base_types<Tr>::Constrained_edge
Constrained_edge;
typedef typename Faces_mesher::Previous_level Edges_mesher;
private:
Faces_mesher& faces_mesher;
Edges_mesher& edges_mesher;
Vertex_handle &va, &vb;
bool &mark_at_left, &mark_at_right;
Null_mesh_visitor& null_mesh_visitor;
public:
Refine_edges_visitor(Faces_mesher& faces_mesher_,
Edges_mesher& edges_mesher_,
Null_mesh_visitor& null)
: faces_mesher(faces_mesher_),
edges_mesher(edges_mesher_),
va(edges_mesher.visitor_va),
vb(edges_mesher.visitor_vb),
mark_at_left(edges_mesher.visitor_mark_at_left),
mark_at_right(edges_mesher.visitor_mark_at_right),
null_mesh_visitor(null)
{
}
Null_mesh_visitor previous_level() const { return null_mesh_visitor; }
/**
* Store vertex handles and markers at left and right of the edge \c e.
*/
void before_conflicts(const Edge& e, const Point&)
{
const Face_handle& fh = e.first;
const int edge_index = e.second;
va = fh->vertex(Tr::cw (edge_index));
vb = fh->vertex(Tr::ccw(edge_index));
mark_at_right = fh->is_in_domain();
mark_at_left = fh->neighbor(edge_index)->is_in_domain();
}
void before_insertion(const Edge&, const Point& p, Zone& z)
{
faces_mesher.before_insertion_impl(Face_handle(), p, z);
}
/** Restore markers in the star of \c v. */
void after_insertion(const Vertex_handle& v)
{
Tr& tr = faces_mesher.triangulation_ref_impl();
int dummy;
// if we put edge_index instead of dummy, Intel C++ does not find
// a matching function for is_edge
Face_handle fh;
tr.is_edge(va, v, fh, dummy);
// set fh to the face at the right of [va,v]
typename Tr::Face_circulator fc = tr.incident_faces(v, fh), fcbegin(fc);
// circulators are counter-clockwise, so we start at the right of
// [va,v]
do {
if( !tr.is_infinite(fc) )
fc->set_in_domain(mark_at_right);
++fc;
} while ( fc->vertex(tr.ccw(fc->index(v))) != vb );
// we are now at the left of [va,vb]
do {
if( !tr.is_infinite(fc) )
fc->set_in_domain(mark_at_left);
++fc;
} while ( fc != fcbegin );
// then let's update bad faces
faces_mesher.compute_new_bad_faces(v);
CGAL_expensive_assertion(faces_mesher.check_bad_faces());
}
template <typename E, typename P, typename Z>
void after_no_insertion(E, P, Z) const {}
}; // end class Refine_edges_visitor
/**
* This class is the visitor for Refine_faces<Tr>.
*/
template <typename Faces_mesher>
class Refine_edges_visitor_from_faces
{
public:
typedef Refine_edges_visitor<Faces_mesher> Previous_level;
typedef typename Faces_mesher::Previous_level Edges_mesher;
private:
Previous_level previous;
public:
Refine_edges_visitor_from_faces(Faces_mesher& faces_mesher,
Edges_mesher& edges_mesher,
Null_mesh_visitor& null)
: previous(faces_mesher, edges_mesher, null)
{
}
Previous_level& previous_level() { return previous; }
template <typename E, typename P>
void before_conflicts(E, P) const {}
template <typename E, typename P, typename Z>
void before_insertion(E, P, Z) const {}
template <typename V>
void after_insertion(V) const {}
template <typename E, typename P, typename Z>
void after_no_insertion(E, P, Z) const {}
}; // end class Refine_edges_visitor_from_faces
} // end namespace Mesh_2
} // end namespace CGAL
#endif // CGAL_MESH_2_REFINE_EDGES_VISITOR_H
|
