Home
last modified time | relevance | path

Searched refs:Point_2 (Results 1 – 25 of 1116) sorted by relevance

12345678910>>...45

/dports/math/cgal/CGAL-5.3/include/CGAL/Partition_2/
H A DIndirect_edge_compare.h34 typedef typename Traits::Point_2 Point_2; typedef
62 … return compare_x_at_y(Point_2(*vertex), Point_2(*edge_vtx_1), Point_2(*edge_vtx_2)) == SMALLER; in larger_x_at_vertex_y()
66 Comparison_result compare_x_at_y(const Point_2& p, const Point_2& a, const Point_2& b) const in compare_x_at_y()
104 if(_compare_y_2(Point_2(*p), Point_2(*after_p)) == EQUAL) in operator()
106 if(_compare_y_2(Point_2(*q), Point_2(*after_q)) == EQUAL) in operator()
122 return (compare_x_at_y(Point_2(*p), Point_2(*q), Point_2(*after_q)) == LARGER); in operator()
127 bool q_larger_x = compare_x_at_y(Point_2(*q), Point_2(*p), Point_2(*after_p)) == SMALLER; in operator()
128 …bool after_q_larger_x = compare_x_at_y(Point_2(*after_q), Point_2(*p), Point_2(*after_p)) == SMALL… in operator()
134 if(_compare_y_2(Point_2(*q), Point_2(*after_q)) == EQUAL) in operator()
136 return compare_x_at_y(Point_2(*q), Point_2(*p), Point_2(*after_p)) == LARGER; in operator()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DBounded_kernel.h87 typedef typename Base::Point_2 Point_2;
113 Point_2
119 Point_2
126 Point_2
135 Point_2
142 Point_2
157 Point_2
197 Point_2
205 Point_2
307 orientation(const Point_2& p1, const Point_2& p2, const Point_2& p3) const
[all …]
H A DSegment_Delaunay_graph_site_2.h39 typedef typename Geom_traits::Point_2 Point_2; typedef
206 void initialize_site(const Point_2& p1, const Point_2& p2) in initialize_site()
212 void initialize_site(const Point_2& p1, const Point_2& p2, in initialize_site()
213 const Point_2& q1, const Point_2& q2) in initialize_site()
226 void initialize_site(const Point_2& p1, const Point_2& p2, in initialize_site()
227 const Point_2& q1, const Point_2& q2, in initialize_site()
228 const Point_2& r1, const Point_2& r2) in initialize_site()
239 void initialize_site(const Point_2& p1, const Point_2& p2, in initialize_site()
240 const Point_2& q1, const Point_2& q2, in initialize_site()
274 static Point_2
[all …]
H A DSegment_Delaunay_graph_simple_site_2.h42 typedef typename R::Point_2 Point_2; typedef
57 static Self construct_site_2(const Point_2& p0, const Point_2& p1) { in construct_site_2()
83 static Self construct_site_2(const Point_2& , const Point_2& , in construct_site_2() argument
84 const Point_2& , const Point_2& , in construct_site_2()
90 static Self construct_site_2(const Point_2& , const Point_2& , in construct_site_2() argument
91 const Point_2& , const Point_2& , in construct_site_2()
92 const Point_2& , const Point_2& ) { in construct_site_2()
202 void initialize_site(const Point_2& p1, const Point_2& p2) in initialize_site()
210 Point_2 p_[2];
234 typedef typename Site_2::Point_2 Point_2; typedef
[all …]
H A DIntersection_traits_2.h24 CGAL_INTERSECTION_TRAITS_2(Line_2, Line_2, Point_2, Line_2)
26 CGAL_INTERSECTION_TRAITS_2(Segment_2, Line_2, Point_2, Segment_2)
27 CGAL_INTERSECTION_TRAITS_2(Line_2, Segment_2, Point_2, Segment_2)
31 CGAL_INTERSECTION_TRAITS_2(Ray_2, Line_2, Point_2, Ray_2)
32 CGAL_INTERSECTION_TRAITS_2(Line_2, Ray_2, Point_2, Ray_2)
34 CGAL_INTERSECTION_TRAITS_2(Ray_2, Segment_2, Point_2, Segment_2)
51 boost::variant< typename K::Point_2, typename K::Segment_2,
78 struct Intersection_traits<K, typename K::Point_2, B> {
84 struct Intersection_traits<K, A, typename K::Point_2> {
90 struct Intersection_traits<K, typename K::Point_2, typename K::Point_2> {
[all …]
H A DRandom_convex_set_traits_2.h28 typedef typename Kernel::Point_2 Point_2; typedef
35 const Point_2 &
43 operator()( const Point_2& p) const in operator()
50 : public CGAL::cpp98::binary_function< Point_2, Point_2, Point_2 >
52 Point_2
53 operator()( const Point_2& p, const Point_2& q) const in operator()
58 : public CGAL::cpp98::binary_function< Point_2, FT, Point_2 >
60 Point_2
66 : public CGAL::cpp98::binary_function< Point_2, Point_2, bool >
69 operator()( const Point_2& p, const Point_2& q) const in operator()
[all …]
H A DExtended_cartesian.h92 typedef typename Base::Point_2 Point_2;
128 Point_2 res;
313 int orientation(const Point_2& p1, const Point_2& p2, const Point_2& p3)
322 bool left_turn(const Point_2& p1, const Point_2& p2, const Point_2& p3)
340 int compare_x(const Point_2& p1, const Point_2& p2) const
347 int compare_y(const Point_2& p1, const Point_2& p2) const
363 Point_2 p;
375 const Point_2& p1, const Point_2& p2) const
398 const Point_2& p1, const Point_2& p2, const Point_2& p3) const
407 const Point_2& p1, const Point_2& p2,
[all …]
H A DExtended_homogeneous.h126 typedef typename Base::Point_2 Point_2;
153 Point_2 res;
379 int orientation(const Point_2& p1, const Point_2& p2, const Point_2& p3)
388 bool left_turn(const Point_2& p1, const Point_2& p2, const Point_2& p3)
406 int compare_x(const Point_2& p1, const Point_2& p2) const
428 Point_2 p;
438 const Point_2& p1, const Point_2& p2) const
455 const Point_2& p1, const Point_2& p2, const Point_2& p3) const
470 const Point_2& p1, const Point_2& p2,
471 const Point_2& p3, const Point_2& p4) const
[all …]
/dports/math/cgal/CGAL-5.3/examples/Arrangement_on_surface_2/
H A Dcircular_arcs.cpp23 Kernel::Point_2 c1 = Kernel::Point_2(0, 0); in main()
30 Kernel::Point_2 c2 = Kernel::Point_2(2, 3); in main()
35 Kernel::Point_2 s3 = Kernel::Point_2(-2, -2); in main()
36 Kernel::Point_2 t3 = Kernel::Point_2(2, 2); in main()
44 Point_2 s4 = Point_2(3, 3); in main()
45 Point_2 t4 = Point_2(sqrt_15, sqrt_15); in main()
53 Kernel::Point_2 c5 = Kernel::Point_2(1, 1); in main()
65 Kernel::Point_2 c6 = Kernel::Point_2(0, 0); in main()
77 Kernel::Point_2 s7 = Kernel::Point_2(0, 5); in main()
78 Kernel::Point_2 mid7 = Kernel::Point_2(3, 4); in main()
[all …]
H A Dglobal_insertion.cpp16 typedef Traits_2::Point_2 Point_2; typedef
27 S1[0] = Segment_2 (Point_2 (1, 2.5), Point_2 (4, 5)); in main()
28 S1[1] = Segment_2 (Point_2 (1, 2.5), Point_2 (6, 2.5)); in main()
29 S1[2] = Segment_2 (Point_2 (1, 2.5), Point_2 (4, 0)); in main()
30 S1[3] = Segment_2 (Point_2 (4, 5), Point_2 (6, 2.5)); in main()
31 S1[4] = Segment_2 (Point_2 (4, 0), Point_2 (6, 2.5)); in main()
43 S2[0] = Segment_2 (Point_2 (0, 4), Point_2 (6, 5)); in main()
44 S2[1] = Segment_2 (Point_2 (0, 3), Point_2 (6, 4)); in main()
45 S2[2] = Segment_2 (Point_2 (0, 2), Point_2 (6, 1)); in main()
46 S2[3] = Segment_2 (Point_2 (0, 1), Point_2 (6, 0)); in main()
[all …]
H A Dpolylines.cpp27 typedef Geom_traits_2::Point_2 Point_2; typedef
40 Point_2 points1[5]; in main()
41 points1[0] = Point_2(0, 0); in main()
42 points1[1] = Point_2(2, 4); in main()
43 points1[2] = Point_2(3, 0); in main()
44 points1[3] = Point_2(4, 4); in main()
45 points1[4] = Point_2(6, 0); in main()
48 std::list<Point_2> points2; in main()
62 segs.push_back(Segment_2(Point_2(0, 2), Point_2(1, 2))); in main()
63 segs.push_back(Segment_2(Point_2(1, 2), Point_2(3, 6))); in main()
[all …]
H A Dspherical_insert.cpp14 typedef Geom_traits_2::Point_2 Point_2; typedef
27 arcs.push_back(X_monotone_curve_2(Point_2(1, 0, 0), Point_2(0, 1, 0))); in main()
28 arcs.push_back(X_monotone_curve_2(Point_2(0, 1, 0), Point_2(0, 0, 1))); in main()
29 arcs.push_back(X_monotone_curve_2(Point_2(0, 0, 1), Point_2(1, 0, 0))); in main()
30 arcs.push_back(X_monotone_curve_2(Point_2(0, -1, 0), Point_2(0, 0, -1))); in main()
31 arcs.push_back(X_monotone_curve_2(Point_2(0, -1, 0), Point_2(0, 0, 1))); in main()
32 arcs.push_back(X_monotone_curve_2(Point_2(0, -1, 0), Point_2(1, 0, 0))); in main()
33 arcs.push_back(X_monotone_curve_2(Point_2(0, 1, 0), Point_2(-1, 0, 0))); in main()
34 arcs.push_back(X_monotone_curve_2(Point_2(-1, 0, 0), Point_2(0, -1, 0))); in main()
35 arcs.push_back(X_monotone_curve_2(Point_2(0, 0, -1), Point_2(1, 0, 0))); in main()
[all …]
H A Dgeneric_curve_data.cpp30 typedef Traits_2::Point_2 Point_2; typedef
44 Point_2 points1[5] = {Point_2(0,0), Point_2(2,4), Point_2(3,3), in main()
45 Point_2(4,4), Point_2(6,0)}; in main()
48 Point_2 points2[3] = {Point_2(1,5), Point_2(3,3), Point_2(5,5)}; in main()
51 Point_2 points3[4] = {Point_2(1,0), Point_2(2,2), in main()
52 Point_2(4,2), Point_2(5,0)}; in main()
55 Point_2 points4[2] = {Point_2(0,2), Point_2(6,2)}; in main()
H A Doverlay.cpp13 typedef Traits_2::Point_2 Point_2; typedef
23 Segment_2 s1 (Point_2(2, 2), Point_2(6, 2)); in main()
24 Segment_2 s2 (Point_2(6, 2), Point_2(6, 6)); in main()
25 Segment_2 s3 (Point_2(6, 6), Point_2(2, 6)); in main()
26 Segment_2 s4 (Point_2(2, 6), Point_2(2, 2)); in main()
36 Segment_2 t1 (Point_2(4, 1), Point_2(7, 4)); in main()
37 Segment_2 t2 (Point_2(7, 4), Point_2(4, 7)); in main()
38 Segment_2 t3 (Point_2(4, 7), Point_2(1, 4)); in main()
39 Segment_2 t4 (Point_2(1, 4), Point_2(4, 1)); in main()
H A Dpolycurves_basic.cpp16 typedef Geom_traits_2::Point_2 Point_2; typedef
30 segs1.push_back(X_monotone_subcurve_2(Point_2(0, 0), Point_2(1, 1))); in main()
31 segs1.push_back(X_monotone_subcurve_2(Point_2(1, 1), Point_2(2, 2))); in main()
32 segs1.push_back(X_monotone_subcurve_2(Point_2(2, 2), Point_2(3, 1))); in main()
33 segs1.push_back(X_monotone_subcurve_2(Point_2(3, 1), Point_2(4, 0))); in main()
37 segs2.push_back(X_monotone_subcurve_2(Point_2(0, 0), Point_2(1, 1))); in main()
38 segs2.push_back(X_monotone_subcurve_2(Point_2(1, 1), Point_2(2, 2))); in main()
39 segs2.push_back(X_monotone_subcurve_2(Point_2(2, 2), Point_2(3, 1))); in main()
40 segs2.push_back(X_monotone_subcurve_2(Point_2(3, 1), Point_2(4, 0))); in main()
/dports/math/cgal/CGAL-5.3/include/CGAL/Kernel/
H A Dglobal_functions_2.h98 area(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r) in area()
166 bisector(const Point_2<K> &p, const Point_2<K> &q) in bisector()
238 collinear(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r) in collinear()
376 compare_x(const Point_2<K> &p, const Point_2<K> &q) in compare_x()
480 compare_y(const Point_2<K> &p, const Point_2<K> &q) in compare_y()
654 left_turn(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r) in left_turn()
662 less_x(const Point_2<K> &p, const Point_2<K> &q) in less_x()
670 less_y(const Point_2<K> &p, const Point_2<K> &q) in less_y()
952 orientation(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r) in orientation()
1057 right_turn(const Point_2<K> &p, const Point_2<K> &q, const Point_2<K> &r) in right_turn()
[all …]
H A Dglobal_functions_internal_2.h100 typename K::Point_2
109 typename K::Point_2
118 typename K::Point_2
128 typename K::Point_2
138 typename K::Point_2
149 typename K::Point_2
178 typename K::Point_2
188 typename K::Point_2
199 typename K::Point_2
207 typename K::Point_2
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_2/
H A DConstructions_C2.h50 typedef typename Site_2::Point_2 Point_2; typedef
62 result_type operator()(const Point_2& p0, const Point_2& p1, in operator()
67 result_type operator()(const Point_2& p0, const Point_2& p1, in operator()
86 typedef typename Site_2::Point_2 Point_2; typedef
112 typedef typename K::Point_2 Point_2; typedef
160 typedef typename Gt::Point_2 Point_2; typedef
166 Point_2 midpoint(const Point_2& p, const Point_2& q, Integral_domain_without_division_tag) { in midpoint()
173 Point_2 midpoint(const Point_2& p, const Point_2& q, Field_tag) { in midpoint()
177 static Point_2 midpoint(const Point_2& p, const Point_2& q) { in midpoint()
215 typedef typename Gt::Point_2 Point_2; typedef
[all …]
/dports/math/cgal/CGAL-5.3/examples/Boolean_set_operations_2/
H A Dcircle_segment.cpp13 typedef Kernel::Point_2 Point_2; typedef
47 Polygon_2 construct_polygon (const Point_2& p1, const Point_2& p2, in construct_polygon()
48 const Point_2& p3, const Point_2& p4) in construct_polygon()
73 rect1 = construct_polygon(Point_2(1, 0), Point_2(5, 0), in main()
74 Point_2(5, 2), Point_2(1, 2)); in main()
77 rect2 = construct_polygon(Point_2(1, 4), Point_2(5, 4), in main()
78 Point_2(5, 6), Point_2(1, 6)); in main()
81 rect3 = construct_polygon(Point_2(0, 1), Point_2(2, 1), in main()
82 Point_2(2, 5), Point_2(0, 5)); in main()
85 rect4 = construct_polygon(Point_2(4, 1), Point_2(6, 1), in main()
[all …]
H A Dsymmetric_difference.cpp11 typedef Kernel::Point_2 Point_2; typedef
24 outP.push_back (Point_2 (-3, -5)); outP.push_back (Point_2 (3, -5)); in main()
25 outP.push_back (Point_2 (3, 5)); outP.push_back (Point_2 (-3, 5)); in main()
26 holesP[0].push_back (Point_2 (-1, -3)); in main()
27 holesP[0].push_back (Point_2 (-1, 3)); in main()
28 holesP[0].push_back (Point_2 (1, 3)); in main()
29 holesP[0].push_back (Point_2 (1, -3)); in main()
38 outQ.push_back (Point_2 (-5, -3)); outQ.push_back (Point_2 (5, -3)); in main()
39 outQ.push_back (Point_2 (5, 3)); outQ.push_back (Point_2 (-5, 3)); in main()
41 holesQ[0].push_back (Point_2 (-3, 1)); in main()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_Linf_2/
H A DConstructions_C2.h51 typedef typename Site_2::Point_2 Point_2; typedef
63 result_type operator()(const Point_2& p0, const Point_2& p1, in operator()
68 result_type operator()(const Point_2& p0, const Point_2& p1, in operator()
69 const Point_2& q0, const Point_2& q1, in operator()
74 result_type operator()(const Point_2& p0, const Point_2& p1, in operator()
75 const Point_2& q0, const Point_2& q1, in operator()
87 typedef typename Site_2::Point_2 Point_2; typedef
113 typedef typename K::Point_2 Point_2; typedef
162 typedef typename Gt::Point_2 Point_2; typedef
430 typedef typename Gt::Point_2 Point_2; typedef
[all …]
/dports/math/cgal/CGAL-5.3/demo/Arrangement_on_surface_2/data/algebraic/
H A Dtrifolium.arr14 4 4 1 Point_2( Algebraic_real_xca_2([P[4(0,27)(2,-828)(4,1024)],[-27228038400421048309/147573952589…
16 4 4 1 Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[4(0,P[4(4,1)])(1,P[2(2,3)])(2,P[2(2,…
18 4 4 1 Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[4(0,P[4(4,1)])(1,P[2(2,3)])(2,P[2(2,…
31 …Point_2( Algebraic_real_xca_2([P[4(0,27)(2,-828)(4,1024)],[-27228038400421048309/14757395258967641…
32 …Point_2( Algebraic_real_xca_2([P[4(0,27)(2,-828)(4,1024)],[-27228038400421048309/14757395258967641…
33 …Point_2( Algebraic_real_xca_2([P[4(0,27)(2,-828)(4,1024)],[-27228038400421048309/14757395258967641…
34 …Point_2( Algebraic_real_xca_2([P[4(0,27)(2,-828)(4,1024)],[-27228038400421048309/14757395258967641…
35 …2(Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[4(0,P[4(4,1)])(1,P[2(2,3)])(2,P[2(2,2)]…
36 …2(Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[4(0,P[4(4,1)])(1,P[2(2,3)])(2,P[2(2,2)]…
37 …2(Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[4(0,P[4(4,1)])(1,P[2(2,3)])(2,P[2(2,2)]…
[all …]
H A Derdos_lemiscate.arr13 4 4 1 Point_2( Algebraic_real_xca_2([P[8(0,-2)(8,1)],[-15784021086844858534866679767252604979987646…
25 4 4 1 Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[16(0,P[16(8,-2)(16,1)])(2,P[14(6,56)…
26 4 4 1 Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[16(0,P[16(8,-2)(16,1)])(2,P[14(6,56)…
28 4 4 1 Point_2( Algebraic_real_xca_2([P[1(1,1)],[0/1 , 0/1 ]],P[16(0,P[16(8,-2)(16,1)])(2,P[14(6,56)…
41 4 4 1 Point_2( Algebraic_real_xca_2([P[8(0,-2)(8,1)],[126272168694758868278933438138020839839901170…
56 …Point_2( Algebraic_real_xca_2([P[32(0,1)(8,-3482624)(16,-875495424)(24,4143972352)(32,4294967296)]…
57 …Point_2( Algebraic_real_xca_2([P[32(0,1)(8,-3482624)(16,-875495424)(24,4143972352)(32,4294967296)]…
58 …Point_2( Algebraic_real_xca_2([P[32(0,1)(8,-3482624)(16,-875495424)(24,4143972352)(32,4294967296)]…
59 …Point_2( Algebraic_real_xca_2([P[32(0,1)(8,-3482624)(16,-875495424)(24,4143972352)(32,4294967296)]…
60 …Point_2( Algebraic_real_xca_2([P[32(0,1)(8,-3482624)(16,-875495424)(24,4143972352)(32,4294967296)]…
[all …]
/dports/math/cgal/CGAL-5.3/demo/Arrangement_on_surface_2/
H A DGraphicsViewCurveInputTyped.h44 using Point_2 = CGAL::Qt::CurveInputMethod::Point_2; variable
54 generateRay(const std::vector<Point_2>&) { return {}; } in generateRay() argument
86 using Point_2 = typename Super::Point_2;
99 using Point_2 = typename Super::Point_2;
115 using Rat_point_2 = typename RatKernel::Point_2;
119 using Point_2 = typename Super::Point_2;
137 using KernelPoint = typename Kernel::Point_2;
144 using Point_2 = typename Super::Point_2;
166 using Point_2 = typename Super::Point_2;
188 using Point_2 = typename Super::Point_2;
[all …]
/dports/math/cgal/CGAL-5.3/examples/Partition_2/
H A Doptimal_convex_partition_2.cpp11 typedef Traits::Point_2 Point_2; typedef
16 polygon.push_back(Point_2(391, 374)); in make_polygon()
17 polygon.push_back(Point_2(240, 431)); in make_polygon()
18 polygon.push_back(Point_2(252, 340)); in make_polygon()
19 polygon.push_back(Point_2(374, 320)); in make_polygon()
20 polygon.push_back(Point_2(289, 214)); in make_polygon()
21 polygon.push_back(Point_2(134, 390)); in make_polygon()
22 polygon.push_back(Point_2( 68, 186)); in make_polygon()
23 polygon.push_back(Point_2(154, 259)); in make_polygon()
24 polygon.push_back(Point_2(161, 107)); in make_polygon()
[all …]

12345678910>>...45