Lines Matching refs:tm1
175 TriangleMesh &tm1, &tm2; variable
215 Mesh_to_intersection_edges(TriangleMesh& tm1, TriangleMesh) : m_tm(tm1) {} in Mesh_to_intersection_edges() argument
262 const std::vector<halfedge_descriptor>& tm1; member
272 ) : tm1( tm1_polylines ) in Intersection_polylines()
275 , to_skip(tm1.size(),false) in Intersection_polylines()
276 , to_skip_in_tm1(tm1.size(),false) in Intersection_polylines()
277 , to_skip_in_tm2(tm1.size(),false) in Intersection_polylines()
294 const TM& tm1, in fill_polylines_to_skip() argument
297 for (std::size_t i=0;i<polylines.tm1.size();++i) in fill_polylines_to_skip()
299 halfedge_descriptor h1 = polylines.tm1[i]; in fill_polylines_to_skip()
302 if (!is_border(h1,tm1)){ in fill_polylines_to_skip()
303 std::size_t patch_id = tm1_patch_ids[get(fids1, face(h1,tm1))]; in fill_polylines_to_skip()
307 if (skip_polyline_in_tm1 && !is_border(opposite(h1,tm1),tm1)){ in fill_polylines_to_skip()
308 std::size_t patch_id = tm1_patch_ids[get(fids1, face(opposite(h1,tm1),tm1))]; in fill_polylines_to_skip()
410 Face_graph_output_builder(TriangleMesh& tm1, in Face_graph_output_builder() argument
421 : tm1(tm1), tm2(tm2) in Face_graph_output_builder()
429 , is_tm1_closed( is_closed(tm1)) in Face_graph_output_builder()
431 …, is_tm1_inside_out( is_tm1_closed && !PMP::is_outward_oriented(tm1, parameters::vertex_point_map(… in Face_graph_output_builder()
434 , mesh_to_intersection_edges(tm1, tm2) in Face_graph_output_builder()
506 if (&tm == &tm1) in set_vertex_id()
532 Intersection_edge_map& intersection_edges1 = mesh_to_intersection_edges[&tm1]; in operator()
537 !BGL::internal::is_index_map_valid(fids1, num_faces(tm1), faces(tm1)) ) in operator()
539 BGL::internal::initialize_face_index_map(fids1, tm1); in operator()
541 CGAL_assertion(BGL::internal::is_index_map_valid(fids1, num_faces(tm1), faces(tm1))); in operator()
572 halfedge_descriptor h1 = epp_it->second.first[&tm1]; in operator()
574 halfedge_descriptor h1_opp = opposite(h1, tm1); in operator()
580 vertex_descriptor p1 = target(next(h1_opp, tm1), tm1); in operator()
581 vertex_descriptor p2 = target(next(h1, tm1), tm1); in operator()
592 if (!is_border(h1_opp, tm1) && index_p1!=NID) in operator()
600 tm1_coplanar_faces.push_back(face(h1_opp, tm1)); in operator()
610 tm1_coplanar_faces.push_back(face(h1_opp, tm1)); in operator()
618 if (!is_border(h1, tm1) && index_p2!=NID) in operator()
625 tm1_coplanar_faces.push_back(face(h1, tm1)); in operator()
634 tm1_coplanar_faces.push_back(face(h1, tm1)); in operator()
645 inter_edges_to_remove1.insert(edge(h1,tm1)); in operator()
652 if ( !is_border(h1, tm1) ) in operator()
654 h1 = opposite(h1, tm1); in operator()
657 if ( is_border(h1, tm1) ) in operator()
659 if ( opposite(next(h1, tm1), tm1) == prev(opposite(h1, tm1), tm1) ) in operator()
661 inter_edges_to_remove1.insert(edge(next(h1, tm1),tm1)); in operator()
664 if ( opposite(prev(h1, tm1), tm1) == next(opposite(h1, tm1), tm1) ) in operator()
666 inter_edges_to_remove1.insert(edge(prev(h1, tm1), tm1)); in operator()
673 h1 = opposite(h1, tm1); in operator()
680 inter_edges_to_remove1.insert(edge(next(h1, tm1),tm1)); in operator()
685 inter_edges_to_remove1.insert(edge(prev(h1, tm1), tm1)); in operator()
707 std::vector<std::size_t> tm1_patch_ids( num_faces(tm1),NID ); in operator()
708 Border_edge_map<TriangleMesh> is_marked_1(intersection_edges1, tm1); in operator()
710 PMP::connected_components(tm1, in operator()
773 halfedge_descriptor h1 = it->second.first[&tm1]; in operator()
777 …out << "Looking at triangles around edge " << tm1.point(source(h1, tm1)) << " " << tm1.point(targe… in operator()
780 CGAL_assertion(ids.first==vertex_to_node_id1[source(h1,tm1)]); in operator()
781 CGAL_assertion(ids.second==vertex_to_node_id1[target(h1,tm1)]); in operator()
789 if ( is_border_edge(h1, tm1) ){ in operator()
792 if ( is_border(h1,tm1) != is_border(h2,tm2) ) in operator()
796 get(fids1, is_border(h1,tm1) ? face(opposite(h1,tm1),tm1) in operator()
797 : face(h1,tm1)); in operator()
814 if( is_border(h1, tm1) ) in operator()
816 h1 = opposite(h1, tm1); in operator()
821 std::size_t fid1 = get(fids1, face(h1,tm1)); in operator()
837 vertex_descriptor p = target(next(h1,tm1),tm1); in operator()
880 halfedge_descriptor h = is_border(h1, tm1) ? opposite(h1, tm1) : h1; in operator()
881 vertex_descriptor p = target(next(h,tm1),tm1); in operator()
898 std::size_t patch_id_p=tm1_patch_ids[ get(fids1, face(h,tm1)) ]; in operator()
960 vertex_descriptor p1=target(next(opposite(h1,tm1),tm1),tm1); in operator()
961 vertex_descriptor p2=target(next(h1,tm1),tm1); in operator()
974 std::size_t patch_id_p1=tm1_patch_ids[ get(fids1, face(opposite(h1,tm1),tm1)) ]; in operator()
975 std::size_t patch_id_p2=tm1_patch_ids[ get(fids1, face(h1,tm1)) ]; in operator()
1017 vertex_descriptor p1=target(next(opposite(h1,tm1),tm1),tm1); in operator()
1018 vertex_descriptor p2=target(next(h1,tm1),tm1); in operator()
1036 std::size_t patch_id_p1=tm1_patch_ids[ get(fids1, face(opposite(h1,tm1),tm1)) ]; in operator()
1037 std::size_t patch_id_p2=tm1_patch_ids[ get(fids1, face(h1,tm1)) ]; in operator()
1259 if ( is_dangling_edge(ids.first, ids.second, h1, tm1, is_node_of_degree_one) || in operator()
1284 if ( is_dangling_edge(ids.first, ids.second, h1, tm1, is_node_of_degree_one) || in operator()
1345 tm1); in operator()
1386 for(face_descriptor f : faces(tm1)) in operator()
1393 halfedge_descriptor h = halfedge(f, tm1); in operator()
1394 Node_id index_p1 = get_node_id(target(h, tm1), vertex_to_node_id1); in operator()
1398 h=next(h, tm1); in operator()
1399 index_p1 = get_node_id(target(h, tm1), vertex_to_node_id1); in operator()
1403 h=next(h, tm1); in operator()
1404 index_p1 = get_node_id(target(h, tm1), vertex_to_node_id1); in operator()
1432 Bounded_side position = inside_tm2( nodes.to_exact(get(vpm1, target(h, tm1)))); in operator()
1458 VPM_helper::build_tree(tm1, tree, vertex_to_node_id1, fids1, vpm1, nodes); in operator()
1564 halfedge_descriptor h1 = it->second.first.find(&tm1)->second; in operator()
1568 h1=opposite(h1,tm1); in operator()
1590 for (vertex_descriptor vd : vertices(tm1)) in operator()
1592 boost::optional<halfedge_descriptor> op_h = is_border(vd, tm1); in operator()
1595 CGAL_assertion( target(h, tm1) == vd); in operator()
1597 halfedge_descriptor nh = prev( opposite(h, tm1), tm1 ); in operator()
1598 while (!is_border( opposite(nh, tm1), tm1 ) ) in operator()
1600 nh = prev( opposite(nh, tm1), tm1 ); in operator()
1602 nh = opposite(nh, tm1); in operator()
1603 if (next(h, tm1) != nh) in operator()
1604 border_nm_vertices.insert(target(h, tm1)); in operator()
1610 Patches1 patches_of_tm1(tm1, tm1_patch_ids, fids1, intersection_edges1, nb_patches_tm1); in operator()
1722 if (requested_output[operation]==&tm1) in operator()
1735 CGAL_assertion(&tm1!=&output && &tm2!=&output); in operator()
1745 fids1, fids2, tm1, tm2 in operator()
1777 mesh_to_intersection_edges[&tm1], in operator()
1780 CGAL_assertion( *requested_output[inplace_operation_tm1] == &tm1 ); in operator()
1791 Patches1 tmp_patches_of_tm1(tm1, in operator()
1817 fids1, fids2, tm1, tm2); in operator()
1822 fids1, fids2, tm1, tm2); in operator()
1834 tm1, \ in operator()
1854 compute_inplace_operation( tm2, tm1, \ in operator()
1876 remove_disconnected_patches(tm1, in operator()
1884 tm1, marks_on_input_edges.ecm1, \ in operator()
1891 remove_unused_polylines(tm1, in operator()
1896 CGAL::Polygon_mesh_processing::reverse_face_orientations(*&tm1); in operator()
1900 CGAL_assertion( *requested_output[inplace_operation_tm1] == &tm1 ); in operator()
1907 fids1, fids2, tm1, tm2); in operator()
1929 if ( is_border(opposite(*it, tm1), tm1) ) in operator()
1946 border_vertices.insert( target(h,tm1) ); in operator()
1947 border_vertices.insert( source(h,tm1) ); in operator()
1952 if ( !border_vertices.count( target(h,tm1) ) ) in operator()
1953 patches_of_tm1[i].interior_vertices.insert( target(h,tm1) ); in operator()
1954 if ( !border_vertices.count( source(h,tm1) ) ) in operator()
1955 patches_of_tm1[i].interior_vertices.insert( source(h,tm1) ); in operator()
1966 for(halfedge_descriptor h : halfedges_around_target(vd, tm1)) in operator()
1968 face_descriptor f = face(h, tm1); in operator()
1991 boost::tie(hit,end) = halfedges_around_target(vd, tm1); in operator()
1996 if ( !is_border(*hit, tm1) || in operator()
1997 … patches_to_remove.test( tm1_patch_ids[ get(fids1, face(opposite(*hit, tm1), tm1)) ] ) ) in operator()
2002 halfedge_descriptor nh = next(*hit, tm1); in operator()
2003 … if ( !patches_to_remove.test( tm1_patch_ids[ get(fids1, face(opposite(nh, tm1), tm1)) ] ) ) in operator()
2011 if ( is_border(*hit, tm1) ) in operator()
2013 … if ( patches_to_remove.test( tm1_patch_ids[ get(fids1, face(opposite(*hit, tm1), tm1)) ] ) ) in operator()
2016 nh = next(*hit, tm1); in operator()
2017 … if ( !patches_to_remove.test( tm1_patch_ids[ get(fids1, face(opposite(nh, tm1), tm1)) ] ) ) in operator()
2036 set_next(p.first, p.second, tm1); in operator()
2043 tm1, tm2, \ in operator()
2061 remove_unused_polylines(tm1, in operator()
2082 fids2, fids1, tm2, tm1 in operator()
2085 compute_inplace_operation( tm2, tm1, \ in operator()