-1

In my Python code I use scipy.spatial.Delaunay to obtain a Delaunay triangulation. I can't figure out, but I'm really curious, which algorithm is used in this function in order to create the Delaunay triangulation. Does anyone know?

Thank you in advance!

eyllanesc
  • 235,170
  • 19
  • 170
  • 241
Liduine
  • 1
  • 1
  • https://stackoverflow.com/questions/21888546/regularly-spaced-orthogonal-grid-delaunay-triangulation-computing-the-paraboloi – Micromega Sep 19 '18 at 09:42
  • Possible duplicate of [Regularly spaced orthogonal grid Delaunay triangulation (Computing the paraboloid coeficients)](https://stackoverflow.com/questions/21888546/regularly-spaced-orthogonal-grid-delaunay-triangulation-computing-the-paraboloi) – Micromega Sep 19 '18 at 09:42

1 Answers1

1

As the doc states

The tesselation is computed using the Qhull library [Qhull].

Since scipy.spatial.Delaunay uses the Qt paramter for Qhull, this is used and there it states

The Delaunay triangulation is the triangulation with empty circumspheres. It has many useful properties and applications. See the survey article by Aurenhammer ['91] and the detailed introduction by O'Rourke ['94]

Joe
  • 6,758
  • 2
  • 26
  • 47
  • Thank you for your answer. I see that "Qhull computes the Delaunay triangulation by computing a convex hull." I just still don't find a description or name of an algorithm used, of how these convex hulls are computed and how the Delaunay triangulation is computed from that? – Liduine Jul 30 '18 at 12:00
  • The keyword is `empty circumspheres`. You can further look for that or take a look at the publications mentioned above. – Joe Jul 30 '18 at 17:18