what is the algorithms for computing Delaunay triangulations
6 visualizaciones (últimos 30 días)
Mostrar comentarios más antiguos
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 comentarios
Respuestas (2)
Mike Garrity
el 13 de En. de 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 comentarios
Walter Roberson
el 21 de Dic. de 2018
R2019a is not a released product. For information about it, contact Mathworks Sales, who can give you information under Non-Disclosure.
Walter Roberson
el 13 de En. de 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)
Ver también
Categorías
Más información sobre Delaunay Triangulation en Help Center y File Exchange.
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!