The underlying data structure doesn't provide fast/convenient access to the vertices of a tet or a face. e.g. for a tet one first has to walk down to the associated faces, then the edges, then somehow eliminate duplicates, etc. It might be helpful to offer precomputation/caching of these types of connectivity relationships, if desired for particular applications.
The underlying data structure doesn't provide fast/convenient access to the vertices of a tet or a face. e.g. for a tet one first has to walk down to the associated faces, then the edges, then somehow eliminate duplicates, etc. It might be helpful to offer precomputation/caching of these types of connectivity relationships, if desired for particular applications.