The methodologyto generate 3D wireframe from 2D orthographic projections involves. The methodology to generate 3D wireframe from 2D Ortographic projections involves

STEP1: Reading input information in each view which involves.

No of vertices in front view and corresponding x and z coordinates of each vertex.
No of vertices in top view and corresponding x and y coordinates of each vertex.
No of vertices in Side view and corresponding y and z coordinates of each vertex.

STEP2: In this step no of edges in each view and the corresponding start and finish vertices of each view are read.The order of their formulation is topview, side view and front view.
Here itself the edges in each view are classified into any of the 5 cases as per their position in a projection plane.The 5 casesare
case 1: edge parllel to x-axis.
case 2: edge parllel to z-axis.
case 3: edge parllel to none of the coordinate axes.
case 4: a focus point formulated by the accumalation
case 5: edge parllel to y-axis.

STEP3: Now an edge from front edge list is selected ,according to its it may go into any of the leaf nodes of the decesion tree. At this stage the search goes into which node is governed by the following rules.

Any edge parllel parllel in two planes to a common coordinate axes will be a point in the third projection plane.
An edge parllel to one of the coordinate axes in a plane and inclined in other plane will be parllel to one of the axes in 3'rd plane.
An edge which is inclined in two projection plane will also be inclined in the 3'rd projection plane.

As per these rules the search enters the corresponding edge or vertex list and find for its projection match.If the search condition is satified in 3 views 3D edge is generated (i.e is lost depth information is extracted) ( depict and explain decesion tree)
ExampleSelected edge from example is 1 to 2 this edge is parllel to x-axis so it belongs to the case one So as per the tree it enters the top edge list, In the top edge list it may have a projection either parllel to x-axis(1) or parllel to none of the axis(case 3). Now all the edges in top view belonging to either case 1 and 3 is a possible projection At this stage the bounds of these possible edges checked ,if its bounds are matching the search proceeds further into the side view.

If the possible projection in top view is parllel x-axis(case-1) the search goes into the side vertexlist, If there exist vertex corresponding to the above projection the s
elected edges depth information will be known,that is possible 3d edge is generated. for ex: for edge 1-2 in f_elist. are matches in te_list and corrsponding vertices in sv_list . the generated 3D edge is : if it is parllel to none (case 3) than the search enters side edge list and finds for case5 (parllel to y-axis) if this case is satisfied and bounds are also matching then 3D edge will be generated. In case of our example : for 1-2 in fe_list - in te list - in se_list So the generated 3D edges: Like wise the whole front view edges are traversed and each traversal results in some 3D edges, By the completion of traversal of all edges in front view 3D edges will be generated.The combination of all the generated 3D edges will gives the wire from of the actual object.
Here we are eleminating the overlapping edge removal and redundant edge removal problem by implementing
bounds checking. In our example for edge 1 2 (which is case 1) , all the edges in top view parallel to x axis (i.e case 1)
will have the probability to be candidate edge. So in side view searches begin with all the edges corresponding to case 1
edges in top view. So time taken for the search will be large and redundant and overlapping edges generated. But in our program only edges 1 3 and 10 12 in top view has the potentiality to be a candidate edge. So no of searches reduces and redundant edges are not generated.