/usr/include/BALL/STRUCTURE/graphFace.h is in libball1.4-dev 1.4.3~beta1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 | // -*- Mode: C++; tab-width: 2; -*-
// vi: set ts=2:
//
#ifndef BALL_STRUCTURE_GRAPHFACE_H
#define BALL_STRUCTURE_GRAPHFACE_H
#ifndef BALL_COMMON_H
# include <BALL/common.h>
#endif
#include <list>
#include <vector>
namespace BALL
{
template <typename Vertex, typename Edge, typename Face>
class GraphVertex;
template <typename Vertex, typename Edge, typename Face>
class GraphEdge;
/** Generic GraphFace Class.
\ingroup Surface
*/
template <typename Vertex, typename Edge, typename Face>
class GraphFace
{
public:
/** @name Class friends
- class GraphVertex<Vertex,Edge,Face>;
- class GraphEdge<Vertex,Edge,Face>;
*/
friend class GraphVertex<Vertex,Edge,Face>;
friend class GraphEdge<Vertex,Edge,Face>;
BALL_CREATE(GraphFace)
/** @name Type definitions
*/
//@{
typedef typename std::list<Vertex*>::iterator VertexIterator;
typedef typename std::list<Vertex*>::const_iterator ConstVertexIterator;
typedef typename std::list<Edge*>::iterator EdgeIterator;
typedef typename std::list<Edge*>::const_iterator ConstEdgeIterator;
//@}
/** @name Constructors and Destructors
*/
//@{
/** Default constructor.
This method creates a new GraphFace object.
*/
GraphFace();
/** Copy constructor.
Create a new GraphFace object from another.
@param face the GraphFace object to be copied
@param deep if deep = false, all pointers are set to NULL (default).
Otherwise the new GraphFace object is linked to the
neighbours of the old GraphFace object.
*/
GraphFace(const GraphFace<Vertex,Edge,Face>& face, bool deep = false);
/** Destructor.
Destructs the GraphFace object.
*/
virtual ~GraphFace();
//@}
/** @name Assignments
*/
//@{
/** Assign from another GraphFace.
@param face the GraphFacee object to assign from
@param deep if deep = false, all pointers are set to NULL
(default). Otherwise the GraphFace object is linked to
the neighbours of the GraphFace object to assign from.
*/
void set(const GraphFace<Vertex,Edge,Face>& face, bool deep = false);
/** Assign from another GraphFace.
The GraphFace object is linked to the neighbours of the GraphFace
object to assign from.
@param face the GraphFace object to assign from
*/
GraphFace<Vertex,Edge,Face>& operator =
(const GraphFace<Vertex,Edge,Face>& face);
//@}
/** @name Accessors
*/
//@{
/** Insert a new vertex to the GraphFace.
@param vertex a pointer to the new vertex
*/
void insert(Vertex* vertex);
/** Insert a new edge to the GraphFace.
@param edge a pointer to the new edge
*/
void insert(Edge* edge);
/** Remove a vertex from the GraphFace.
@param vertex a pointer to the vertex to remove
*/
void remove(Vertex* vertex);
/** Remove an edge from the GraphFace.
@param edge a pointer to the edge to remove
*/
void remove(Edge* edge);
/** Return the number of vertices of the GraphFace.
@return Position the number of vertices of the GraphFace
*/
Position numberOfVertices() const;
/** Return the number of edges of the GraphFace.
@return Position the number of edges of the GraphFace
*/
Position numberOfEdges() const;
/** Set the index of the GraphFace.
@param index the new index
*/
void setIndex(Index index);
/** Return the index of the GraphFace.
@return Index the index of the GraphFace
*/
Index getIndex() const;
/** Find the two edges of the GraphFace that belong to the given vertex
@param vertex a pointer to the given vertex
@param edge1 a pointer to the first found edge
@param edge2 a pointer to the second found edge
@return bool <b>true</b> if the edges can be found,
<b>false</b> otherwise
*/
bool getEdges(const Vertex* vertex, Edge*& edge1, Edge*& edge2) const;
/** Find the edge of the GraphFace that belongs to the two given vertices
@param vertex1 a pointer to the first given vertex
@param vertex2 a pointer to the second given vertex
@param edge a pointer to the found edge
@return bool <b>true</b> if the edge can be found,
<b>false</b> otherwise
*/
bool getEdge
(const Vertex* vertex1,
const Vertex* vertex2,
Edge*& edge) const;
/** Find the edge of the GraphFace that is similar to the given edge.
@param edge a pointer to the given edge
@return Edge* a pointer to the similar edge of te GraphFace if it can
be found, otherwise NULL
*/
Edge* getSimilarEdge(const Edge* edge) const;
/** Substitute a vertex by an other one.
@param old_vertex the vertex that has to be substituted
@param new_vertex the new vertex
@return bool <b>true</b>, if the vertex can be substituted,
<b>false</b> otherwise
*/
bool substitute(const Vertex* old_vertex, Vertex* new_vertex);
/** Substitute an edge by an other one.
@param old_edge the edge that has to be substituted
@param new_edge the new edge
@return bool <b>true</b>, if the edge can be substituted,
<b>false</b> otherwise
*/
bool substitute(const Edge* old_edge, Edge* new_edge);
//@}
/** @name Predicates
*/
//@{
/** Equality operator.
@return bool <b>true</b>
*/
virtual bool operator == (const Face& face) const;
/** Inequality operator.
@return bool <b>false</b>
*/
virtual bool operator != (const Face& face) const;
/** Similarity operator.
@return bool <b>true</b>
*/
virtual bool operator *= (const Face& face) const;
/** Test whether a vertex is meber of the face.
@param vertex a pointer to the the vertex to test
@return Vertex* a pointer to the vertex if it exists,
otherwise <b>NULL</b>
*/
Vertex* has(Vertex* vertex) const;
/** Test whether an edge is meber of the face.
@param edge a pointer to the edge to test
@return Edge* a pointer to the edge if it exists, otherwise <b>NULL</b>
*/
Edge* has(Edge* edge) const;
//@}
/** @name External Iterators
*/
//@{
VertexIterator beginVertex();
ConstVertexIterator beginVertex() const;
VertexIterator endVertex();
ConstVertexIterator endVertex() const;
EdgeIterator beginEdge();
ConstEdgeIterator beginEdge() const;
EdgeIterator endEdge();
ConstEdgeIterator endEdge() const;
//@}
protected:
/*_ @name Attributes
*/
//@{
/*_ The vertices of the GraphFace
*/
std::list<Vertex*> vertex_;
/*_ The edges of the GraphFace
*/
std::list<Edge*> edge_;
/* The index of the GraphFace
*/
Index index_;
//@}
};
template <typename Vertex, typename Edge, typename Face>
GraphFace<Vertex,Edge,Face>::GraphFace()
: vertex_(),
edge_(),
index_(-1)
{
}
template <typename Vertex, typename Edge, typename Face>
GraphFace<Vertex,Edge,Face>::GraphFace
(const GraphFace<Vertex,Edge,Face>& face, bool deep)
: vertex_(),
edge_(),
index_(face.index_)
{
if (deep)
{
vertex_ = face.vertex_;
edge_ = face.edge_;
}
}
template <typename Vertex, typename Edge, typename Face>
GraphFace<Vertex,Edge,Face>::~GraphFace()
{
}
template <typename Vertex, typename Edge, typename Face>
void GraphFace<Vertex,Edge,Face>::set
(const GraphFace<Vertex,Edge,Face>& face, bool deep)
{
if (this != &face)
{
if (deep)
{
vertex_ = face.vertex_;
edge_ = face.edge_;
}
index_ = face.index_;
}
}
template <typename Vertex, typename Edge, typename Face>
GraphFace<Vertex,Edge,Face>& GraphFace<Vertex,Edge,Face>::operator =
(const GraphFace<Vertex,Edge,Face>& face)
{
if (this != &face)
{
vertex_ = face.vertex_;
edge_ = face.edge_;
index_ = face.index_;
}
return *this;
}
template <typename Vertex, typename Edge, typename Face>
void GraphFace<Vertex,Edge,Face>::insert(Vertex* vertex)
{
typename std::list<Vertex*>::iterator v = vertex_.begin();
bool found = false;
while ((!found) && (v != vertex_.end()))
{
found = (*v == vertex);
v++;
}
if (!found)
{
vertex_.push_back(vertex);
}
}
template <typename Vertex, typename Edge, typename Face>
void GraphFace<Vertex,Edge,Face>::insert(Edge* edge)
{
typename std::list<Edge*>::iterator e = edge_.begin();
bool found = false;
while ((!found) && (e != edge_.end()))
{
found = (*e == edge);
e++;
}
if (!found)
{
edge_.push_back(edge);
}
}
template <typename Vertex, typename Edge, typename Face>
void GraphFace<Vertex,Edge,Face>::remove(Vertex* vertex)
{
vertex_.remove(vertex);
}
template <typename Vertex, typename Edge, typename Face>
void GraphFace<Vertex,Edge,Face>::remove(Edge* edge)
{
edge_.remove(edge);
}
template <typename Vertex, typename Edge, typename Face>
Position GraphFace<Vertex,Edge,Face>::numberOfVertices() const
{
return vertex_.size();
}
template <typename Vertex, typename Edge, typename Face>
Position GraphFace<Vertex,Edge,Face>::numberOfEdges() const
{
return edge_.size();
}
template <typename Vertex, typename Edge, typename Face>
void GraphFace<Vertex,Edge,Face>::setIndex(Index index)
{
index_ = index;
}
template <typename Vertex, typename Edge, typename Face>
Index GraphFace<Vertex,Edge,Face>::getIndex() const
{
return index_;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::getEdges
(const Vertex* vertex,
Edge*& edge1,
Edge*& edge2) const
{
bool found1 = false;
bool found2 = false;
typename std::list<Edge*>::const_iterator e = edge_.begin();
while ((!found1) && (e != edge_.end()))
{
if (((*e)->vertex_[0] == vertex) || ((*e)->vertex_[1] == vertex))
{
edge1 = *e;
found1 = true;
}
e++;
}
if (found1)
{
while ((!found2) && (e != edge_.end()))
{
if (((*e)->vertex_[0] == vertex) || ((*e)->vertex_[1] == vertex))
{
edge2 = *e;
found2 = true;
}
e++;
}
}
return (found1 && found2);
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::getEdge
(const Vertex* vertex1,
const Vertex* vertex2,
Edge*& edge) const
{
typename std::list<Edge*>::const_iterator e = edge_.begin();
bool found = false;
while ((!found) && (e != edge_.end()))
{
if ((((*e)->vertex_[0] == vertex1) && ((*e)->vertex_[1] == vertex2)) ||
(((*e)->vertex_[0] == vertex2) && ((*e)->vertex_[1] == vertex1)) )
{
edge = *e;
found = true;
}
e++;
}
return found;
}
template <typename Vertex, typename Edge, typename Face>
Edge* GraphFace<Vertex,Edge,Face>::getSimilarEdge(const Edge* edge) const
{
typename std::list<Edge*>::const_iterator e = edge_.begin();
while (e != edge_.end())
{
if (**e *= *edge)
{
return *e;
}
e++;
}
return NULL;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::substitute
(const Vertex* old_vertex, Vertex* new_vertex)
{
typename std::list<Vertex*>::iterator v = vertex_.begin();
while (v != vertex_.end())
{
if (*v == old_vertex)
{
*v = new_vertex;
return true;
}
v++;
}
return false;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::substitute
(const Edge* old_edge, Edge* new_edge)
{
typename std::list<Edge*>::iterator e = edge_.begin();
while (e != edge_.end())
{
if (*e == old_edge)
{
*e = new_edge;
return true;
}
e++;
}
return false;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::operator == (const Face&) const
{
return true;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::operator != (const Face&) const
{
return false;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphFace<Vertex,Edge,Face>::operator *= (const Face&) const
{
return true;
}
template <typename Vertex, typename Edge, typename Face>
Vertex* GraphFace<Vertex,Edge,Face>::has(Vertex* vertex) const
{
typename std::list<Vertex*>::const_iterator v = vertex_.begin();
while (v != vertex_.end())
{
if (*v == vertex)
{
return *v;
}
v++;
}
return NULL;
}
template <typename Vertex, typename Edge, typename Face>
Edge* GraphFace<Vertex,Edge,Face>::has(Edge* edge) const
{
typename std::list<Edge*>::const_iterator e = edge_.begin();
while (e != edge_.end())
{
if (*e == edge)
{
return *e;
}
e++;
}
return NULL;
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::VertexIterator
GraphFace<Vertex,Edge,Face>::beginVertex()
{
return vertex_.begin();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::ConstVertexIterator
GraphFace<Vertex,Edge,Face>::beginVertex() const
{
return vertex_.begin();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::VertexIterator
GraphFace<Vertex,Edge,Face>::endVertex()
{
return vertex_.end();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::ConstVertexIterator
GraphFace<Vertex,Edge,Face>::endVertex() const
{
return vertex_.end();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::EdgeIterator
GraphFace<Vertex,Edge,Face>::beginEdge()
{
return edge_.begin();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::ConstEdgeIterator
GraphFace<Vertex,Edge,Face>::beginEdge() const
{
return edge_.begin();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::EdgeIterator
GraphFace<Vertex,Edge,Face>::endEdge()
{
return edge_.end();
}
template <typename Vertex, typename Edge, typename Face>
typename GraphFace<Vertex,Edge,Face>::ConstEdgeIterator
GraphFace<Vertex,Edge,Face>::endEdge() const
{
return edge_.end();
}
/** Generic GraphTriangle Class.
\ingroup Surface
*/
template <typename Vertex, typename Edge, typename Face>
class GraphTriangle
{
public:
/** @name Class friends
- class GraphVertex<Vertex,Edge,Face>;
- class GraphEdge<Vertex,Edge,Face>;
*/
friend class GraphVertex<Vertex,Edge,Face>;
friend class GraphEdge<Vertex,Edge,Face>;
/** @name Constructors and Destructors
*/
//@{
BALL_CREATE(GraphTriangle)
/** Default constructor.
This method creates a new GraphTriangle object.
*/
GraphTriangle();
/** Copy constructor.
Create a new GraphTriangle object from another.
@param face the GraphTriangle object to be copied
@param deep if deep = false, all pointers are set to NULL (default).
Otherwise the new GraphTriangle object is linked to the
neighbours of the old GraphTriangle object.
*/
GraphTriangle
(const GraphTriangle<Vertex,Edge,Face>& face, bool deep = false);
/** Detailled constructor.
Create a new GraphTriangle object from some nice objects
@param vertex1 assigned to the first vertex
@param vertex2 assigned to the second vertex
@param vertex3 assigned to the third vertex
@param edge1 assigned to the first edge
@param edge2 assigned to the second edge
@param edge3 assigned to the third edge
@param index assigned to the index
*/
GraphTriangle
(Vertex* vertex1, Vertex* vertex2, Vertex* vertex3,
Edge* edge1, Edge* edge2, Edge* edge3,
Index index);
/** Destructor.
Destructs the GraphTriangle object.
*/
virtual ~GraphTriangle();
//@}
/** @name Assignment
*/
//@{
/** Assign from another GraphTriangle.
@param face the GraphTriangle object to assign from
@param deep if deep = false, all pointers are set to NULL
(default). Otherwise the GraphTriangle object is linked
to the neighbours of the GraphTriangle object to assign
from.
*/
void set(const GraphTriangle<Vertex,Edge,Face>& face, bool deep = false);
/** Assign from another GraphTriangle.
The GraphTriangle object is linked to the neighbours of the
GraphTriangle object to assifgn from.
@param face the GraphTriangle object to assign from
*/
GraphTriangle<Vertex,Edge,Face>& operator =
(const GraphTriangle<Vertex,Edge,Face>& face);
/** Assign to a lot of nice objects
@param vertex1 assigned to the first vertex
@param vertex2 assigned to the second vertex
@param vertex3 assigned to the third vertex
@param edge1 assigned to the first edge
@param edge2 assigned to the second edge
@param edge3 assigned to the third edge
@param index assigned to the index
*/
void set
(Vertex* vertex1, Vertex* vertex2, Vertex* vertex3,
Edge* edge1, Edge* edge2, Edge* edge3,
Index index);
//@}
/** @name Accessors
*/
//@{
/** Set one of the vertices of the GraphTriangle.
@param i the relative index of the vertex which should be set.
If i is greater three, an exception is thrown.
@param vertex a pointer to the new vertex
*/
void setVertex(Position i, Vertex* vertex)
throw(Exception::IndexOverflow);
/** Return one of the vertices of the GraphTriangle.
@param i the relative index of the vertex which should be given
back. If i is greater than three, an exception is
thrown.
@return Vertex* a pointer to the asked vertex
*/
Vertex* getVertex(Position i) const
throw(Exception::IndexOverflow);
/** Set one of the edges of the GraphTriangle.
@param i the relative index of the edge which should be set.
If i is greater than three, an exception is thrown.
@param edge a pointer to the new edge
*/
void setEdge(Position i, Edge* edge)
throw(Exception::IndexOverflow);
/** Return one of the edges of the GraphTriangle.
@param i the relative index of the edge which should be given
back. If i is greater than three, an exception is thrown.
@return Edge* a pointer to the asked vertex
*/
Edge* getEdge(Position i) const
throw(Exception::IndexOverflow);
/** Set the index of the GraphTriangle.
@param index the new index
*/
void setIndex(Index index);
/** Return the index of the GraphTriangle.
@return Index the index of the GraphTriangle
*/
Index getIndex() const;
/** Find the two edges of the GraphTriangle that belong to the given vertex.
@param vertex a pointer to the given vertex
@param edge1 a pointer to the first found edge
@param edge2 a pointer to the second found edge
@return bool <b>true</b> if the edges can be found,
<b>false</b> otherwise
*/
bool getEdges(const Vertex* vertex, Edge*& edge1, Edge*& edge2) const;
/** Find the edge of the GraphTriangle that belongs to the two given
vertices.
@param vertex1 a pointer to the first given vertex
@param vertex2 a pointer to the second given vertex
@param edge a pointer to the found edge
@return bool <b>true</b> if the edge can be found,
<b>false</b> otherwise
*/
bool getEdge
(const Vertex* vertex1,
const Vertex* vertex2,
Edge*& edge) const;
/** Find the edge of the GraphFace that is similar to the given edge.
@param edge a pointer to the given edge
@param similar_edge a pointer to the similar edge of te GraphFace
if it can be found, otherwise NULL
@return Index the relative index of the similar edge if it
can be found, otherwise -1
*/
Index getSimilarEdge(const Edge* edge, Edge*& similar_edge) const;
/** Return the relative index of a vertex in the GraphTriangle.
@return Index the relative index of the vertex
*/
Index getRelativeIndex(const Vertex* vertex) const;
/** Return the relative index of an edge in the GraphTriangle.
@return Index the relative index of the edge
*/
Index getRelativeIndex(const Edge* edge) const;
/** Return a pointer to the third vertex of the GraphTriangle.
@param v1 a pointer to the first vertex
@param v2 a pointer to the second vertex
@return Vertex* a pointer to the third vertex
*/
Vertex* third(const Vertex* v1, const Vertex* v2) const;
/** Return a pointer to the third edge of the GraphTriangle.
@param e1 a pointer to the first edge
@param e2 a pointer to the second edge
@return Edge* a pointer to the third edge
*/
Edge* third(const Edge* e1, const Edge* e2) const;
/** Get the edge of the GraphFace which lies on the opposite side of the
given vertex.
@param vertex a pointer to a vertex of the GraphTriangle
@return Edge* a pointer to the opposite Edge
*/
Edge* getOppositeEdge(const Vertex* vertex) const;
/** Get the vertex of the GraphFace which lies on the opposite side of the
given edge.
@param edge a pointer to an edge of the GraphTriangle
@return Vertex* a pointer to the opposite vertex
*/
Vertex* getOppositeVertex(const Edge* edge) const;
/** Substitute a vertex by an other one.
@param old_vertex the vertex that has to be substituted
@param new_vertex the new vertex
@return bool <b>true</b>, if the vertex can be substituted,
<b>false</b> otherwise
*/
bool substitute(const Vertex* old_vertex, Vertex* new_vertex);
/** Substitute an edge by an other one.
@param old_edge the edge that has to be substituted
@param new_edge the new edge
@return bool <b>true</b>, if the edge can be substituted,
<b>false</b> otherwise
*/
bool substitute(const Edge* old_edge, Edge* new_edge);
//@}
/** @name Predicates
*/
//@{
/** Equality operator.
@return bool <b>true</b>
*/
virtual bool operator == (const Face&) const;
/** Inequality operator.
@return bool <b>false</b>
*/
virtual bool operator != (const Face&) const;
/** Similarity operator.
@return bool <b>true</b>
*/
virtual bool operator *= (const Face&) const;
/** Test whether a vertex is meber of the face.
@param vertex a pointer to the the vertex to test
@return Vertex* a pointer to the vertex if it exists,
otherwise <b>NULL</b>
*/
Vertex* has(Vertex* vertex) const;
/** Test whether an edge is meber of the face.
@param edge a pointer to the edge to test
@return Edge* a pointer to the edge if it exists, otherwise <b>NULL</b>
*/
Edge* has(Edge* edge) const;
//@}
protected:
/*_ The vertices of the GraphTriangle
*/
Vertex* vertex_[3];
/*_ The edges of the GraphTriangle
*/
Edge* edge_[3];
/* The index of the GraphTriangle
*/
Index index_;
};
template <typename Vertex, typename Edge, typename Face>
GraphTriangle<Vertex,Edge,Face>::GraphTriangle()
: index_(-1)
{
vertex_[0] = NULL;
vertex_[1] = NULL;
vertex_[2] = NULL;
edge_[0] = NULL;
edge_[1] = NULL;
edge_[2] = NULL;
}
template <typename Vertex, typename Edge, typename Face>
GraphTriangle<Vertex,Edge,Face>::GraphTriangle
(const GraphTriangle<Vertex,Edge,Face>& face, bool deep)
: index_(face.index_)
{
if (deep)
{
vertex_[0] = face.vertex_[0];
vertex_[1] = face.vertex_[1];
vertex_[2] = face.vertex_[2];
edge_[0] = face.edge_[0];
edge_[1] = face.edge_[1];
edge_[2] = face.edge_[2];
}
else
{
vertex_[0] = NULL;
vertex_[1] = NULL;
vertex_[2] = NULL;
edge_[0] = NULL;
edge_[1] = NULL;
edge_[2] = NULL;
}
}
template <typename Vertex, typename Edge, typename Face>
GraphTriangle<Vertex,Edge,Face>::GraphTriangle
(Vertex* vertex1, Vertex* vertex2, Vertex* vertex3,
Edge* edge1, Edge* edge2, Edge* edge3,
Index index)
: index_(index)
{
vertex_[0] = vertex1;
vertex_[1] = vertex2;
vertex_[2] = vertex3;
edge_[0] = edge1;
edge_[1] = edge2;
edge_[2] = edge3;
}
template <typename Vertex, typename Edge, typename Face>
GraphTriangle<Vertex,Edge,Face>::~GraphTriangle()
{
}
template <typename Vertex, typename Edge, typename Face>
void GraphTriangle<Vertex,Edge,Face>::set
(const GraphTriangle<Vertex,Edge,Face>& face, bool deep)
{
if (this != &face)
{
if (deep)
{
vertex_[0] = face.vertex_[0];
vertex_[1] = face.vertex_[1];
vertex_[2] = face.vertex_[2];
edge_[0] = face.edge_[0];
edge_[1] = face.edge_[1];
edge_[2] = face.edge_[2];
}
else
{
vertex_[0] = NULL;
vertex_[1] = NULL;
vertex_[2] = NULL;
edge_[0] = NULL;
edge_[1] = NULL;
edge_[2] = NULL;
}
index_ = face.index_;
}
}
template <typename Vertex, typename Edge, typename Face>
GraphTriangle<Vertex,Edge,Face>& GraphTriangle<Vertex,Edge,Face>::operator =
(const GraphTriangle<Vertex,Edge,Face>& face)
{
if (this != &face)
{
vertex_[0] = face.vertex_[0];
vertex_[1] = face.vertex_[1];
vertex_[2] = face.vertex_[2];
edge_[0] = face.edge_[0];
edge_[1] = face.edge_[1];
edge_[2] = face.edge_[2];
index_ = face.index_;
}
return *this;
}
template <typename Vertex, typename Edge, typename Face>
void GraphTriangle<Vertex,Edge,Face>::set
(Vertex* vertex1, Vertex* vertex2, Vertex* vertex3,
Edge* edge1, Edge* edge2, Edge* edge3,
Index index)
{
vertex_[0] = vertex1;
vertex_[1] = vertex2;
vertex_[2] = vertex3;
edge_[0] = edge1;
edge_[1] = edge2;
edge_[2] = edge3;
index_ = index;
}
template <typename Vertex, typename Edge, typename Face>
void GraphTriangle<Vertex,Edge,Face>::setVertex(Position i, Vertex* vertex)
throw(Exception::IndexOverflow)
{
if (i > 2)
{
throw Exception::IndexOverflow(__FILE__,__LINE__,i,2);
}
else
{
vertex_[i] = vertex;
}
}
template <typename Vertex, typename Edge, typename Face>
Vertex* GraphTriangle<Vertex,Edge,Face>::getVertex(Position i) const
throw(Exception::IndexOverflow)
{
if (i > 2)
{
throw Exception::IndexOverflow(__FILE__,__LINE__,i,2);
}
else
{
return vertex_[i];
}
}
template <typename Vertex, typename Edge, typename Face>
void GraphTriangle<Vertex,Edge,Face>::setEdge(Position i, Edge* edge)
throw(Exception::IndexOverflow)
{
if (i > 2)
{
throw Exception::IndexOverflow(__FILE__,__LINE__,i,2);
}
else
{
edge_[i] = edge;
}
}
template <typename Vertex, typename Edge, typename Face>
Edge* GraphTriangle<Vertex,Edge,Face>::getEdge(Position i) const
throw(Exception::IndexOverflow)
{
if (i > 2)
{
throw Exception::IndexOverflow(__FILE__,__LINE__,i,2);
}
else
{
return edge_[i];
}
}
template <typename Vertex, typename Edge, typename Face>
void GraphTriangle<Vertex,Edge,Face>::setIndex(Index index)
{
index_ = index;
}
template <typename Vertex, typename Edge, typename Face>
Index GraphTriangle<Vertex,Edge,Face>::getIndex() const
{
return index_;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::getEdges
(const Vertex* vertex,
Edge*& edge1,
Edge*& edge2) const
{
Position i = 0;
bool found1 = false;
bool found2 = false;
while ((!found1) && (i < 3))
{
if (edge_[i] != NULL)
{
if ((edge_[i]->vertex_[0] == vertex) ||
(edge_[i]->vertex_[1] == vertex) )
{
edge1 = edge_[i];
found1 = true;
}
}
i++;
}
if (found1)
{
while ((!found2) && (i < 3))
{
if (edge_[i] != NULL)
{
if ((edge_[i]->vertex_[0] == vertex) ||
(edge_[i]->vertex_[1] == vertex) )
{
edge2 = edge_[i];
found2 = true;
}
}
i++;
}
}
return (found1 && found2);
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::getEdge
(const Vertex* vertex1,
const Vertex* vertex2,
Edge*& edge) const
{
Position i = 0;
bool found = false;
while ((!found) && (i < 3))
{
if (edge_[i] != NULL)
{
if (((edge_[i]->vertex_[0] == vertex1) &&
(edge_[i]->vertex_[1] == vertex2) ) ||
((edge_[i]->vertex_[0] == vertex2) &&
(edge_[i]->vertex_[1] == vertex1) ) )
{
edge = edge_[i];
found = true;
}
}
i++;
}
return found;
}
template <typename Vertex, typename Edge, typename Face>
Index GraphTriangle<Vertex,Edge,Face>::getSimilarEdge
(const Edge* edge, Edge*& similar_edge) const
{
if (*edge_[0] *= *edge)
{
similar_edge = edge_[0];
return 0;
}
if (*edge_[1] *= *edge)
{
similar_edge = edge_[1];
return 1;
}
if (*edge_[2] *= *edge)
{
similar_edge = edge_[2];
return 2;
}
similar_edge = NULL;
return -1;
}
template <typename Vertex, typename Edge, typename Face>
Index GraphTriangle<Vertex,Edge,Face>::getRelativeIndex
(const Vertex* vertex) const
{
for (Position i = 0; i < 3; i++)
{
if (vertex_[i] == vertex)
{
return i;
}
}
return -1;
}
template <typename Vertex, typename Edge, typename Face>
Index GraphTriangle<Vertex,Edge,Face>::getRelativeIndex
(const Edge* edge) const
{
for (Position i = 0; i < 3; i++)
{
if (edge_[i] == edge)
{
return i;
}
}
return -1;
}
template <typename Vertex, typename Edge, typename Face>
Vertex* GraphTriangle<Vertex,Edge,Face>::third
(const Vertex* v1, const Vertex* v2) const
{
if ((vertex_[0] == v1) || (vertex_[0] == v2))
{
if ((vertex_[1] == v1) || (vertex_[1] == v2))
{
return vertex_[2];
}
else
{
return vertex_[1];
}
}
else
{
return vertex_[0];
}
}
template <typename Vertex, typename Edge, typename Face>
Edge* GraphTriangle<Vertex,Edge,Face>::third
(const Edge* e1, const Edge* e2) const
{
if ((edge_[0] == e1) || (edge_[0] == e2))
{
if ((edge_[1] == e1) || (edge_[1] == e2))
{
return edge_[2];
}
else
{
return edge_[1];
}
}
else
{
return edge_[0];
}
}
template <typename Vertex, typename Edge, typename Face>
Edge* GraphTriangle<Vertex,Edge,Face>::getOppositeEdge
(const Vertex* vertex) const
{
for (Position i = 0; i < 3; i++)
{
if ((edge_[i]->vertex_[0] != vertex) &&
(edge_[i]->vertex_[1] != vertex) )
{
return edge_[i];
}
}
return NULL;
}
template <typename Vertex, typename Edge, typename Face>
Vertex* GraphTriangle<Vertex,Edge,Face>::getOppositeVertex
(const Edge* edge) const
{
for (Position i = 0; i < 3; i++)
{
if ((vertex_[i] != edge->vertex_[0]) &&
(vertex_[i] != edge->vertex_[1]) )
{
return vertex_[i];
}
}
return NULL;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::substitute
(const Vertex* old_vertex, Vertex* new_vertex)
{
for (Position i = 0; i < 3; i++)
{
if (vertex_[i] == old_vertex)
{
vertex_[i] = new_vertex;
return true;
}
}
return false;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::substitute
(const Edge* old_edge, Edge* new_edge)
{
for (Position i = 0; i < 3; i++)
{
if (edge_[i] == old_edge)
{
edge_[i] = new_edge;
return true;
}
}
return false;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::operator == (const Face&) const
{
return true;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::operator != (const Face&) const
{
return false;
}
template <typename Vertex, typename Edge, typename Face>
bool GraphTriangle<Vertex,Edge,Face>::operator *= (const Face&) const
{
return true;
}
template <typename Vertex, typename Edge, typename Face>
Vertex* GraphTriangle<Vertex,Edge,Face>::has(Vertex* vertex) const
{
if (vertex_[0] == vertex)
{
return vertex_[0];
}
if (vertex_[1] == vertex)
{
return vertex_[1];
}
if (vertex_[2] == vertex)
{
return vertex_[2];
}
return NULL;
}
template <typename Vertex, typename Edge, typename Face>
Edge* GraphTriangle<Vertex,Edge,Face>::has(Edge* edge) const
{
if (edge_[0] == edge)
{
return edge_[0];
}
if (edge_[1] == edge)
{
return edge_[1];
}
if (edge_[2] == edge)
{
return edge_[2];
}
return NULL;
}
} // namespace BALL
#endif // BALL_STRUCTURE_RSFACE_H
|