what is the algorithms for computing Delaunay triangulations

Question

li hao 2016-1-13

1
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/263571-what-is-the-algorithms-for-computing-delaunay-triangulations

评论： Walter Roberson 2018-12-21

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

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Mike Garrity 2016-1-13

2
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/263571-what-is-the-algorithms-for-computing-delaunay-triangulations#answer_206044

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.

3 个评论
显示 1更早的评论隐藏 1更早的评论

Alec Jacobson 2018-12-19

Is this still the case in 2019a?

Walter Roberson 2018-12-21

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 2016-1-13

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/263571-what-is-the-algorithms-for-computing-delaunay-triangulations#answer_205975

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)