Given a set of points (2D) i.e., point cloud (PC), the question is about a robust
, accurate
and computing-friendly
method to find circles (or ellipses in advanced version).
The intuitive idea is to use Brute-Force Search on all possible points (as center){infinite!} and radii (again infinite!). This is ultra-extremely slow and inefficient.
As demonstrated bellow each fitted circle would be ranked based on the number of points (nn
) positioned on the circle-circumference in a distance shorter than a threshold (t
). So there is derr
to present an average distance.
In advanced form ellipses are of interest to be fitted.
Any ideas, brain-storming, experiences, comments?