Delaunay triangulation from convex hull

Question

我需要编写一些关于计算几何的代码并使用openMP对其进行并行化。到目前为止，我已经完成了凸包和最接近的一对点。我需要编写delaunay三角剖分和征服代码，但是我没有太多时间。如果可以计算凸包，那么可以很容易地实现delaunay三角剖分。尽快。

Answer 1

I read somewhere that delaunay triangulation can be easily implemented if the convex hull can be calculated.

This is true, but the precise statement is that the 2D Delaunay triangulation can be easily constructed if a 3D convex hull implementation is available. Knowing the 2D hull does not help much with constructing the Delaunay triangulation (DT), besides giving you a few edges of the DT (each hull edge is an edge of the DT).

Assuming you have not implemented the 3D hull (which is quite tricky), then you need to attack the Delaunay triangulation separately.

Answer 2

QHull几乎是许多人使用的标准库： http ://www.qhull.org/html/qhull.htm也许您可以将其用作参考实现，如果您确实想重新实现的话。