finding predecessor and successor of a node(shape) in relation diagram

Asked Apr 06 '17 at 12:13

Active Apr 30 '17 at 23:07

Viewed 299 times

Finding predecessor and successor of a node(shape) in image:(opencv & python)

Now I want to get the junction point of node and edge so that to count indgree and out degree of node(shape) and then predecessor/successor of node

help somebody to get the relation b/w nodes and edges(lines)

I have tried to separate H/V lines using How to remove convexity defects in a Sudoku square? but not able to get the junction points of node and edge

edited May 23 '17 at 12:34

Community

asked Apr 06 '17 at 12:13

let's try

Since you were able to separate the H/V lines, you can perform **bitwise AND** operation between this image and the image containing only the shapes. – Jeru Luke Apr 06 '17 at 16:40
U mean to say : bitwise And of input image and image with H/V lines – let's try Apr 11 '17 at 12:02
No. What I meant was bitwise AND operation between the H/V lines image an the image containing only the shapes without lines – Jeru Luke Apr 11 '17 at 12:06
getting blank image after performing bitwise _and operation on shape_img and edges_img. Please help to get the junction point of shapes and edges. – let's try Jul 29 '17 at 11:47
Still on same stage, please help to get the solotion – let's try May 12 '18 at 07:39
Is it so tough to solve it? – let's try May 12 '18 at 07:39

0 Answers0