pub fn delaunay(x: &[f64], y: &[f64]) -> TriangulationExpand description
Bowyer-Watson incremental Delaunay triangulation of 2D points.
Points are inserted one at a time into a super-triangle large enough to contain all of them; triangles whose circumcircle contains the new point are removed and the resulting cavity is re-triangulated. Triangles touching the super-triangle vertices are discarded at the end, leaving only triangles over the input points.
Returns an empty triangulation when fewer than 3 finite points are given or when all points are collinear/coincident (no triangle has nonzero area) — silx surfaces this as “Cannot get a triangulation” and skips the renderer.
x and y must have the same length. Non-finite points are ignored, as
silx masks them out before triangulating
(scatter.py::_getTriangulationFuture).