Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I have 2D line segments extracted from an image. So i know end point coordinates of them. also, i have some reference 2d line segments. Both line segments are now in vector form. comparing to reference and extracted lines,I have huge amount of extracted lines segments.

What i want to do is to find corresponding line segment for each reference line from my extraction. that is I want to match line segments. But, to reduce the search area i wish to limit it in such a way that by defining a buffer zone around a reference line segment.

(1) My first question is how can i implement this buffer case with c++ as i am lacking with geometric theories.

Note: I dont want to use a bounding box and looking for a rectangular buffer which orient along the reference line.

(2) my second question is, if i know the rectangular buffer limits, then which type of concept should i use to avoid unnecessary searches of line segments.

please do not think this as home work and i am really struggling because of my poor mathematics. thanks in advance.

share|improve this question
    
What do you mean by "conjugate line segment"? –  rschwieb Jan 16 '13 at 16:17
    
@rschwieb: i mean corresponding –  gnp Jan 16 '13 at 16:31
2  
This sounds like a question for Stack Overflow with an "algorithms" tag, not really a math question. I think you will also want to add more detail about what you want to do, because I don't understand it. –  Hew Wolff Jan 16 '13 at 17:17
    
What do you mean by "corresponding"? –  rschwieb Jan 16 '13 at 17:28
    
@rschwieb: i want to get best matching extracted line segment to each reference line segment. –  gnp Jan 16 '13 at 21:45

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.