# Check vertex convexity

Just like we can test if a dihedral angle is convex, concave or smooth, the same classification can be useful recognition cue for vertices. E.g., for each vertex in a planar domain, we can analyze the angle between a pair of edges that meet in this vertex. Such information can be used for accessibility analysis, i.e., if a mill can approach the vicinity of a certain part's corner.

To analyze vertex convexity, select a face and run check-vertex-vexity command.

You can read more about why this heuristic can be useful in the corresponding blog post.