Commit 3c04f73a authored by Célestin Marot's avatar Célestin Marot
Browse files

added README

parent 6e0972a3
The `hxtSPR()` function, given in HXTSPR.h, allows to find the best
tetrahedralization of a cavity in a relatively short time considering it is an
NP-hard problem. HXTSPR use a branch and bound algorithm first described in the
2006 paper:
> "Optimal Tetrahedralization for Small Polyhedron: A New Local Transformation
> Strategy for 3-D Mesh Generation and Mesh Improvement"
> (Liu, Jianfei and Sun, Shuli and Wang, Dachuan)
However, the basic branch and bound algorithm described is quite slow. Several
optimizations are described in
## build test example in .5s
make -j3
## run and see output
./test && gmsh out.msh
## cleaning everything
git clean -f
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment