what is the algorithms for computing Delaunay triangulations
6 views (last 30 days)
Show older comments
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 Comments
Answers (2)
Mike Garrity
on 13 Jan 2016
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 Comments
Walter Roberson
on 21 Dec 2018
R2019a is not a released product. For information about it, contact Mathworks Sales, who can give you information under Non-Disclosure.
Walter Roberson
on 13 Jan 2016
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.
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)
See Also
Categories
Find more on Delaunay Triangulation in Help Center and File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!