what is the algorithms for computing Delaunay triangulations

Excuse me. I want to know what is the algorithms for computing Delaunay triangulations in matlab ,Flip algorithms,Incremental,Divide and conquer,Sweepline or Sweephull? Thank you very much

Answer 1

[Mike Garrity]

The delaunayTriangulation class is built on top of the CGAL library. You can find all of the details in their documentation , but basically it's an incremental split & swap technique.

[li hao]

Thank you very much, do you mean matlab software use incremental split to delaunayTriangulation? Because I want to know what is the algorithms for computing Delaunay triangulations in matlab

[Alec Jacobson]

Is this still the case in 2019a?

[Walter Roberson]

R2019a is not a released product. For information about it, contact Mathworks Sales, who can give you information under Non-Disclosure.

Answer 2

[Walter Roberson]

delaunay()

Historically called upon Qhull; I am not certain what it uses now; it does not appear to be documented. The first version that did not use QHull was R2009b.

delaunayTriangulation

is documented as using the same algorithm as delaunay(); see http://www.mathworks.com/help/matlab/math/delaunay-triangulation.html . Unfortunately it does not seem to say what the algorithm is.

delaunayn() you can tell from the available options still uses Qhull (and it is so documented in the R2009b release notes)

[li hao]

Thank you much