Methodology

The main sequence of steps is as follows :

• Reading in the input from a .DXF file.
• Seperation of edges into different views.
• Intersecting each edge with others in the same view to find vertices, not entered explicitly.
• Generate a list of 3-D vertices by considering the co-ordinates of the 2-D vertices.
• For each view, establish the 3-D location of the curved edges.
• Find the 3-D edges by considering all possible pairs of 3-D vertices.

As mentioned earlier, the algorithm does not consider the hidden line informaton and hence loses out on ambiguity. The wireframe generated obviously can never be more unique than what a human can make out of the given input. It gives the union of all possible solutions. The wireframe can be justified in the sense that it has the same orthographic projections as the input.