Home
last modified time | relevance | path

Searched refs:same_segments (Results 1 – 22 of 22) sorted by relevance

/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_Linf_2/
H A DOrientation_Linf_C2.h62 Are_same_segments_2 same_segments; variable
69 same_segments(p.supporting_site(0), q.supporting_site(0)) || in have_common_support()
70 same_segments(p.supporting_site(0), q.supporting_site(1)) || in have_common_support()
71 same_segments(p.supporting_site(1), q.supporting_site(0)) || in have_common_support()
72 same_segments(p.supporting_site(1), q.supporting_site(1)); in have_common_support()
80 if ( same_segments(p.supporting_site(0), in have_common_support()
82 same_segments(p.supporting_site(0), in have_common_support()
86 } else if ( same_segments(p.supporting_site(1), in have_common_support()
88 same_segments(p.supporting_site(1), in have_common_support()
H A DOriented_side_C2.h54 Are_same_segments_2 same_segments; variable
223 (is_s1_segment && (same_segments(s, s1) || in operator()
224 same_segments(s, s1.supporting_site()))) in operator()
226 (is_s2_segment && (same_segments(s, s2) || in operator()
227 same_segments(s, s2.supporting_site())))); in operator()
341 (is_s1_segment && (same_segments(s, s1) || in operator()
342 same_segments(s, s1.supporting_site()))) in operator()
344 (is_s2_segment && (same_segments(s, s2) || in operator()
345 same_segments(s, s2.supporting_site())))); in operator()
H A DSegment_Delaunay_graph_Linf_hierarchy_2_impl.h202 CGAL_assertion( (same_segments(vs1_prev->site(), vs1->site()) && in insert_point()
203 same_segments(vs2_prev->site(), vs2->site())) || in insert_point()
204 (same_segments(vs1_prev->site(), vs2->site()) && in insert_point()
206 if ( same_segments(vs1_prev->site(), vs1->site()) ) { in insert_point()
651 if ( same_segments(t, sitev) ) { in insert_intersecting_segment_with_tag()
700 if ( same_segments(t, sitev) ) { in insert_intersecting_segment_with_tag()
729 CGAL_assertion( (same_segments(v1->site(), v1_old->site()) && in insert_intersecting_segment_with_tag()
730 same_segments(v2->site(), v2_old->site())) || in insert_intersecting_segment_with_tag()
731 (same_segments(v1->site(), v2_old->site()) && in insert_intersecting_segment_with_tag()
732 same_segments(v2->site(), v1_old->site())) in insert_intersecting_segment_with_tag()
[all …]
H A DVertex_conflict_C2.h88 Are_same_segments_2 same_segments; variable
95 if ( same_segments(s1.supporting_site(0), in is_on_common_support()
97 same_segments(s1.supporting_site(0), in is_on_common_support()
104 } else if ( same_segments(s1.supporting_site(1), in is_on_common_support()
106 same_segments(s1.supporting_site(1), in is_on_common_support()
122 same_segments(p.supporting_site(0), q.supporting_site(0)) || in have_common_support()
123 same_segments(p.supporting_site(0), q.supporting_site(1)) || in have_common_support()
124 same_segments(p.supporting_site(1), q.supporting_site(1)) || in have_common_support()
125 same_segments(p.supporting_site(1), q.supporting_site(0)); in have_common_support()
135 return ( same_segments(s.supporting_site(0), t) || in have_common_support()
[all …]
H A DOriented_side_of_bisector_C2.h50 Are_same_segments_2 same_segments; variable
192 if ( same_segments(s1, s2) ) { in compare_distances_ss()
H A DInfinite_edge_interior_conflict_C2.h60 Are_same_segments_2 same_segments; variable
480 if ( s.is_segment() && r.is_segment() && same_segments(s, r) ) { in operator()
H A DFinite_edge_interior_conflict_C2.h94 Are_same_segments_2 same_segments; variable
326 ( same_segments(t1.supporting_site(0), in is_interior_in_conflict_both_ps_s()
328 same_segments(t1.supporting_site(1), in is_interior_in_conflict_both_ps_s()
458 if (same_segments(r, s)) { in is_interior_in_conflict_touch()
H A DVoronoi_vertex_ring_C2.h123 Are_same_segments_2 same_segments; variable
2601 same_segments(p_.supporting_site(), in incircle_s()
2606 same_segments(q_.supporting_site(), in incircle_s()
2611 same_segments(r_.supporting_site(), in incircle_s()
3095 CGAL_assertion( ! same_segments(p, t) ); in compute_helper()
3114 CGAL_assertion( ! same_segments(q, t) ); in compute_helper()
3129 CGAL_assertion( ! same_segments(r, t) ); in compute_helper()
3330 same_segments(p_.supporting_site(), in incircle_s()
3336 same_segments(q_.supporting_site(), in incircle_s()
3342 same_segments(r_.supporting_site(), in incircle_s()
H A DBasic_predicates_C2.h1406 Are_same_segments_2 same_segments; in is_on_positive_halfspace() local
1408 if ( same_segments(supp.supporting_site(), in is_on_positive_halfspace()
1426 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
1432 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
H A DVoronoi_vertex_sqrt_field_new_C2.h129 Are_same_segments_2 same_segments; variable
3781 CGAL_assertion( ! same_segments(p, t) ); in compute_helper()
3798 CGAL_assertion( ! same_segments(q, t) ); in compute_helper()
3815 CGAL_assertion( ! same_segments(r, t) ); in compute_helper()
4176 if ( same_segments(q.supporting_site(), t.supporting_site()) ) { in incircle_s()
4180 if ( same_segments(r.supporting_site(), t.supporting_site()) ) { in incircle_s()
4232 if ( same_segments(q.supporting_site(), t.supporting_site()) ) { in incircle_s()
4247 if ( same_segments(r.supporting_site(), t.supporting_site()) ) { in incircle_s()
/dports/math/cgal/CGAL-5.3/include/CGAL/Segment_Delaunay_graph_2/
H A DOrientation_C2.h61 Are_same_segments_2 same_segments; variable
68 same_segments(p.supporting_site(0), q.supporting_site(0)) || in have_common_support()
69 same_segments(p.supporting_site(0), q.supporting_site(1)) || in have_common_support()
70 same_segments(p.supporting_site(1), q.supporting_site(0)) || in have_common_support()
71 same_segments(p.supporting_site(1), q.supporting_site(1)); in have_common_support()
79 if ( same_segments(p.supporting_site(0), in have_common_support()
81 same_segments(p.supporting_site(0), in have_common_support()
85 } else if ( same_segments(p.supporting_site(1), in have_common_support()
87 same_segments(p.supporting_site(1), in have_common_support()
H A DVertex_conflict_C2.h58 Are_same_segments_2 same_segments; variable
65 if ( same_segments(s1.supporting_site(0), in is_on_common_support()
67 same_segments(s1.supporting_site(0), in is_on_common_support()
74 } else if ( same_segments(s1.supporting_site(1), in is_on_common_support()
76 same_segments(s1.supporting_site(1), in is_on_common_support()
92 same_segments(p.supporting_site(0), q.supporting_site(0)) || in have_common_support()
93 same_segments(p.supporting_site(0), q.supporting_site(1)) || in have_common_support()
94 same_segments(p.supporting_site(1), q.supporting_site(1)) || in have_common_support()
95 same_segments(p.supporting_site(1), q.supporting_site(0)); in have_common_support()
105 return ( same_segments(s.supporting_site(0), t) || in have_common_support()
[all …]
H A DInfinite_edge_interior_conflict_C2.h45 Are_same_segments_2 same_segments; variable
76 if ( s.is_segment() && r.is_segment() && same_segments(s, r) ) { in operator()
H A DSegment_Delaunay_graph_hierarchy_2_impl.h199 CGAL_assertion( (same_segments(vs1_prev->site(), vs1->site()) && in insert_point()
200 same_segments(vs2_prev->site(), vs2->site())) || in insert_point()
201 (same_segments(vs1_prev->site(), vs2->site()) && in insert_point()
203 if ( same_segments(vs1_prev->site(), vs1->site()) ) { in insert_point()
608 if ( same_segments(t, sitev) ) { in insert_intersecting_segment_with_tag()
657 if ( same_segments(t, sitev) ) { in insert_intersecting_segment_with_tag()
686 CGAL_assertion( (same_segments(v1->site(), v1_old->site()) && in insert_intersecting_segment_with_tag()
687 same_segments(v2->site(), v2_old->site())) || in insert_intersecting_segment_with_tag()
688 (same_segments(v1->site(), v2_old->site()) && in insert_intersecting_segment_with_tag()
689 same_segments(v2->site(), v1_old->site())) in insert_intersecting_segment_with_tag()
[all …]
H A DVoronoi_vertex_sqrt_field_C2.h68 Are_same_segments_2 same_segments; variable
368 if ( same_segments(supp.supporting_site(), in is_on_positive_halfspace()
386 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
392 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
944 same_segments(p_.supporting_site(), in incircle_s()
949 same_segments(q_.supporting_site(), in incircle_s()
954 same_segments(r_.supporting_site(), in incircle_s()
1028 same_segments(p_.supporting_site(), in incircle_s()
1034 same_segments(q_.supporting_site(), in incircle_s()
1040 same_segments(r_.supporting_site(), in incircle_s()
H A DVoronoi_vertex_ring_C2.h76 Are_same_segments_2 same_segments; variable
401 if ( same_segments(supp.supporting_site(), in is_on_positive_halfspace()
419 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
425 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
1114 same_segments(p_.supporting_site(), in incircle_s()
1119 same_segments(q_.supporting_site(), in incircle_s()
1124 same_segments(r_.supporting_site(), in incircle_s()
1194 same_segments(p_.supporting_site(), in incircle_s()
1200 same_segments(q_.supporting_site(), in incircle_s()
1206 same_segments(r_.supporting_site(), in incircle_s()
H A DVoronoi_vertex_sqrt_field_new_C2.h76 Are_same_segments_2 same_segments; variable
445 if ( same_segments(supp.supporting_site(), in is_on_positive_halfspace()
463 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
469 same_segments(supp.supporting_site(), in is_on_positive_halfspace()
1066 if ( same_segments(q.supporting_site(), t.supporting_site()) ) { in incircle_s()
1070 if ( same_segments(r.supporting_site(), t.supporting_site()) ) { in incircle_s()
1108 if ( same_segments(q.supporting_site(), t.supporting_site()) ) { in incircle_s()
1112 if ( same_segments(r.supporting_site(), t.supporting_site()) ) { in incircle_s()
H A DOriented_side_of_bisector_C2.h51 Are_same_segments_2 same_segments; variable
177 if ( same_segments(s1, s2) ) { in compare_distances_ss()
H A DFinite_edge_interior_conflict_C2.h78 Are_same_segments_2 same_segments; variable
296 ( same_segments(t1.supporting_site(0), in is_interior_in_conflict_both_ps_s()
298 same_segments(t1.supporting_site(1), in is_interior_in_conflict_both_ps_s()
H A DSegment_Delaunay_graph_2_impl.h912 if ( same_segments(t, sitev) ) { in insert_intersecting_segment_with_tag()
2000 if ( small_d.same_segments(t, vvc) ) { in compute_vertex_map()
2005 CGAL_assertion( small_d.same_segments(t, vh_small) ); in compute_vertex_map()
2017 if ( small_d.same_segments(t, vvc) ) { in compute_vertex_map()
2022 CGAL_assertion( small_d.same_segments(t, vh_small) ); in compute_vertex_map()
2895 CGAL_assertion( same_segments(ss_this.site(), ss_other.site()) ); in copy()
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A DSegment_Delaunay_graph_2.h895 same_segments(v->site(), ss.site())) ||
1571 bool same_segments(const Storage_site_2& t, Vertex_handle v) const {
1574 return same_segments(t.site(), v->site());
1771 bool same_segments(const Site_2& t, Vertex_handle v) const {
1774 return same_segments(t, v->site());
1778 bool same_segments(const Site_2& p, const Site_2& q) const {
H A DSegment_Delaunay_graph_hierarchy_2.h108 using Base::same_segments;