#include <MeshCleaner.h>
Static Public Member Functions | |
| static void | traverseComponent (Delaunay *del, const Simplex &seed, SimplexSet &component, hudson::SmallList< Simplex > &next_seeds) |
| template<class v_iterator> | |
| static bool | clean (Delaunay *del, v_iterator begin_corners, v_iterator end_corners, hudson::SmallList< Simplex > *optional_output=0) |
Classes | |
| struct | FindAllDead |
| struct | FindCorners |
TODO: handle the deletion of vertices.
|
||||||||||||||||||||||||||||
|
Remove all ``exterior'' simplices. The corners are assumed to be exterior points. We remove that entire component. We then save the next component we find, and delete all later components. If we have many 'next' components, undefined behaviour results. This probably should be checked against. Returns false if the mesh was not watertight and we identify every simplex as being exterior. The caller should check and see what to do about this. The mesh is unmodified in this case. |
|
||||||||||||||||||||||||
|
Traverse one component. Return the component as an ordered set, and return a list of seeds (possibly with duplicates) of simplices just on the other side of a boundary from the current component. The component need not be initialized to be empty. |
1.4.6