Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

Distance computation

I am trying to do a program that can recognize circle and use the informations to build a data.

The part that I am trying to build now is the "minimum distance between two circles" . I have 6800 circles on one picture, so it has to be precise.

My idea was to get the position of the first circle (i=1) and the position of the second circle (i=2). I guess it will be the fastest but I don't think it will be the minimum. I have the hope that maybe Hough function is detecting one circle and then the closest that's why I ask this.

Second idea get all the position and find for each position the closest point. I guess it is the best one but it could be slow no ? ( already Hough function makes my program slow)

The thing is that I don't have any idea of the function that I could use.

How to get the position of each circle (center) ?

Hope you can help me

jeje