A single linear or straight line can use findContours disjoint outline of search, find online, the coordinates of points but when straight line intersection, how to calculate the line the coordinates of the point?
This figure, for example, there are four single pixel curve, how to extract various online the coordinates of the point?

CodePudding user response:

Has anyone made similar or related

CodePudding user response:

Which is the way by tangent approximation, judge the current line

CodePudding user response:

Does anyone have idea, can ask idea???

CodePudding user response:

Why no one concerned about this??? How challenging this

CodePudding user response:

CodePudding user response:

Derivation, similar to a straight line

CodePudding user response:

Challenge, will have the opportunity to send the article

CodePudding user response:

Image contour extraction with directly, can get the pixel coordinates of line

CodePudding user response:

This is made of, what software is software engineering drawings or numerical calculation software

CodePudding user response:

Unknown ~ ~ sleep him

CodePudding user response:

What is this software I have never seen a...

CodePudding user response:

I also want to know how to calculate!

CodePudding user response:

Projection stresses the contrast crest, adjacent projection coordinates directly continuity judgment, can determine that part of the intersection together

CodePudding user response:

First identified by these four lines in one plane since they can build a plane rectangular coordinate system, in turn, they can be found in the plane coordinate relations

CodePudding user response:

Is thinking, I also want to know how to deal with

CodePudding user response:

[f I think should be derivative, is not good

CodePudding user response:

I also want to know do very well

CodePudding user response:

Bosses have detailed steps should ~ derivation?

CodePudding user response:

This has a ready-made package can catch, the most common,,

CodePudding user response:

See, learning

CodePudding user response:

Learning, the building Lord found the method

CodePudding user response:

Curve equation;

CodePudding user response:

Pass by, to learn!

CodePudding user response:

This method a lot, if there is no breakpoint is a standard curve, it's very casual, 8 neighborhood search, select the starting point for the search continuously, until the end of the curve, encounter the situation of the bifurcation is marked as intersection, then choose not experience curve, until the traverse the whole picture,
This problem is much more complicated when a breakpoint, first of all, the problem is divided into two problems:
1) divide the curve;
2) each curve intersection;
Your first question, the curve break point to the characters, the problem is more complex, solution or a lot of, such as hough transform, curve fitting and so on, divide each curve, judgment of intersection are very simple,

CodePudding user response:

Just wrong, the answer is how to evaluate intersection, now to answer how to curve,
First, you need to clear, what can be classified as a curve, usually on the basis of judging the slope,
Then the problem can be split, and intersection or overlapping line, and then ask whether a few curves in the divergence can be merged, filtered according to the definition of the curve mode 2 curves a merger, does not conform to requirements of the judgment of 2 curves,

CodePudding user response:

Is needed. Thank you

CodePudding user response:

The

reference 29 floor tianchen solitary evil spirit & amp; Response:

just wrong, the answer is how to evaluate intersection, now to answer how to curve,
First, you need to clear, what can be classified as a curve, usually on the basis of judging the slope,
Then the problem can be split, and intersection or overlapping line, and then ask whether a few curves in the divergence can be merged, filtered according to the definition of the curve mode 2 curves a merger, does not conform to requirements of the judgment of 2 curves,

Should be so

CodePudding user response:

This had not seen, what software?

CodePudding user response:

Winding rope section, had divided, the line is regarded as a few particle trajectory, isn't it a bit like tracking algorithms, such as radar,

CodePudding user response:

Can try to use hough transform, can be finish line detection

CodePudding user response:

Hough transform is tried, the result is bad

CodePudding user response:

The

reference 29 floor tianchen solitary evil spirit & amp; Response:

just wrong, the answer is how to evaluate intersection, now to answer how to curve,
First, you need to clear, what can be classified as a curve, usually on the basis of judging the slope,
Then the problem can be split, and intersection or overlapping line, and then ask whether a few curves in the divergence can be merged, filtered according to the definition of the curve mode 2 curves a merger, does not conform to requirements of the judgment of 2 curves,

But after refining the very thick line into a skeleton, the intersection part of there could be a very long overlap region, this time it is a bit difficult to judge the slope

CodePudding user response:

Under the guidance of trouble? For this is not understood

CodePudding user response:

The

references the 38th floor expert's reply:

Quote: reference 29 floor tianchen solitary evil spirit & amp; Response:

just wrong, the answer is how to evaluate intersection, now to answer how to curve,
First, you need to clear, what can be classified as a curve, usually on the basis of judging the slope,
Then the problem can be split, and intersection or overlapping line, and then ask whether a few curves in the divergence can be merged, filtered according to the definition of the curve mode 2 curves a merger, does not conform to requirements of the judgment of 2 curves,

But after refining the very thick line into a skeleton, the intersection part of there could be a very long overlap region, this time a bit difficult to judge the slope

to determine overlapping part of the slope, and then take the average, interval as the overlap part of the slope can be, how to take specific problems should be concrete analysis, then ask the other the slope of the intersection of line, and then compared with overlap part of the slope, the merged curve, setting the threshold value overlap part can not refine, obtained the slope range and refinement, slope and the slope of the intersection line interval when differences can take minimum can also have other discriminant method, or a specific issue concrete analysis, not a way to solve the problem of all,

CodePudding user response:

Haven't seen such a figure

CodePudding user response:

At least three adjacent points points, is the intersection point,
If the point (x, y) value is 1, if there are more than three around eight points is 1, so fast (x, y) this point is the intersection point

CodePudding user response:

The curve of the building Lord defined here are obviously trigonometric function curve.

CodePudding user response:

Derivation, near two

CodePudding user response:

,,,,,,,,

CodePudding user response:

Parsing from pictures? Or know that certain value curve?

CodePudding user response:

After fitting, piecewise iteration for intersection point

CodePudding user response:

Just wrong, the answer is how to evaluate intersection, now to answer how to curve,
First, you need to clear, what can be classified as a curve, usually on the basis of judging the slope,
nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull