bmesh api: add 'is_boundary' attribute to verts.

2 files changed, 20 insertions, 0 deletions

diff --git a/source/blender/bmesh/intern/bmesh_queries.c b/source/blender/bmesh/intern/bmesh_queries.c
index 8a1d513a8fc..aefea576563 100644
--- a/source/blender/bmesh/intern/bmesh_queries.c
+++ b/source/blender/bmesh/intern/bmesh_queries.c
@@ -821,6 +821,25 @@ int BM_edge_is_boundary(BMEdge *e)
 }
 #endif
 
+bool BM_vert_is_boundary(BMVert *v)
+{
+	if (v->e) {
+		BMEdge *e_first, *e_iter;
+
+		e_first = e_iter = v->e;
+		do {
+			if (BM_edge_is_boundary(e_iter)) {
+				return true;
+			}
+		} while ((e_iter = bmesh_disk_edge_next(e_iter, v)) != e_first);
+
+		return false;
+	}
+	else {
+		return false;
+	}
+}
+
 /**
  * Returns the number of faces that are adjacent to both f1 and f2,
  * \note Could be sped up a bit by not using iterators and by tagging
diff --git a/source/blender/bmesh/intern/bmesh_queries.h b/source/blender/bmesh/intern/bmesh_queries.h
index 6b1bfca2d80..47b6d87f91a 100644
--- a/source/blender/bmesh/intern/bmesh_queries.h
+++ b/source/blender/bmesh/intern/bmesh_queries.h
@@ -61,6 +61,7 @@ bool    BM_edge_is_wire(BMEdge *e);
 
 bool    BM_vert_is_manifold(BMVert *v);
 bool    BM_edge_is_manifold(BMEdge *e);
+bool    BM_vert_is_boundary(BMVert *v);
 bool    BM_edge_is_boundary(BMEdge *e);
 bool    BM_edge_is_contiguous(BMEdge *e);
 bool    BM_edge_is_convex(BMEdge *e);