# How to check disconnected vertices in a triangular mesh

**URL:** https://discourse.itk.org/t/how-to-check-disconnected-vertices-in-a-triangular-mesh/2710
**Category:** Algorithms
**Created:** [February 12, 2020, 4:05pm UTC](https://discourse.itk.org/t/how-to-check-disconnected-vertices-in-a-triangular-mesh/2710 "2020-02-12T16:05:59Z")
**Posts on this page:** 1
**Showing post:** 7

<div class="post-metadata">

### Author: ![dzenanz](https://discourse.itk.org/user_avatar/discourse.itk.org/dzenanz/32/1093_2.png) [@dzenanz](https://discourse.itk.org/u/dzenanz)
#### Post date: [February 13, 2020, 11:03pm UTC](https://discourse.itk.org/t/how-to-check-disconnected-vertices-in-a-triangular-mesh/2710/7 "2020-02-13T23:03:13Z")

</div>

Regular vertices are the ones which have 6 neighbors. All other vertices are irregular.

You could look at this [PR](https://github.com/InsightSoftwareConsortium/ITKCuberille/pull/51) for explanation, and use [CuberilleImageToMeshFilter](https://itk.org/Doxygen/html/classitk_1_1CuberilleImageToMeshFilter.html) with the latest git master version to create your mesh.

---

_[View the full topic](https://discourse.itk.org/t/how-to-check-disconnected-vertices-in-a-triangular-mesh/2710)._