| /dports/math/cgal/CGAL-5.3/include/CGAL/boost/graph/ |
| H A D | selection.h | 1082 while(is_border(next_around_vertex,tm) || get(is_selected, face(next_around_vertex, tm) ) ) in expand_face_selection_for_removal()
1084 hd = next_around_vertex; in expand_face_selection_for_removal()
1085 next_around_vertex = opposite( next(hd, tm), tm); in expand_face_selection_for_removal()
1097 faces_traversed.push_back(next_around_vertex); in expand_face_selection_for_removal()
1098 next_around_vertex = opposite( next(next_around_vertex, tm), tm); in expand_face_selection_for_removal()
1099 if (is_border(next_around_vertex,tm)) in expand_face_selection_for_removal()
1101 next_around_vertex = opposite( next(next_around_vertex, tm), tm); in expand_face_selection_for_removal()
1116 if (next_around_vertex==start) in expand_face_selection_for_removal()
1118 next_around_vertex = opposite( next(next_around_vertex, tm), tm); in expand_face_selection_for_removal()
1120 while(is_border(next_around_vertex,tm) || get(is_selected, face(next_around_vertex, tm) ) ); in expand_face_selection_for_removal()
[all …]
|
| H A D | copy_face_graph.h | 172 tm_halfedge_descriptor next_around_vertex=h; in copy_face_graph_impl() local
174 next_around_vertex=opposite(next(next_around_vertex, tm), tm); in copy_face_graph_impl()
175 set_target(next_around_vertex, v, tm); in copy_face_graph_impl()
176 }while(h != next_around_vertex); in copy_face_graph_impl()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/exploragram/hexdom/ |
| H A D | extra_connectivity.h | 59 index_t next_around_vertex(index_t cir);
84 index_t next_around_vertex(index_t cir);
|
| H A D | hex_cruncher.cpp | 98 nico_assert(valid(next_around_vertex(h))); in check_integrity()
99 nico_assert(valid(next_around_vertex(next_around_vertex(h)))); in check_integrity()
121 index_t next_around_vertex(index_t e) { nico_assert(valid(e)); return opp(next(e, fsize(e)-1)); } in next_around_vertex() function
132 cir = next_around_vertex(cir); in has_valid_one_ring()
142 cir = next_around_vertex(cir); in valence()
554 cir = qem.next_around_vertex(cir); in init_one_ring()
563 h = qem.next_around_vertex(h); in init_one_ring()
567 if (qem.next_around_vertex(H[2][0]) != H[0][0]) return false; in init_one_ring()
697 …if (qem.next_around_vertex(seed) < seed || qem.next_around_vertex(qem.next_around_vertex(seed)) < … in apply()
|
| H A D | extra_connectivity.cpp | 86 … index_t FacetsExtraConnectivity::next_around_vertex(index_t cir) { return opposite(prev(cir)); } in next_around_vertex() function in GEO::FacetsExtraConnectivity
210 cir = fec.next_around_vertex(cir); in halfedge_manip_example()
|
| H A D | mesh_inspector.cpp | 176 cir = fec.next_around_vertex(cir);// fec.c2c[cir]; in surface_is_manifold()
|
| H A D | quad_dominant.cpp | 592 cir = fec.next_around_vertex(cir); in mark_charts()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/delaunay/ |
| H A D | delaunay.cpp | 312 t = index_t(next_around_vertex(t, index(t, signed_index_t(v)))); in get_neighbors_internal()
390 index_t t2 = index_t(next_around_vertex(t1, lv1)); in update_cicl()
405 index_t t2 = index_t(next_around_vertex(t1, lv1)); in update_cicl()
|
| H A D | delaunay.h | 471 signed_index_t next_around_vertex(index_t c, index_t lv) const { in next_around_vertex() function
|
| H A D | periodic_delaunay_3d.cpp | 3499 index_t t2 = index_t(next_around_vertex(t1, lv1)); in update_cicl()
3517 index_t t2 = index_t(next_around_vertex(t1, lv1)); in update_cicl()
3636 t = GEO::index_t(next_around_vertex(t,f)); in copy_Laguerre_cell_from_Delaunay()
|
| H A D | periodic_delaunay_3d.cpp.000 | 3500 index_t t2 = index_t(next_around_vertex(t1, lv1));
3518 index_t t2 = index_t(next_around_vertex(t1, lv1));
3637 t = GEO::index_t(next_around_vertex(t,f));
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/Revoropt/include/Revoropt/Mesh/ |
| H A D | connectivity_fwd.hpp | 382 unsigned int next_around_vertex( unsigned int vertex, unsigned int edge ) { in next_around_vertex() function in Revoropt::EdgeLayer
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/internal/Corefinement/ |
| H A D | face_graph_utils.h | 1217 halfedge_descriptor next_around_vertex=h_out;
1219 CGAL_assertion(next(next_around_vertex, output) != GT::null_halfedge());
1220 next_around_vertex=opposite(next(next_around_vertex, output), output);
1221 set_target(next_around_vertex, v, output);
1222 }while(h_out != next_around_vertex);
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/voronoi/ |
| H A D | generic_RVD.h | 2463 t = index_t(delaunay_->next_around_vertex(t, lv)); in get_neighbors()
|