Expand description
Concave hulls derived from a planar point set.
Boost.Geometry has no concave-hull algorithm. The edge-refinement shape is
based on Park & Oh (2012), while the k-nearest entry exposes the candidate
breadth described by Moreira & Santos (2007). Both variants begin with the
existing convex hull and preserve a simple clockwise boundary.
Structs§
- Concave
Hull Params - Parameters controlling edge-refinement concave hulls.
Functions§
- concave_
hull - Construct a concave hull with
ConcaveHullParams::default. - concave_
hull_ with - Construct a concave hull using explicit edge-refinement parameters.
- k_
nearest_ concave_ hull - Construct a concave hull while considering at most
knearest candidates for each boundary edge.