pub fn k_nearest_concave_hull<G, P>(geometry: &G, k: usize) -> Polygon<P>where
G: CollectPoints<Point = P>,
P: Point<Scalar = f64> + PointMut + Default + Copy,
MonotoneChain: ConvexHullStrategy<G, Output = Ring<P, true, true>>,Expand description
Construct a concave hull while considering at most k nearest candidates
for each boundary edge.
Candidate distance is measured from the edge midpoint. k == 0 leaves the
convex hull unchanged; larger values admit progressively more refinements.