M. D. Diamond, N. Narasimhamurthi, S. Ganapathy
The discrete and continuous graph labeling problem are discussed. A basis for the continuous graph labeling problem is presented, in which an explicit connection between the discrete and continuous problems is made. The need for this basis is argued by noting conditions which must be satisfied before solutions can be pursued in a formal manner. Several cooperative solution algo- rithms based on the proposed formulation and results of the application of these algorithms to the problem of extracting line drawings are presented.