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
|
// Copyright (c) 2003-2008 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.6-branch/Circular_kernel_2/include/CGAL/Circular_kernel_2/function_objects_polynomial_circular.h $
// $Id: function_objects_polynomial_circular.h 51456 2009-08-24 17:10:04Z spion $
//
// Author(s) : Monique Teillaud, Sylvain Pion, Pedro Machado
// Partially supported by the IST Programme of the EU as a Shared-cost
// RTD (FET Open) Project under Contract No IST-2000-26473
// (ECG - Effective Computational Geometry for Curves and Surfaces)
// and a STREP (FET Open) Project under Contract No IST-006413
// (ACS -- Algorithms for Complex Shapes)
#ifndef CGAL_CIRCULAR_KERNEL_FUNCTION_OBJECTS_POLYNOMIAL_CIRCULAR_H
#define CGAL_CIRCULAR_KERNEL_FUNCTION_OBJECTS_POLYNOMIAL_CIRCULAR_H
#include <CGAL/Circular_kernel_intersections.h>
#include <CGAL/Circular_kernel_2/internal_functions_on_circular_arc_2.h>
#include <CGAL/Circular_kernel_2/internal_functions_on_line_arc_2.h>
#include <CGAL/Bbox_2.h>
#include <CGAL/Object.h>
namespace CGAL {
namespace CircularFunctors {
template < class CK >
class Compare_x_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Compare_x_2
#endif
{
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Point_2 Point_2;
public:
typedef typename CK::Linear_kernel::Compare_x_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Compare_x_2::operator();
#else
typedef typename CK::Linear_kernel LK;
typedef typename LK::Compare_x_2 LK_Compare_x_2;
typedef typename CK::Line_2 Line_2;
result_type
operator() (const Point_2 &p0,
const Point_2 &p1) const
{
return LK_Compare_x_2()(p0, p1);
}
result_type
operator() (const Point_2 &p0,
const Line_2 &p1,
const Line_2 &p2) const
{
return LK_Compare_x_2()(p0, p1,p2);
}
result_type
operator() (const Line_2 &p0,
const Line_2 &p1,
const Line_2 &p2) const
{
return LK_Compare_x_2()(p0, p1,p2);
}
result_type
operator() (const Line_2 &p0,
const Line_2 &p1,
const Line_2 &p2,
const Line_2 &p3) const
{
return LK_Compare_x_2()(p0, p1,p2,p3);
}
#endif
result_type
operator() (const Circular_arc_point_2 &p0,
const Circular_arc_point_2 &p1) const
{ return CircularFunctors::compare_x<CK>(p0, p1);}
};
template < class CK >
class Compare_y_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Compare_y_2
#endif
{
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Point_2 Point_2;
public:
typedef typename CK::Linear_kernel::Compare_y_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Compare_y_2::operator();
#else
typedef typename CK::Linear_kernel LK;
typedef typename LK::Compare_y_2 LK_Compare_y_2;
typedef typename CK::Line_2 Line_2;
result_type
operator() (const Point_2 &p0,
const Point_2 &p1) const
{
return LK_Compare_y_2()(p0, p1);
}
result_type
operator() (const Point_2 &p0,
const Line_2 &p1,
const Line_2 &p2) const
{
return LK_Compare_y_2()(p0, p1,p2);
}
result_type
operator() (const Line_2 &p0,
const Line_2 &p1,
const Line_2 &p2) const
{
return LK_Compare_y_2()(p0, p1,p2);
}
result_type
operator() (const Line_2 &p0,
const Line_2 &p1,
const Line_2 &p2,
const Line_2 &p3) const
{
return LK_Compare_y_2()(p0, p1,p2,p3);
}
#endif
result_type
operator() (const Circular_arc_point_2 &p0,
const Circular_arc_point_2 &p1) const
{return CircularFunctors::compare_y<CK>(p0, p1);}
};
template < class CK >
class Compare_xy_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Compare_xy_2
#endif
{
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Point_2 Point_2;
public:
typedef typename CK::Linear_kernel::Compare_xy_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Compare_xy_2::operator();
#else
result_type
operator() (const Point_2 &p0,
const Point_2 &p1) const
{
typedef typename CK::Linear_kernel LK;
typedef typename LK::Compare_xy_2 LK_Compare_xy_2;
return LK_Compare_xy_2()(p0, p1);
}
#endif
result_type
operator() (const Circular_arc_point_2 &p0,
const Circular_arc_point_2 &p1) const
{ return CircularFunctors::compare_xy<CK>(p0, p1);}
};
template < class CK >
class In_x_range_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef bool result_type;
result_type
operator()(const Circular_arc_2 &a, const Circular_arc_point_2 &p) const
{ return CircularFunctors::point_in_x_range<CK>(a, p); }
result_type
operator()(const Line_arc_2 &a, const Circular_arc_point_2 &p) const
{ return CircularFunctors::point_in_x_range<CK>(a, p); }
};
template < class CK >
class Has_on_2
: public CK::Linear_kernel::Has_on_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Circle_2 Circle_2;
typedef typename CK::Line_2 Line_2;
public:
typedef typename CK::Linear_kernel::Has_on_2::result_type result_type;
using CK::Linear_kernel::Has_on_2::operator();
result_type
operator()(const Circle_2 &a, const Circular_arc_point_2 &p) const
{ return CircularFunctors::has_on<CK>(a, p); }
result_type
operator()(const Line_2 &a, const Circular_arc_point_2 &p) const
{ return LinearFunctors::has_on<CK>(a, p); }
result_type
operator()(const Circular_arc_2 &a, const Circular_arc_point_2 &p) const
{ return CircularFunctors::has_on<CK>(a, p); }
result_type
operator()(const Line_arc_2 &a, const Circular_arc_point_2 &p) const
{ return CircularFunctors::has_on<CK>(a, p); }
};
template < class CK >
class Compare_y_to_right_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef CGAL::Comparison_result result_type;
result_type
operator()(const Circular_arc_2 &a1,
const Circular_arc_2 &a2,
const Circular_arc_point_2 &p) const
{ return CircularFunctors::compare_y_to_right<CK>(a1, a2, p); }
result_type
operator()(const Line_arc_2 &a1,
const Line_arc_2 &a2,
const Circular_arc_point_2 &p) const
{ return CircularFunctors::compare_y_to_right<CK>(a1, a2, p); }
result_type
operator()(const Line_arc_2 &a1,
const Circular_arc_2 &a2,
const Circular_arc_point_2 &p) const
{ return CircularFunctors::compare_y_to_right<CK>(a1, a2, p); }
result_type
operator()(const Circular_arc_2 &a1,
const Line_arc_2 &a2,
const Circular_arc_point_2 &p) const
{ if (CircularFunctors::compare_y_to_right<CK>(a2, a1, p) == CGAL::LARGER)
return CGAL::SMALLER;
return CGAL::LARGER;
}
};
template < class CK >
class Equal_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Equal_2
#endif
{
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef typename CK::Linear_kernel LK;
typedef typename LK::Equal_2 LK_Equal_2;
typedef typename LK::Point_2 Point_2;
typedef typename LK::Vector_2 Vector_2;
typedef typename LK::Direction_2 Direction_2;
typedef typename LK::Segment_2 Segment_2;
typedef typename LK::Ray_2 Ray_2;
typedef typename LK::Line_2 Line_2;
typedef typename LK::Triangle_2 Triangle_2;
typedef typename LK::Iso_rectangle_2 Iso_rectangle_2;
typedef typename LK::Circle_2 Circle_2;
typedef typename CK::Linear_kernel::Equal_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Equal_2::operator();
#else
result_type
operator() (const Point_2 &p0,
const Point_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Vector_2 &p0,
const Vector_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Vector_2 &p0,
const Null_vector &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Null_vector &p0,
const Vector_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Direction_2 &p0,
const Direction_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Segment_2 &p0,
const Segment_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Ray_2 &p0,
const Ray_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Line_2 &p0,
const Line_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Triangle_2 &p0,
const Triangle_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Iso_rectangle_2 &p0,
const Iso_rectangle_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
result_type
operator() (const Circle_2 &p0,
const Circle_2 &p1) const
{ return LK_Equal_2()(p0,p1); }
#endif
result_type
operator() (const Circular_arc_point_2 &p0,
const Circular_arc_point_2 &p1) const
{ return CircularFunctors::equal<CK>(p0, p1); }
result_type
operator() (const Circular_arc_2 &a0, const Circular_arc_2 &a1) const
{ return CircularFunctors::equal<CK>(a0, a1); }
result_type
operator() (const Line_arc_2 &a0, const Line_arc_2 &a1) const
{ return CircularFunctors::equal<CK>(a0, a1); }
};
template < class CK >
class Compare_y_at_x_2 : public CK::Linear_kernel::Compare_y_at_x_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef typename CK::Linear_kernel::Compare_y_at_x_2::result_type result_type;
using CK::Linear_kernel::Compare_y_at_x_2::operator();
result_type
operator() (const Circular_arc_point_2 &p,
const Circular_arc_2 &A1) const
{ return CircularFunctors::compare_y_at_x<CK>(p, A1); }
result_type
operator() (const Circular_arc_point_2 &p,
const Line_arc_2 &A1) const
{ return CircularFunctors::compare_y_at_x<CK>(p, A1); }
};
template < class CK >
class Do_overlap_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef bool result_type;
result_type
operator() (const Circular_arc_2 &A1, const Circular_arc_2 &A2) const
{ return CircularFunctors::do_overlap<CK>(A1, A2); }
result_type
operator() (const Line_arc_2 &A1, const Line_arc_2 &A2) const
{ return CircularFunctors::do_overlap<CK>(A1, A2); }
};
template < class CK >
class Make_x_monotone_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef void result_type; //!!!
template < class OutputIterator >
OutputIterator
operator()(const Circular_arc_2 &A, OutputIterator res) const
{
return CircularFunctors::make_x_monotone<CK> (A, res);
}
template < class OutputIterator >
OutputIterator
operator()(const Line_arc_2 &A, OutputIterator res) const
{
return CircularFunctors::make_x_monotone<CK>(A,res);
}
};
template < class CK >
class Make_xy_monotone_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef void result_type; //!!!
template < class OutputIterator >
OutputIterator
operator()(const Circular_arc_2 &A, OutputIterator res) const
{
typedef std::pair<bool, bool> relat_pos;
typedef std::pair< CGAL::Object, relat_pos> Obj_descr_2;
std::vector<Obj_descr_2> vec;
CircularFunctors::advanced_make_xy_monotone<CK> (A, std::back_inserter(vec));
for(unsigned i=0;i<vec.size();++i)
*res++=vec.at(i).first;
return res;
}
template < class OutputIterator >
OutputIterator
operator()(const Line_arc_2 &A, OutputIterator res) const
{ *res++ = make_object(A);
return res;
}
};
template < class CK >
class Do_intersect_2
: public CK::Linear_kernel::Do_intersect_2
{
public:
typedef typename CK::Linear_kernel::Do_intersect_2::result_type result_type;
template <class T1, class T2>
result_type
operator()(const T1& t1, const T2& t2) const
{ return internal::do_intersect(t1, t2, CK()); }
};
template < class CK >
class Intersect_2
: public CK::Linear_kernel::Intersect_2
{
typedef typename CK::Circle_2 Circle;
typedef typename CK::Circular_arc_2 Circular_arc;
typedef typename CK::Line_arc_2 Line_arc;
typedef typename CK::Line_2 Line;
public:
typedef typename CK::Linear_kernel::Intersect_2::result_type result_type;
using CK::Linear_kernel::Intersect_2::operator();
template < class OutputIterator >
OutputIterator
operator()(const Line & c1, const Circle & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circle & c1, const Line & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c2,c1,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circle & c1, const Circle & c2, OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circle & c1, const Circular_arc & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (Circular_arc(c1),c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circular_arc & c1, const Circle & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,Circular_arc(c2),res); }
template < class OutputIterator >
OutputIterator
operator()(const Circular_arc & c1, const Circular_arc & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Line_arc & c1, const Line_arc & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Line_arc & c1, const Circle & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circle & c1, const Line_arc & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c2,c1,res); }
template < class OutputIterator >
OutputIterator
operator()(const Line_arc & c1, const Circular_arc & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c1,c2,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circular_arc & c1, const Line_arc & c2,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (c2,c1,res); }
template < class OutputIterator >
OutputIterator
operator()(const Line & l, const Circular_arc & c,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (l,c,res); }
template < class OutputIterator >
OutputIterator
operator()(const Line & l, const Line_arc & la,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (l,la,res); }
template < class OutputIterator >
OutputIterator
operator()(const Circular_arc & c, const Line & l,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (l,c,res); }
template < class OutputIterator >
OutputIterator
operator()(const Line_arc & la, const Line & l,
OutputIterator res) const
{ return CircularFunctors::intersect_2<CK> (l,la,res); }
};
template < class CK >
class Get_equation
{
public:
typedef void result_type;
typename CK::Polynomial_1_2
operator() ( const typename CK::Line_2 & l )
{
return LinearFunctors::get_equation<CK>(l);
}
typename CK::Polynomial_for_circles_2_2
operator() ( const typename CK::Circle_2 & c )
{
return CircularFunctors::get_equation<CK>(c);
}
};
template < class CK >
class Split_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef void result_type;
result_type
operator()(const Circular_arc_2 &A,
const Circular_arc_point_2 &p,
Circular_arc_2 &ca1, Circular_arc_2 &ca2) const
{ return CircularFunctors::split<CK>(A, p, ca1, ca2); }
result_type
operator()(const Line_arc_2 &A,
const Circular_arc_point_2 &p,
Line_arc_2 &ca1, Line_arc_2 &ca2) const
{ return CircularFunctors::split<CK>(A, p, ca1, ca2); }
};
template < class CK >
class Is_vertical_2
: public CK::Linear_kernel::Is_vertical_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef typename CK::Linear_kernel::Is_vertical_2::result_type result_type;
using CK::Linear_kernel::Is_vertical_2::operator();
result_type
operator()(const Circular_arc_2 &A) const
{ return CircularFunctors::is_vertical<CK>(A); }
result_type
operator()(const Line_arc_2 &A) const
{ return CircularFunctors::is_vertical<CK>(A); }
};
template < class CK >
class Construct_circular_arc_2
{
typedef typename CK::FT FT;
typedef typename CK::RT RT;
typedef typename CK::Point_2 Point_2;
typedef typename CK::Line_2 Line_2;
typedef typename CK::Circle_2 Circle_2;
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Kernel_base::Circular_arc_2 RCircular_arc_2;
typedef typename Circular_arc_2::Rep Rep;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef Circular_arc_2 result_type;
result_type
operator()(void)
{ return Rep(); }
result_type
operator()(const Circle_2 &c) const
{ return Rep(c); }
result_type
operator()(const Circle_2 &support,
const Circular_arc_point_2 &source,
const Circular_arc_point_2 &target) const
{ return Rep(support,source,target); }
// Not Documented
result_type
operator()(const Circle_2 &support,
const Line_2 &l1, bool b1,
const Line_2 &l2, bool b2) const
{ return Rep(support,l1,b1,l2,b2); }
// Not Documented
result_type
operator()(const Circle_2 &c,
const Circle_2 &c1, bool b_1,
const Circle_2 &c2, bool b_2) const
{ return Rep(c,c1,b_1,c2,b_2); }
result_type
operator()(const Point_2 &begin,
const Point_2 &middle,
const Point_2 &end) const
{ return Rep(begin,middle,end); }
// Not Documented
result_type
operator()(const Point_2 &begin,
const Point_2 &end,
const FT& bulge) const
{ return Rep(begin,end,bulge); }
};
template < class CK >
class Construct_line_arc_2
{
typedef typename CK::Point_2 Point_2;
typedef typename CK::Line_2 Line_2;
typedef typename CK::Circle_2 Circle_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Segment_2 Segment_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Kernel_base::Line_arc_2 RLine_arc_2;
typedef typename Line_arc_2::Rep Rep;
public:
typedef Line_arc_2 result_type;
result_type
operator()(void)
{ return Rep(); }
// Not Documented
result_type
operator()(const Line_2 &support,
const Circle_2 &c1,const bool b1,
const Circle_2 &c2,const bool b2) const
{ return Rep(support,c1,b1,c2,b2); }
// Not Documented
result_type
operator()(const Line_2 &support,
const Line_2 &l1,
const Line_2 &l2) const
{ return Rep(support,l1,l2); }
result_type
operator()(const Line_2 &support,
const Circular_arc_point_2 &p1,
const Circular_arc_point_2 &p2) const
{ return Rep(support,p1,p2); }
// result_type
// operator()(const Line_2 &support,
// const Point_2 &p1,
// const Point_2 &p2) const
// { return Rep(support,p1,p2); }
result_type
operator()(const Segment_2 &s) const
{ return Rep(s); }
result_type
operator()(const Point_2 &p1,
const Point_2 &p2) const
{ return Rep(p1,p2); }
};
template < class CK >
class Construct_circular_arc_point_2
{
typedef typename CK::Point_2 Point_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Kernel_base::Circular_arc_point_2
RCircular_arc_point_2;
typedef typename Circular_arc_point_2::Rep Rep;
typedef typename Circular_arc_point_2::Root_for_circles_2_2
Root_for_circles_2_2;
public:
typedef Circular_arc_point_2 result_type;
result_type
operator()(void)
{ return Rep(); }
result_type
operator()(const Root_for_circles_2_2 & np) const
{ return Rep(np); }
result_type
operator()(const Point_2 & p) const
{ return Rep(p); }
};
template <class CK>
class Compute_circular_x_2: Has_qrt
{
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Root_of_2 Root_of_2;
public:
typedef Root_of_2 result_type;
typedef const result_type & qualified_result_type;
qualified_result_type operator() (const Circular_arc_point_2 & a) const
{
return (a.rep().x());
}
};
template <class CK>
class Compute_circular_y_2: Has_qrt
{
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Root_of_2 Root_of_2;
public:
typedef Root_of_2 result_type;
typedef const result_type & qualified_result_type;
qualified_result_type operator() (const Circular_arc_point_2 & a) const
{
return (a.rep().y());
}
};
template <class CK>
class Construct_circular_min_vertex_2 : Has_qrt
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef Circular_arc_point_2 result_type;
typedef const result_type & qualified_result_type;
qualified_result_type operator() (const Circular_arc_2 & a) const
{
// if (a.rep().Cache_minmax == 't')
// return (a.rep().source());
// if (a.rep().Cache_minmax == 's')
// return (a.rep().target());
return (a.rep().left());
}
qualified_result_type operator() (const Line_arc_2 & a) const
{
return (a.rep().left());
}
};
template <class CK>
class Construct_circular_max_vertex_2: Has_qrt
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef Circular_arc_point_2 result_type;
typedef const result_type & qualified_result_type;
qualified_result_type operator() (const Circular_arc_2 & a) const
{
// if (a.rep().Cache_minmax == 's')
// return (a.rep().source());
// if (a.rep().Cache_minmax == 't')
// return (a.rep().target());
return (a.rep().right());
}
qualified_result_type operator() (const Line_arc_2 & a) const
{
return (a.rep().right());
}
};
template <class CK>
class Construct_circular_source_vertex_2: Has_qrt
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef Circular_arc_point_2 result_type;
typedef const result_type & qualified_result_type;
qualified_result_type operator() (const Circular_arc_2 & a) const
{ return a.rep().source(); }
qualified_result_type operator() (const Line_arc_2 & a) const
{ return a.rep().source();}
};
template <class CK>
class Construct_circular_target_vertex_2: Has_qrt
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef Circular_arc_point_2 result_type;
typedef const result_type & qualified_result_type;
qualified_result_type operator() (const Circular_arc_2 & a) const
{ return a.rep().target();}
qualified_result_type operator() (const Line_arc_2 & a) const
{ return a.rep().target();}
};
template <class CK>
class Is_x_monotone_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef bool result_type;
result_type operator() (const Circular_arc_2 & a) const
{
return (a.rep().is_x_monotone());
}
result_type operator() (const Line_arc_2 & a) const
{
return (a.rep().is_x_monotone());
}
};
template <class CK>
class Is_y_monotone_2
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Line_arc_2 Line_arc_2;
public:
typedef bool result_type;
result_type operator() (const Circular_arc_2 & a) const
{
return (a.rep().is_y_monotone());
}
result_type operator() (const Line_arc_2 & a) const
{
return (a.rep().is_y_monotone());
}
};
template <class CK>
class Construct_bbox_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Construct_bbox_2
#endif
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Circle_2 Circle_2;
public:
typedef typename CK::Linear_kernel::Construct_bbox_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Construct_bbox_2::operator();
#else
typedef typename CK::Linear_kernel LK;
typedef typename LK::Construct_bbox_2 LK_Construct_bbox_2;
typedef typename LK::Point_2 Point_2;
typedef typename LK::Segment_2 Segment_2;
typedef typename LK::Triangle_2 Triangle_2 ;
typedef typename LK::Iso_rectangle_2 Iso_rectangle_2 ;
result_type operator() (const Circle_2 & a) const
{
return LK_Construct_bbox_2()(a);
}
result_type operator() (const Point_2 & a) const
{
return LK_Construct_bbox_2()(a);
}
result_type operator() (const Segment_2 & a) const
{
return LK_Construct_bbox_2()(a);
}
result_type operator() (const Triangle_2 & a) const
{
return LK_Construct_bbox_2()(a);
}
result_type operator() (const Iso_rectangle_2 & a) const
{
return LK_Construct_bbox_2()(a);
}
#endif
result_type operator() (const Circular_arc_point_2 & a) const
{
return a.rep().bbox();
}
result_type operator() (const Circular_arc_2 & a) const
{
return a.rep().bbox();
}
result_type operator() (const Line_arc_2 & a) const
{
return a.rep().bbox();
}
};
template <class CK>
class Bounded_side_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Bounded_side_2
#endif
{
typedef typename CK::Circle_2 Circle_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef typename CK::Linear_kernel::Bounded_side_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Bounded_side_2::operator();
#else
typedef typename CK::Point_2 Point_2;
typedef typename CK::Triangle_2 Triangle_2;
typedef typename CK::Iso_rectangle_2 Iso_rectangle_2;
typedef typename CK::Linear_kernel LK;
typedef typename LK::Bounded_side_2 LK_Bounded_side_2;
result_type
operator()(const Circle_2& c, const Point_2& p) const
{ return LK_Bounded_side_2()(c,p); }
result_type
operator()(const Triangle_2& c, const Point_2& p) const
{ return LK_Bounded_side_2()(c,p); }
result_type
operator()(const Iso_rectangle_2& c, const Point_2& p) const
{ return LK_Bounded_side_2()(c,p); }
#endif
result_type
operator()(const Circle_2& c, const Circular_arc_point_2& p) const
{ return CircularFunctors::bounded_side<CK>(c,p); }
};
template <class CK>
class Has_on_bounded_side_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Has_on_bounded_side_2
#endif
{
typedef typename CK::Circle_2 Circle_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef typename CK::Linear_kernel::Has_on_bounded_side_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Has_on_bounded_side_2::operator();
#else
typedef typename CK::Point_2 Point_2;
typedef typename CK::Triangle_2 Triangle_2;
typedef typename CK::Iso_rectangle_2 Iso_rectangle_2;
typedef typename CK::Linear_kernel LK;
typedef typename LK::Has_on_bounded_side_2 LK_Has_on_bounded_side_2;
result_type
operator()(const Circle_2& c, const Point_2& p) const
{ return LK_Has_on_bounded_side_2()(c,p); }
result_type
operator()(const Triangle_2& c, const Point_2& p) const
{ return LK_Has_on_bounded_side_2()(c,p); }
result_type
operator()(const Iso_rectangle_2& c, const Point_2& p) const
{ return LK_Has_on_bounded_side_2()(c,p); }
#endif
result_type
operator()(const Circle_2& c, const Circular_arc_point_2& p) const
{ return CK().bounded_side_2_object()(c,p) == ON_BOUNDED_SIDE; }
};
template <class CK>
class Has_on_unbounded_side_2
#ifndef CGAL_CFG_MATCHING_BUG_6
: public CK::Linear_kernel::Has_on_unbounded_side_2
#endif
{
typedef typename CK::Circle_2 Circle_2;
typedef typename CK::Circular_arc_point_2 Circular_arc_point_2;
public:
typedef typename CK::Linear_kernel::Has_on_unbounded_side_2::result_type result_type;
#ifndef CGAL_CFG_MATCHING_BUG_6
using CK::Linear_kernel::Has_on_unbounded_side_2::operator();
#else
typedef typename CK::Point_2 Point_2;
typedef typename CK::Triangle_2 Triangle_2;
typedef typename CK::Iso_rectangle_2 Iso_rectangle_2;
typedef typename CK::Linear_kernel LK;
typedef typename LK::Has_on_unbounded_side_2 LK_Has_on_unbounded_side_2;
result_type
operator()(const Circle_2& c, const Point_2& p) const
{ return LK_Has_on_unbounded_side_2()(c,p); }
result_type
operator()(const Triangle_2& c, const Point_2& p) const
{ return LK_Has_on_unbounded_side_2()(c,p); }
result_type
operator()(const Iso_rectangle_2& c, const Point_2& p) const
{ return LK_Has_on_unbounded_side_2()(c,p); }
#endif
result_type
operator()(const Circle_2& c, const Circular_arc_point_2& p) const
{ return CK().bounded_side_2_object()(c,p) == ON_UNBOUNDED_SIDE; }
};
#ifndef CGAL_NO_DEPRECATED_CODE
template <class CK>
class Construct_supporting_circle_2: Has_qrt
{
typedef typename CK::Circular_arc_2 Circular_arc_2;
typedef typename CK::Circle_2 Circle_2;
public:
typedef Circle_2 result_type;
CGAL_DEPRECATED result_type operator() (const Circular_arc_2 & a) const
{
return CK().construct_circle_2_object()(a);
}
};
template <class CK>
class Construct_supporting_line_2: Has_qrt
{
typedef typename CK::Line_arc_2 Line_arc_2;
typedef typename CK::Line_2 Line_2;
typedef typename CK::Circle_2 Circle_2;
public:
typedef Line_2 result_type;
CGAL_DEPRECATED result_type operator() (const Line_arc_2 & a) const
{
return CK().construct_line_2_object()(a);
}
};
#endif
} // namespace CircularFunctors
} // namespace CGAL
#endif // CGAL_CIRCULAR_KERNEL_FUNCTION_OBJECTS_POLYNOMIAL_CIRCULAR_H
|