While consulting in October 2019, I ported python bindings for
Computational Geometry Algorithms Library (CGAL).
The Efficient RANSAC algorithm reads an arbitrary list of points in 3d space to determine the best set of 2d shapes (faces). The 2d shapes together form an interactable 3d object (mesh).
Specifically, I provided Python libraries with equivalent functions/features to CGAL's 3d shape detection library (C++).
Note: These used "Efficient RANSAC" algorithm and do not provide implementations for "Region Growing".