I asked How to count self-intersections in contour on Stack Overflow but it was put on-hold. Could you help me with it, what's wrong?
Edit: I trying to conceive yours remarks:
Your question is also vague. How does a vector of 2d points become a contour? What do you mean by an intersection? – Teepeemm
Contour is a curve, that can be represent by ordered set of points placed in vector. It's standard OpenCV representation. Self-intersections... I can put image to illustrate it.
@RogerRowland - I beg to differ (at least in regards to "a very good one" - it isn't. It is a "how do I do this" and not a "I have tried X, getting these results, what's the problem", which we expect in pretty much all technical Stack Exchange sites. – Oded
It's like if your need to sort array and know only selection sort method. Of course your can take the time and try to invent new methods like quicksort or other.
But I don't see anything wrong with that, to ask in SO about fast and effective alghorithms and related articles and publications for a better understanding.
I don't often ask questions on SO and maybe something has changed recently, but I remember enough questions about search algorithms, and even a set of libraries.