How to clean up this Emily mesh to prepare for tetgen?
I had asked this question before but on github here , but never got farther into it. Now I have picked it up, and am trying to get this mesh tetrahedralized, but I keep getting errors see below. Ahlthough the statement clearly says "Found a segment and a subface intersect", I don't know how would I go about resolving that ? The question here is more precisely how to find if mesh has an open boundary and how to locate that and fix that in perhaps blender ? I am asking about open boundary since "camel.off" which clearly has an open boundary gives the same error. I even tried using another geometry processing tool but it showed no holes found, and its auto repair didn't work either. 
I get the obj file of Emily 3D scan and remove everything such as eye lashes, eyeballs, inner and outer extra subgeometries. I am using blender to export and using libigl tetgen example to see it if it works. I inspected the mesh, I don't see any holes in the topology, the base hole I fill up using the blender grid fill functionality. See the attached picture. 
In libigl I launched it in the viewer before processing with tetgen and it looks fine, I also tried all the blender clean up tool, see 
.
Is there a way to do some more preprocessing automatically before trying to create a tetrahedralized mesh that would ensure smooth operation ? Please advice.
Notice that the lips of Emily has self-intersecting faces. This can be viewed in MeshLab as suggested by @Dominik Mokris. However after deleting those faces, it is hard to get it properly filled without additional faces becoming self-intersecting. See one of the main errors from the tetgen was about self-intersection. The only great tool I found is MeshMixer from Autodesk, in it there is tool called makesolid that takes care of closing the holes and self intersecting faces, etc. Great tool, I can now generate tetgen nicely using libigl !
- Draw circle in console using python
- Is it correct and consistent to check two vertex points for equality?
- Fastest algorithm for filling overlapping rectangles of pixels
- While finding count of points inside some shape using KD-Tree, do we need to check areas intersection, or just compare depth-appropriate properties?
- Task stuck at "GET RESULT" from Join -> groupby in Spark (sedona)
- How can I check if two segments intersect?
- Check if a 3D point lies inside a 3D platonic solid?
- How to check a point is inside an ellipsoid with orientation?
- algorithm to trace border in 2D array
- Computing convex polygon segments using CGAL
- Finding the biggest shape possible inside a grid
- Problems working with vector layers in R terra "Points of LinearRing do not form a closed linestring "
- How to find a point in a line in java?
- How to find the greatest possible euclidean distance we can achieve by moving using given set of vectors
- Check if a given point is within the boundary of the rotated element
- Order of points along a best fit line
- How would I implement the Hausdorff distance using Gekko?
- Distance between point coordinates from two different data frames in R
- How to convert Cartesian coordinates epitrochoid graph into polar coordinates in pascalABC?
- Check if a point projected on a line segment is not outside it
- Calculate arc coordinates based on original point, end point, center, distance and bearing using python
- Google Maps Circle
- R: How to replace values in polygon geometry without a for loop?
- How to convert spherical geometry to ellipsoid geometry c++ vertex generation
- How to make a Prismoid in Three.js?
- Python, geometry and visualisation
- Switch the geometry of a mesh in real time three.js
- How do I compute the intersection point of two lines?
- Closest edge to a rectangle in a plane of rectangles
- How do I triangulate a polygon with holes without extra points