def getVTX(self): self.idx1, self.idx2 = self.selected_edges self.edge1 = cm.coords_tuple_from_edge_idx(self.bm, self.idx1) self.edge2 = cm.coords_tuple_from_edge_idx(self.bm, self.idx2) self.point = cm.get_intersection(self.edge1, self.edge2) self.edges = cm.find_intersecting_edges( self.bm, self.point, self.idx1, self.idx2)
def add_or_remove_new_edge(self, idx): ''' - only add idx if not edge_prime - and not currently present in selected_edges ''' p_idx = self.edge_prime_idx if idx == p_idx: print(idx, 'is edge prime, not adding') return if (idx in self.selected_edges): self.selected_edges.remove(idx) del self.xvectors[idx] else: edge_prime = cm.coords_tuple_from_edge_idx(self.bm, p_idx) edge2 = cm.coords_tuple_from_edge_idx(self.bm, idx) p = cm.get_intersection(edge_prime, edge2) if not cm.point_on_edge(p, edge_prime): return vert_idx_closest = cm.closest_idx(p, self.bm.edges[idx]) self.xvectors[idx] = [p, vert_idx_closest] self.selected_edges.append(idx)
def add_line_to_bisection(self): obj = bpy.context.object me = obj.data bm = bmesh.from_edit_mesh(me) if hasattr(bm.verts, "ensure_lookup_table"): bm.verts.ensure_lookup_table() bm.edges.ensure_lookup_table() edges = [e for e in bm.edges if (e.select and not e.hide)] if not len(edges) == 2: msg = "select two coplanar non parallel edges" self.report({"WARNING"}, msg) return [[v1, v2], [v3, v4]] = [[v.co for v in e.verts] for e in edges] print('vectors found:\n', v1, '\n', v2, '\n', v3, '\n', v4) dist1 = (v1-v2).length dist2 = (v3-v4).length bdist = min([dist1, dist2]) edge1 = (v1, v2) edge2 = (v3, v4) if not cm.test_coplanar(edge1, edge2): msg = "edges must be coplanar non parallel edges" self.report({"WARNING"}, msg) return # get pt and pick fartest vertex from (projected) intersections pt = cm.get_intersection(edge1, edge2) far1 = v2 if (v1-pt).length < (v2-pt).length else v1 far2 = v4 if (v3-pt).length < (v4-pt).length else v3 # print('intersection: ', pt) dex1 = far1 - pt dex2 = far2 - pt dex1 = dex1 * (bdist / dex1.length) dex2 = dex2 * (bdist / dex2.length) pt2 = pt + (dex1).lerp(dex2, 0.5) # print('bisector point:', pt2) pt3 = pt2.lerp(pt, 2.0) vec1 = bm.verts.new(pt2) vec2 = bm.verts.new(pt) vec3 = bm.verts.new(pt3) bm.edges.new((vec1, vec2)) bm.edges.new((vec2, vec3)) bmesh.update_edit_mesh(me)
def add_line_to_bisection(self): obj = bpy.context.object me = obj.data bm = bmesh.from_edit_mesh(me) if hasattr(bm.verts, "ensure_lookup_table"): bm.verts.ensure_lookup_table() bm.edges.ensure_lookup_table() edges = [e for e in bm.edges if (e.select and not e.hide)] if not len(edges) == 2: msg = "select two coplanar non parallel edges" self.report({"WARNING"}, msg) return [[v1, v2], [v3, v4]] = [[v.co for v in e.verts] for e in edges] print('vectors found:\n', v1, '\n', v2, '\n', v3, '\n', v4) dist1 = (v1 - v2).length dist2 = (v3 - v4).length bdist = min([dist1, dist2]) edge1 = (v1, v2) edge2 = (v3, v4) if not cm.test_coplanar(edge1, edge2): msg = "edges must be coplanar non parallel edges" self.report({"WARNING"}, msg) return # get pt and pick fartest vertex from (projected) intersections pt = cm.get_intersection(edge1, edge2) far1 = v2 if (v1 - pt).length < (v2 - pt).length else v1 far2 = v4 if (v3 - pt).length < (v4 - pt).length else v3 # print('intersection: ', pt) dex1 = far1 - pt dex2 = far2 - pt dex1 = dex1 * (bdist / dex1.length) dex2 = dex2 * (bdist / dex2.length) pt2 = pt + (dex1).lerp(dex2, 0.5) # print('bisector point:', pt2) pt3 = pt2.lerp(pt, 2.0) vec1 = bm.verts.new(pt2) vec2 = bm.verts.new(pt) vec3 = bm.verts.new(pt3) bm.edges.new((vec1, vec2)) bm.edges.new((vec2, vec3)) bmesh.update_edit_mesh(me)