Fleshing Out Projections
In an earlier paper, the authors presented an algorithm for finding all polyhedral solid objects with a given set of vertices and straight line edges (its wire frame). This paper extends the Wire Frame algorithm to find all solid polyhedral objects with a given set of two dimensional projections. These projections may contain depth information in the form of dashed and solid lines, may represent cross sections, and may be overall or detail views. The choice of labeling conventions in the projections determines the difficulty of the problem. It is shown that with certain conventions and projections the problem of fleshing out projections essentially reduces to the problem of fleshing out wire frames. Even if no labeling is used, the Projections algorithm presented here finds all solutions even though it is possible to construct simple examples with a very large number of solutions. Such examples have a large amount of symmetry and various accidental coincidences which typically do not occur in objects of practical interest. Because of its generality, the algorithm can handle pathological cases if they arise. This Projections algorithm, which has applications in the conversion of engineering drawings in a Computer Aided Design, Computer Aided Manufacturing (CADCAM) system, has been implemented. The algorithm has successfully found solutions to problems that are rather complex in terms of either the number of possible solutions or the inherent complexity of projections of objects of engineering interest.
M. A. Wesley and G. Markowsky, "Fleshing Out Projections," IBM Journal of Research and Development, vol. 25, no. 6, pp. 934-954, Institute of Electrical and Electronics Engineers (IEEE), Nov 1981.
The definitive version is available at http://dx.doi.org/10.1147/rd.256.0934
Keywords and Phrases
International Standard Serial Number (ISSN)
Article - Journal
© 1981 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.