CGAL users discussion list

["Dr. Liu Jianfei" <>]

hi,Matthijs Sypkens Smit
3D BSP can't be considered since its huge memory requirements.
I am also interested in the conforming DT, though it isn't practical one. 
would you kind to tell me the conclusions and results or discoveries of yours 
after finished your implementation. Cohen-Steiner's algorithm is certainly 
unpractical , you have to put some new ideas into it.

> Dear Laurent,
> 
> I do not have an implementation of a 3D BSP. For the construction of 
> constrained Delaunay triangulations I have been using Tetgen[1]. Tetgen 
> creates the triangulation and from Tetgen's datastructure I construct a 
> CGAL Triangulation, that is effectively a CDT. Drawback is that I had to 
> make a small modification to the Tetgen source. I think it should be 
> possible to do it without the modification, but I don't have that 
> currently. Also, Tetgen fails on some models. I have not investigated it 
> in detail, so I cannot be sure if it is the robustness of Tetgen or that 
> the fault lies with the models.
> 
> 1] http://tetgen.berlios.de/
> 
> So, I guess the answer depends on your definition of "usable for the task". 
> If you are still interested, I can send you code/instructions privately. 
> It is by no means suitable for release or incorporation into CGAL.
> 
> 
> I have also partly implemented the algorithm of Cohen-Steiner/de 
> Verdière/Yvinec for creating a conforming Delaunay triangulation. This is 
> not finished yet, but it is very slow and resource-intensive on large 
> models (containing a lot of triangles). It also tends to yield many more 
> elements than you originally started with.
> 
> 
> -- 
> Matthijs Sypkens Smit
> 
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>