I am given the data about nodes and elements of a tetrahedral mesh. What algorithm do I use to find the boundary faces of the mesh?
2
-
$\begingroup$ Do you know the ordering of the element connectivity? $\endgroup$– nicoguaro ♦Sep 13, 2017 at 14:31
-
$\begingroup$ See my answer to this question: scicomp.stackexchange.com/questions/21163/… (it is faster to sort than using a map). $\endgroup$– BrunoLevySep 14, 2017 at 19:08
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
First, create a list of faces in the mesh. From there you should be able to create a map from faces to tets, as each face must belong to either one or two tets. The faces that belong to only one tet are your boundary faces.
