what is the algorithms for computing Delaunay triangulations
6 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
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 commentaires
Réponses (2)
Mike Garrity
le 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 commentaires
Walter Roberson
le 21 Déc 2018
R2019a is not a released product. For information about it, contact Mathworks Sales, who can give you information under Non-Disclosure.
Walter Roberson
le 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)
Voir également
Catégories
En savoir plus sur Delaunay Triangulation dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!