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
|
// This file is part of ff3d - http://www.freefem.org/ff3d
// Copyright (C) 2001, 2002, 2003 Pascal Have
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
// $Id: connected_triangle.hpp,v 1.4 2007/05/20 23:02:46 delpinux Exp $
#ifndef CONNECTED_TRIANGLE_HPP
#define CONNECTED_TRIANGLE_HPP
#include <Triangle.hpp>
class ConnectedTriangle; // prdclaration
typedef Vertex* PointIndex;
typedef ConnectedTriangle * TriangleIndex;
class ConnectedTriangle : public Triangle {
private:
TriangleIndex __neighs[3];
inline void __initNeighs() {
__neighs[0] = NULL;
__neighs[1] = NULL;
__neighs[2] = NULL;
}
public:
int tag;
ConnectedTriangle() { __initNeighs(); tag=0; }
ConnectedTriangle(const PointIndex & s1,const PointIndex & s2,const PointIndex & s3) : Triangle(*s1,*s2,*s3) {
__initNeighs();
tag=0;
}
ConnectedTriangle(const PointIndex & s1,const PointIndex & s2,const PointIndex & s3,
const TriangleIndex & v1,const TriangleIndex & v2,const TriangleIndex & v3) : Triangle(*s1,*s2,*s3) {
__neighs[0] = v1;
__neighs[1] = v2;
__neighs[2] = v3;
tag = 0;
}
ConnectedTriangle(const ConnectedTriangle & t) : Triangle(t) {
__neighs[0] = t.__neighs[0];
__neighs[1] = t.__neighs[1];
__neighs[2] = t.__neighs[2];
tag = t.tag;
}
/*! Pas de dsallocation car sinon perte du trgle point */
~ConnectedTriangle() { }
//base
Vertex** base() {
return __vertices;
}
const TriangleIndex & neigh(const unsigned k) const { ASSERT(k < 3); return __neighs[k]; }
TriangleIndex & neigh(const unsigned k) { ASSERT(k < 3); return __neighs[k]; }
//! Modification globale des sommets.
void setVertices(const PointIndex &s1,const PointIndex &s2,const PointIndex &s3) {
ASSERT(s1 != s2 & s2 != s3 & s3 !=s1); // A remettre pour un bon debug de insert_point.
__vertices[0]=s1; __vertices[1]=s2; __vertices[2]=s3;
}
//! Modification globale des voisins.
void setNeighs(const TriangleIndex &v1,const TriangleIndex &v2,const TriangleIndex &v3) {
__neighs[0]=v1; __neighs[1]=v2; __neighs[2]=v3;
}
//! determine le numero associe au sommet P
unsigned localizeVertex(const PointIndex & P) {
unsigned local = 0;
while(base()[local] != P) {
++local;
ASSERT(local < 3);
}
return local;
}
//! determine le numero associe au voisin N
unsigned localizeNeigh(const ConnectedTriangle * const N) const {
unsigned local = 0;
while(__neighs[local] != N) {
++local;
ASSERT(local < 3);
}
return local;
}
};
#endif /* CONNECTED_TRIANGLE_HPP */
|
