View stunning SlideShares in full-screen with the new iOS app!Introducing SlideShare for AndroidExplore all your favorite topics in the SlideShare appGet the SlideShare app to Save for Later — even offline
View stunning SlideShares in full-screen with the new Android app!View stunning SlideShares in full-screen with the new iOS app!
2.
D Dutta and Y L Srinivasconsistent right-side views, one by one. However, if the method to construct polyhedral solids from the threegiven views are complex, the powers of spatial visualization orthographic projections ~. Methods for the extraction ofbecome inadequate in the guidance of the analysis, which 3D information from orthographic views can also beis inherently combinatorial. That there has been no found in References 6 and 7. In Reference 8, the Wesleyreliable way to determine exactly how many solids and Markowsky approach was extended to includecorrespond to a given pair of orthogonal views is circular arcs in the orthographic views. The resultingtherefore not surprising. solids, therefore, could include quadrics and toroidal This paper presents an algorithm for the reconstruction surfaces.of all the solids that are bounded by planes and The problem of generating all solids from only twoquadrics when only two orthographic views are given. views was, to the best of the authors knowledge, firstFirst, the algorithm generates all the polygonal third examined by Wilde 9. Wilde examined the difficultiesviews (i.e. the views that are composed of straight lines involved in spatial visualization, and, in particular, inonly ) that correspond to a given pair of orthogonal views. the reconstruction of solids from two orthogonal views.It does so by reconstructing all the polyhedral solids that This paper presents algorithms for the reconstruction ofcorrespond to the orthogonal views. The three views are polyhedral and curved solids from two views.then analyzed to identify the line segments in the rightview that can be replaced by circular arcs (other conics Applicationscan be included easily). Finally, the nonpolyhedral solidsare generated from the modified three views. An automatic procedure to generate solids from line The reconstruction procedure, which is akin to the drawings has many applications in engineering. Forgift-wrapping method of generating convex hulls, begins example, one can then verify the consistency of compli-from a vertex, and faces are added one by one, until a cated engineering drawings automatically. Such ansolid is generated. Considering every valid triple of algorithm can also be part of an interactive system tovertices, the algorithm evaluates all candidate faces for assist a designer during the development of new productinclusion. It considers all the valid configurations of faces, designs. Moreover, drawings continue to be the mostand determines the complete set of valid solids that natural way of conveying geometric information forcorrespond to the given views. An empty solution set designers. Therefore, a system to convert automaticallyproves that the given views are inconsistent. engineering drawings into solid models can be very useful. This section of the paper is concluded by a review of The conversion of engineering drawings into solid modelsprior work on the generation of solids from line is a task that many industries have to address in thedrawings, and potential applications are mentioned. The process of adopting solid-modelling systems. The recog-second section of the paper analyzes the problem and nition of orthographic projects also has applications indiscusses the algorithm. The third and fourth sections machine vision and automated inspection.contain the algorithms for polyhedral- and curved-solidsgeneration. Examples are given in the fifth section. ANALYSIS OF RECONSTRUCTION PROBLEMPrevious work Canonical orientationAs a result of the use of digital computers for image It is a common practice in engineering drawing to orientprocessing, various aspects of the automatic recognition the object such that it yields the simplest orthographicand reconstruction of line drawings have been researched views. It is easy to see that a simple object can producesince the 1960s. In particular, two variants of the problem complicated orthographic views if it is not oriented indiscussed in this paper, i.e. reconstruction from single- the best possible way. For example, a cube standing onview and 3-view drawings, have received attention thus its vertex would produce a rather complicated set offar. orthographic views, with all its edges foreshortened. An excellent survey of the research on the machine However, when three sides of the cube are parallel to theinterpretation of line drawings can be found in the first three principal planes of projection, the orthographicfew pages of a text by Sugihara 1. In this book, Sugihara views are three squares. In the latter orientation, thereaddressed, in particular, the recognition of polyhedral is no foreshortening of the edges, and they appear in theirobjects and scenes described by single-view line drawings true lengths. That orientation of an object that maximizes(which are also referred to as perspective drawings). the number of edges that appear in true lengths in allAn important subclass of this problem is the interpretation three views is referred to as the objects canonicalof multiview line drawings. orientation. However, not all objects can be oriented such Idesawa presented a method for the reconstruction of that the edges comprising the three views appear in theirsolid models from three orthographic projections z. This true lengths (e.g. an equilateral tetrahedron).method, however, was capable of producing invalidobjects. Lafue developed heuristics to detect such invalid Edge and vertex multiplicitiesobjects by the imposition of a prespecified input format 3.In 1980, Wesley and Markowsky4 developed an algorithm When three orthographic views are provided, there isfor the production of orthographic views from wireframe enough information in the drawings for it to be deducedmodels of mechanical parts. They further extended the which lines appear in true lengths. The reconstruction of150 computer-aided design
3.
Reconstruction of curved solids from two polygonal orthographic viewsthe solid is not difficult thereafter. However, when only TQtwo views are provided, the reconstruction procedure /requires a systematic analysis of the views. Central tothis analysis is the detection of line multiplicity, which /is achieved by reasoning about vertex multiplicities. It is I I /easy to see that more than one edge of a solid can projectto the same line in one orthographic view. Such lines are /considered as multiple lines. The multiplicity m of a linel in any view refers to the maximum number of edges that 45°mitrel i n e ~can project onto l while being consistent with the otherview. Multiple edges are able to be detected by reasoningabout multiple vertices, as each edge must correspondto a pair of vertices. Therefore, the multiplicity m of vertexv refers to the maximum number of distinct vertices thatit can conceal, in consistency with the views. Themultiplicity of vertex v in the top/front can be obtainedby the vertices in the front/top view that lie on the vertical " Iline through v being counted. The following is intuitive. Ill FQ RQProposition 1 ." If vertices with multiplicities larger than 1 Figure 1. Construction of right view from top and frontexist in two orthographic views, the pair corresponds viewsto more than one valid solid. Consider a vertex set Vk of cardinality m. With mCombinatorial analysis vertices, there can be O(mt) trees*. However, the orthographic views cannot contain any trees, as trees An important difference between the problem discussed correspond to dangling faces and edges (i.e. unbounded in this paper and its two well known variations (i.e. the solids). Therefore, the set of valid right views P, which generation of solids from a perspective view and from corresponds to vertex set Vk, consists of all the graphs, three orthographic views) is that the problem has multiple but no trees or dangling edges. For example, every solutions, whereas the other two have exactly one triangulation of Vk is a topologically valid right view, as it solution each. In other words, it is necessary for both contains cycles. It is easy to see that the cardinality of the correctness and the completeness of the solution to the set P is, in general, exponential in m. As there are be determined for this problem, whereas the other two C~ such vertex sets, the possibilities for right views are problems are solved by a correct solution. It is this exponential in number. Clearly, this is a loose bound on difference that leads to the combinatorial nature of this the number of right views, as consistency with the top problem. and front views is the final check for a valid right view. A bound on the number of right views (and, hence, Moreover, the inclusion of nonpolyhedral solids in the the distinct polyhedral solids) that correspond to a pair above analysis results in an infinite number of valid right of orthographic views can be derived by analysis of the views. standard technique used in engineering drawing to develop third views from two given views. The procedure is illustrated in Figure 1, but discussions are not included. Correctness of procedure An explanation can be found in any standard text on It is asserted that a 2-view representation can be unique engineering drawing, e.g. Reference 10. under special conditions. In Figure 1, assume that the top and front views, shownin the top quadrant TQ and the front quadrant FQ, Lemma 1." If at least one of the two given orthographic respectively, were generated by the analysis of a solid S views has no multiple vertices, the 2-view representation with m vertices and n edges. By construction, all the is unambiguous.candidate vertices in the right quadrant RQ are theintersections of the horizontal and the vertical lines drawn Proof." Let the top and front views be given, the formerfrom the vertices in FQ and TQ, respectively. There are without any multiple vertices. The top view thenO(m) vertices in TQ and in FQ. Therefore, RQ has determines the total number of vertices in the object andO (m 2 ) candidate vertices. However, the right view cannot their unique connectivities (i.e. the edges). Clearly, thehave more vertices than its progenitor S. Thus, each top view determines the unique topology of the solid. Bycorrect right view R i developed from the candidate definition, the front view contains the elevation of eachvertices in RQ is a graph Gi( V, E), and V = O(m). (Note vertex that appears in the top view. Therefore, the giventhat firm lines in the right view cannot intersect, except representation is unambiguous. []at the candidate vertices. However, intersections betweenfirm and hidden lines can create new vertices. ) If M = m2, * For example,with three verticesA, B and C, there can be trees suchthere are C~ possibilities for the vertex set V. as A-B-C, A-C-B, B-A-C and so on.volume 24 number 3 march 1992 151
4.
D Dutta and Y L SrinivasNote that a pair of orthographic views, as per L e m m a l, that correspond to valid representations of solids aredoes not, in general, facilitate visualization. However, for identified and stored. As all the candidate configurationsthe purposes of the reconstruction algorithms, they are are enumerated, the algorithm ensures that the solutionvalid inputs. If the multiplicity of a vertex is n, it can set is complete, i.e. that there are no solids other thanconceal up to n - 1 vertices in the view. Therefore, such those in the solution set that generate the given pair ofa vertex is accounted for in the construction procedure orthographic views.by consideration of the view in which the vertex appearsn times, once with each value of the vertex multiplicity OVERVIEW OF ALGORITHM(i.e. 0, 1. . . . . n - l ) . Algorithm inputTheorem 1: In the reconstruction of all the valid solids The inputs to the algorithm are two vertex connectivityfrom a pair of orthographic views, it is necessary and matrices that correspond to the given views. Thesufficient to analyze only one view, and to account for coordinates of each vertex are also supplied to theall the vertices in that view that have a multiplicity larger algorithm. Each connectivity matrix is an n x n squarethan 1. matrix, where n is the n u m b e r of distinct vertices in the corresponding view. Figure 2 shows a pair of orthographicProof: The necessity follows from Proposition 1; this views. The associated connectivity matrices are as followsproof covers sufficiency. Accounting for a multiple vertex (the first matrix corresponds to the top view, and thev in a view requires consideration of n instances of the second matrix corresponds to the front view):view, once with each value of the multiplicity of v. Thec o m p a n i o n view is used for validity checks. Clearly such -1 1 1 0 0 0 0 0 0 0 0-an accounting procedure is exhaustive. Sufficiency is then 1 1 0 0 0 0 0 0 0 0 1an immediate consequence of L e m m a 1. [] 1 0 1 1 l 1 0 0 0 0 0Any procedure that does not account for all the vertices 0 0 1 1 1 1 l 0 0 1 0with multiplicities larger than 1 is, by T h e o r e m 1,incomplete. The multiple vertices are accounted for in 0 0 1 1 1 1 0 1 0 0 0one view by the direct construction of the solid while the 0 0 1 1 1 1 0 0 1 0 !other view is used to verify consistency. The algorithmis based on an e n u m e r a t i o n scheme. It considers all the 0 0 0 1 0 0 1 1 1 1 0possible configurations that can arise from the two given 0 0 0 0 1 0 1 1 1 0 0views. F r o m these candidate configurations, only those 0 0 0 0 0 1 1 1 1 0 1 1 2 0 0 0 1 0 0 1 0 0 1 1 0 1 0 0 0 1 0 0 1 1 1 10 11 -1 1 1 1 0 0 0 1 0 0 0 8 1 1 l 1 1 0 0 0 1 0 0 7 9 1 1 l 1 0 1 0 0 0 l 0 1 1 1 1 0 0 1 0 0 0 1 3 4 5 6 0 1 0 0 1 1 2 0 1 0 0 a 0 0 1 0 1 1 2 0 0 1 0 0 0 0 1 2 2 1 0 0 0 1 1 2 3 4 1 0 0 0 0 0 0 1 1 1 l 0 1 0 0 1 0 0 1 1 1 1 5 ------ 7 6 0 0 1 0 0 1 0 l 1 1 l 0 0 0 1 0 0 1 1 1 1 1_ An element C(i, j) of the matrix has a value of 0 if node i is not connected to node j, a value of 1 if node i is connected to node j by a complete solid line, and a value 8 9 10 11 of 2 if node i is connected to node j by a complete or partially hidden line. F o r example, in Figure 2b, vertex 5 b is connected to vertex 7 by a partially hidden line, andFigure 2. Orthogonal views; ( a ) top view, ( b )front view so C (5, 7 ) = 2. The connectivity matrices are symmetric.152 computer-aided design
5.
Reconstruction of curved solids from two polygonal orthographic viewsDescription of algorithm the right view. If it corresponds to an inclined line I1 = (u, v), it can be replaced directly by a circular arc C.The algorithm works as follows. As a vertex in any view C passes through u and v, and it has 12 and l 3 as tangents,can actually correspond to the orthogonal projections of where 12 and 13 intersect I~ at u and v, respectively. If theone or more lines, a vertex analysis is first performed to vertical line in the top view corresponds to a horizontaldetect such multiple vertices, and their multiplicities are line in the right view, the corresponding solid has a sharprecorded. For example, vertex 11 in Figure 2b has a corner (and an edge) that is a candidate for roundingmultiplicity of 4, as there are, at most, four vertices in or filleting. Further checks are carried out to ensurethe top view, i.e. 6, 9, 11 and 2, whose projections can consistency with the front view, and the corner/edge incoincide with it. the solid is rounded, or filleted, by the replacement of Next, the vertex with the lowest multiplicity, vl say, the appropriate vertex in the right view with a circularis selected. From the connectivity matrices, all the arc. The blend radius can be chosen by the user, and itneighbors of vl are identified and stored in V. Every determines the point of tangencies.noncollinear triple in V containing Vl defines a plane thatpasses through v~. These planes are generated and storedin P. Finally, a set of faces F is created by the systematicdetection of all the vertices, except v~ and its neighbors, ALGORITHMthat lie on each element of P. Therefore, each element The main algorithm invokes three substeps: the form-of F is a face that contains the vertex v~. face, expand-face and curves steps. The first two steps are Next, the faces in F are analyzed. In particular, it is recursive.necessary to determine how many faces of F can lead toa valid solid. A solid is considered to be valid only if itcorresponds to the given views. The analysis involves the MAIN algorithmexpansion of faces of F, and it proceeds as follows. A MAIN algorithmface f~ is selected from F. I f f l is to be the face of a validsolid, each edge o f f l must be shared by exactly one moreface*. The neighbors of f l are identified and stored in Input: connectivity matrices for orthographic view RG1. This process is repeated for every face in F. The set and TG~ includes only those faces encountered in the analysis Output: solids corresponding to R and Tthat do not intersect any face in G~_ 1, G~-2 . . . . . G1 (i.e.it excludes nonmanifolds). Further, consistency with the begingiven orthographic views is verified prior to the addition for each vertex in R, compute multiplicityof a face in G~. A depth-first strategy is used, and the faces of G~ are for minimum-multiplicity vertex vl, while multiplicityexpanded next. Concurrently with the face-expansion >0procedure for G~, the constructed solids are checked for F ~ form-face (v~)completeness (i.e. that they are bounded solids) and while F not empty, expand-face (F)validity (i.e. consistency with the given orthographic P ~ polyhedral solids ; Q ~ right viewsprojections). Any solid that passes this check is a valid while Q not empty, curves(Q)solid, and it is stored in the solution set. The connectivity c ~ curved solidsmatrix that corresponds to the right view is then output P and Cgenerated. The face-expansion process is carried out forall sets G~ until all the faces are expanded. The algorithm endthen terminates, as all the solids that correspond to thegiven pair of orthographic views have been identified,and their right-view connectivity matrices have been The MAIN algorithm requires that, in the orthographicstored. views, there be a path from each vertex to every other Now the three views for each solid have been obtained. vertex (i.e. no edge loop is properly contained in another).The last step is to identify from these views which lines in This condition disqualifies solids that have holes orthe right view can be replaced by circular arcs. (Note pockets that open on planes. The algorithm can bethat the concern is only to introduce curves in the right modified to overcome this limitation by the addition ofview, and not in the top and front views, which were dummy edges between the appropriate vertices of theprespecified. ) It is assumed that the solid being analyzed disconnected loops.is in a canonical orientation. Once again, one view is A brief description of the procedures used by the MAINanalyzed, and the other is used to check consistency. program is given below:Clearly, all the vertical lines in the top view are candidates • Input-connectivity-matrices (top-view, front-view): Thisfor curved edges when they are viewed from the right. reads the data for both views from the input file, andFurther, a vertical line in the top view can only returns the data in matrices top-view and front-view.correspond to an inclined line, or a horizontal line, in • Generate-multiple-nodes ( top-view, front-view, multiple- node-list): This generates all the possible multiple* Nonmanifoldobjects are not considered. nodes in the front view from the information given involume 24 number 3 march 1992 153
6.
D Dutta and Y L Srinivas the top-view and front-view matrices, and returns the plane is a candidate that is evaluated by the form-face list of multiple nodes, properly labelled, in multiple- algorithm. node-list.• Get-min-mnode (multiple-node-list, min-loc): This de- termines the node in the front view that has the least Form-face algorithm number of multiple nodes in the front view, and returns The form-face procedure recursively generates all the the identification of the node in min-loc. possible faces that can be produced from the vertex set.• Get-mnodes (min-loc, multiple-node-list, mnode-list ): This extracts all the mnodes at node min-loc in the front view from the multiple-node-list, and returns the Form-face algorithm resulting list in mnode-list.• Get-connected nodes (mnode, connected-list): This determines all the mnodes in the multiple-node-list that (1) Identify all the neighbors of the last vertex of the face are connected to mnode, and returns the resulting set in connected-list. (2) For each of the vertices in this list, repeat• Get-next-plane (mnode, connected-list, Jace): This (2.1) Add the vertex to face at the current last vertex determines the next candidate plane in the connected- (2.2) If the face is complete and valid add to the list of list that passes through mnode. The previous plane, if possible faces any, is passed via face. The resulting plane is returned (2.3) Mark this vertex as USED in the list of vertices in face. that lie in the plane• Get-nodes-in-plane (.face, vertices). This determines (2.4) Invoke form-face( ) to generate the possible all mnodes that lie in the plane defined by.face, and faces for the updated face returns this mnodes list in vertices. (2.5) Remove this vertex (the last vertex ) from the face• Initial-solid (solid, face): This sets up the initial solid (2.6) Mark the vertex as FREEin the list of vertices that with a single face that is defined by face. lie in the plane• Output-solution( ): This outputs the solution set of (3) End of procedure ; Return solids.Maintenance of candidate list The procedures used by the form-face algorithm areIn a process that is inherently combinatorial, the prompt briefly described below:rejection of invalid elements can substantially reduce acandidate list. Throughout the reconstruction process, • Get-next-vertex-list (./ace, vertices, next-list)." Thistopological and geometric inconsistencies in each con- procedure returns all the FREE members of vertex listfiguration of candidate faces, edges and vertices are vertices that can be connected to the last vertex ofdetected, and the invalid elements are rejected outright. .lace. The list of these vertices is returned in next-list. In the ,gIN algorithm, vertex triples define an initial • Add-vertex-to-lace (face, vertex)." This procedureset of candidate planes through the chosen vertex v 2. expands the partially constructed]ace by adding vertexThese planes are carriers of faces that pass through v 1. to the last vertex of the face and updating vertex asHowever, not all vertex triples are candidates. All the last vertex of Jace.collinear triples and dependent triples of vertices are • Valid-face (.[ace)." This procedure verifies whether arejected (see, for example, Figure 3). In Figure 3, vertex given.face is a complete and consistent face, i.e. thetriples (l, 2, 3) and (5, 2, 4) define the same plane, and edges form a closed loop, and do not cross each other.so (5, 2, 4) is considered as a dependent triple, and it is • Add-face (.face): This procedure stores face in the listrejected. of candidate valid faces. When ~giY invokes the form-face algorithm, each valid • Mark-vertex-list (vertices, vertex, value). This pro-vertex triple (vi, vj, Vk) (i.e. a carrier plane for some face) cedure marks vertex in the list vertices with the valueis passed along with lists of additional vertices, if any, value. IF value is USED, then vertex will not be used asthat also lie on the same carrier plane. Every such carrier a candidate in subsequent searches. If value is VREE, vertex will be used. • Remove-vertex:/rom-face (Jace, vertex). This pro- cedure removes vertex from the end of the partially%",,% 2 constructed ./ace. The previous vertex in Jace now becomes the last vertex. Maintenance of candidate list , , The form-face algorithm seeks to construct valid faces 3 iI II for the solid from the set of carrier planes supplied by MAIY and a set of vertices obtained from the connectivity 5 4 matrices. The size of the candidate list of faces is kept atFigure 3. Invalid vertex triples in MAINprocedure a minimum by the performance of checks to preserve the154 computer-aided design
7.
Reconstruction of curved solids from two polygonal orthographic viewstopological and geometric validity of the partially 2 3constructed solid. The topological check consists of the retrieval, for eachcarrier plane Pi, of the set Si of all the associated verticesthat can possibly be connected to the last vertex Vk of P~.The set S~ can be constructed from the connectivitymatrices. A face is considered to be topologically validif it consists of a single, closed edge loop. Therefore, onlythose vertices from the set S~ that satisfy the above a bcondition are added to the initial triple of vertices; allothers are rejected. This avoids the consideration of 2dangling edges (see Figure 4a) and faces within facesas candidates (see Figure 4b). Next, the geometricvalidity is considered. For a face to be geometricallyvalid, it is required that edges intersect only at the lg" 4common vertices. Thus, if the addition of a vertex fromthe set S~ produces intersecting edges (see Figure 4c), thevertex is rejected. Every face that passes the above-mentioned checks is a candidate for evaluation by the Cexpand-face algorithm. Figure 4. Rejected candidate faces inform-face procedure; ( a ) dangling edges, ( b ) faces within faces, ( c ) inter- secting edgesExpand-face algorithmExpand-face( ) recursively expands all the edges of the • Get-next-face-list (edge, face, solid, face-list): Thisface. It also checks for the consistency and validity of the gets the list of all the other possible faces for the edgepartially constructed solid, and stores any valid solids that lies on face. This procedure checks and returnsthat may be encountered during the process. This only those faces that, when added, preserve thealgorithm is similar to MAIN in that it generates triples consistency of the partially constructed solid. The resultthat correspond to the carrier planes that contain possible is returned in face-list.faces. • A dd-face-to-solid (solid, face): This grows the partially constructed solid by adding face as one more face ofExpand-face algorithm solid. It assumes that face qualifies to be a valid face of solid. (]) For each edge of the face repeat • Valid-solid(solid):Thischeckswhethersolidrepresents (i.i) Extract vertices in face that correspond to the a valid solid that can be a member of the solution set. edge It checks whether (a) all the edges are shared by exactly (1.2) If edge is already shared by two faces go to two nodes, and (b) the solid produces all the vertices Step 1.5 and lines in the given view information. If solid passes (].3) Generate list of faces that can be incident to edge these checks, it returns TRUE, else returns FALSE. (1.4) For each face in this list repeat • Store-solid (solid): This adds solid as a member of the (1.4.1) Add face to the partially constructed solid solution set. (1.4.2) If solid is complete and valid, add to solution • Remove-face-from-solid (solid, face): This removes (1.4.3) Invoke expand-face( ) to expand this face the face face from a partially constructed solid solid. It (1.4.4) Remove face from solid assumes that the resulting partial solid is still valid (].5) Continue until the list is completely processed (i.e. that it does not contain discontinuities). (2) End of procedure ; Return Maintenance of candidate list The generation of vertex triples in the first part of theThe procedures used by the expand-face algorithm are expand-face procedure is similar to what happens withbriefly described below: MAIN, but the triples satisfy additional constraints. First, the triple must share the two vertices of an existing edge• Number-of-edges (face): This determines the number of the face. Second, the addition of the new third vertex of edges in face. must not result in edges that pierce through existing faces• Extract-edge (face, i, edge)." This extracts the edge i of the solid (see Figure 5a). Finally, the face normal from face. This edge is returned in the variable edge. defined by the new triple must be distinct, thereby• Already-shared (edge, solid): This checks whether disallowing more than one face on a single carrier plane edge is already shared by two of the faces of the partially (see Figure 5b). constructed solid. If so, if returns TRUE; else returns The vertex generation in the second part of the FALSE. expand-face procedure is similar to that in the form-facevolume 24 number 3 march 1992 155
8.
D Dutta and Y L Srinivas 3 it is assumed that projections of the curved surfaces are straight lines in the top and front views). The algorithm a a, then determines the edges in the right view that can be curved. The limits on the parameter values of the circular arcs can be adjusted such that no two curves overlap or intersect, and the solid remains valid. 1 a The procedures used by the curves algorithm are briefly b described below:Figure 5. Invalid cases in the expand-/ace procedure," ( a ) • Get-tertical edges ( edge-list )." This generates a list ofedges that pierce through existing faces, ( h ) more than edges that correspond to the vertical edges in the topone face on single carrier plane and front views. These edges project as either straight lines or points in both these views. The list is returned in edge-list.algorithm. The additional restrictions that need to be • Horizontal (edge-list, i): This determines whether theadhered to in the choosing of new vertices include the ith edge in the edge-list is horizontal. It returns TRUErestrictions stated above (i.e. for Figures 5a and b), and if the edge is horizontal. Otherwise, it returns FALSE.the restriction that the resultant edge can be shared by • Mark-parametric-curve ( edge-list, i)." This records thatexactly one more face. When loop closure is achieved, the ith edge in the edge-list can be replaced by a familythe resultant face is added to the solid. of circular arcs that can be represented in the As invalid elements are detected and eliminated parametric form.throughout the generation process, a pruned candidate • Get-discrete-points ( right-view, point-list ) : This identi-list is maintained, and all the elements introduced into fies all the points in the right-view that have theirthe solution are valid. Thus, for example, the possibility projections as horizontal lines in both the front andof an edge carrying one or more invalid faces does not top views. The list of resulting points is returned inarise. The solid is considered to be complete (i.e. to be point-list.a solution to the missing-view problem) when each edge • Valid-discrete-curve (edge-list, i, point-list, j)." Thishas two incident faces and is consistent with the given determines whether edge i can be replaced by a circularorthographic views. arc that spans up to the point j. It returns TRUE if the edge can be replaced.Curves algorithm • Mark-~h~crete-curve (edge-list, i, point-list, j ) . This records that edge i in the edge-list can be replaced byCurves( ) detects the edges in the newly generated right a circular arc that spans up to point j in the point-list.views that can be replaced by circular arcs, while • Get-tangent-nodes ( right-view, edge-list )." This identifiesremaining consistent with the specified top and front all the nodes in the right-view that can be removedviews. and replaced by a set of parametric arcs that are tangent to the edges that join at that node. The resultCurves algorithm is returned in node-list. • Mark-tangent-node (node-list, i): This records that (1) E ~ all vertical lines in top view. node i in the node-list can be removed and replaced by a set of parametric tangent curves. (2) For each element e~ of E repeat (2.1) Find corresponding edge r~ in right-side view E X A MP LE S (2.2) Ifr~ is not horizontal, replace r~ by a circular arc (2.3) If r~ is horizontal, repeat The workings of the algorithm are illustrated by three (2.3.1) If edges intersecting r~ are vertical, replace r~ by examples. The algorithm has been implemented in c (and circular arc run on an Apollo DN 4000 workstation). The first (2.3.2) Else, for each vertex u~ of r~ repeat example solves for polyhedral solids only, while the (2.3.3) If u~ has vertical and horizontal neighbors, second and third generate solids that are bounded by blend u i quadrics. (3) Output valid solids; STOP Polyhedral solids The polyhedral-solids example has been borrowed fromThis algorithm identifies the surfaces of the solid that Reference 9, in which ten solids were generated thatcan be curved. At present, it replaces with circular arcs corresponded to the pair of orthographic views shownonly. However, extension to include all conics is in Figure 2. With the algorithm, the complete set of solidsstraightforward; for example by the use of Limings (16) and the corresponding right-side views weremethod ~. The inputs to the algorithm are the three generated. They are shown in Figure 6. On the Apolloconnectivity matrices that correspond to the three DN 4000, it took 2.6 s to generate all the right-vieworthogonal views of the solid. It is required that these connectivity matrices (from which the right views wereviews consist entirely of straight-line segments only (i.e. drawn ).156 computer-aided design
9.
OCBIX)c- 1 2 3 4 Top ViewBO- -EV s ]7 oCO s tB F Front VlewCON) I 3 4 [ 5 6 7 8 1 tD C) 0 I r I ?- C~ 7 I0 5 "3 £ (3 ¢91 ¢- G) 9 10 11 12 o O_ G) o F Y ,,,7 ..77 B II 12 13 14 o o o ,.< 0 o 13 14 15 16 0 7 "O ST 7 C) Figure 6. Polyhedral solids Figure 8. Second set of curved solids",4
10.
D Dutta and Y L Srinivas I J Top View 1 . . . . . Front View a b C d eFigure 7. First set of curved solids For the solution of the above problem, the assumption in 3.2 s, and the corresponding curved right views inwas made that every solid has a planar (rectangular) 2.1 s, on the Apollo DN 4000. As before, not all the rightbase, the boundary of which corresponds to the boundary views permit curves. It is interesting to note that, for the(i.e. the outer edge loop) in Figure 2a. This assumption given top and front views, one typically visualizes an Ldisallows any prismatic protrusions below the base. section or some variation thereof; views 10-14 do notWhen this restriction is removed (i.e. prismatic protrusions come to mind easily. However, large crosssectional areasbelow the base that do not affect other views are allowed ), are contained in views 10, 11, 12 and 13, and the smallestthe number of solutions increases rapidly. The reader can in view 14. The algorithm can readily be adapted for thevisualize the new solids when, for example, triangular automatic detection (or generation) of solids with suchprisms are attached to the bottom face of solutions 9, geometric properties.10, 11, 12, 15 and 16 such that the top and front views User interaction, as in the case of polyhedral solidsare unaffected. (Figure 6), is helpful in the reconstruction process. The search process can then be guided to include, or exclude, certain features on the solid. Also, in the curved solidsSolids bounded by curved surfaces (see Figures 7 and 8 ), the radius for rounding and filletingThe reconstruction of curved solids from a pair of can be chosen by the user. Further, with the use oforthographic views (straight lines only ) is illustrated. The Limings method, the circular arcs can easily be replacedtop and front views have intentionally been chosen to be by other conics such as elliptical, parabolic or hyperbolicsimple. They permit the demonstration of the working arcs (see, for example, Reference 11 ).of the algorithm, and, most importantly, they show thelarge number of possible solutions. In Figures 7 and 8, SUMMARYinstead Of the complex curved solids being drawn, thetwo right views for each case, i.e. a polygonal right view An algorithm has been presented that reconstructs alland a right view with circular arcs, are illustrated. Note solids bounded by planes and quadrics that correspondthat many straight lines in the right views can further be to a pair of prespecified orthogonal views. As areplaced by curves. For example, the inclined lines / 1 in byproduct, the missing third views are also obtained. TheFigure 7b can be replaced by any one curve from the algorithm ensures completeness by considering all thefamily of conics that are tangent to 12 and 13 at the vertices candidate faces for inclusion in the solid. Consistencya and b, as long as their projection does not create an with the given views guarantees the validity of theadditional hidden line in the front view. Such valid generated solids and the correctness of the algorithm.modifications can lead to a large number of geometrically Visualization in three dimensions is a difficult task.distinct solids. Such geometric variations are not shown For complex solids, even when all three views arein Figures 7 and 8. provided, a manual reconstruction process can be very In Figure 7, the top and front views are given. The complicated. It requires the ascertaining of corre-corresponding five right views are also shown. This simple spondence between the given views, and then theexample took less than 1 s for each polygonal right view construction of the solid based on the views. Theand curved right view on the Apollo DN 4000. Note that reconstruction problem considered in this paper is morenot all views permit curves. For example, the replacement difficult, because of the combinatorial nature of theof the sharp corner in Figure 7b by any circular curve is solution brought about by the incomplete specification.not permissible if consistency with the dimensions in the The solution procedure can benefit extensively from usertop and front views is to be maintained. Figures 7e and f interaction (as in Figure 4). As a 2-view representation are similar. typically corresponds to multiple solids, the search In Figure 8, the top and front views are given. For process can be guided to exclude classes of solids that this set, the algorithm identified 14 polygonal right views the user deems unnecessary.158 computer-aided design
11.
Reconstruction of curved solids from two polygonal orthographic viewsACKNOWLEDGEMENTS 6 Preiss, K Algorithms for automatic conversion of a 3-view drawing of a plane-faced part of the 3-DThe authors thank Professor Doug Wilde of Stanford representation Comput. Industry Vol 2 (1981) ppUniversity, USA, for suggesting this problem for further 133-139study. Professor Dutta was supported in part by USNational Science Foundation Grant DDM 90-10411. Y 7 AIdefeld, B Automatic 3-D reconstruction from 2-DL Srinivas was supported by the University of Michigan, geometric part descriptions Proc. I E E E Conf.USA, Rackham Award, and by NSF Grant DDM Computer Vision & Pattern Recognition (1983) pp90-10411. 66-72 8 Sakurai, H and Gossard, D C Solid model inputREFERENCES through orthographic views Comput. Graph. Vol 17 No 3 (1983) 243-247 1 Sugihara, K Machine Interpretation o f Line Drawings MIT Press (1985) 9 Wilde, D J The geometry of spatial visualization: two problems Proc. 8th I F T O M World Congr. 2 ldesawa, M, Soma, T, Goto, E and Shihata, S Prague, Czechoslovakia (Aug 1991 ) Automatic input of line drawings and generation of solid figure from three-view data Proc. Int. Computer 10 Luzadder, W J Fundamentals o f Engineering Drawing Symp. - Vol H (1975) pp 304-311 (9th Ed.) Prentice-Hall (1986) 3 Lafue, G Recognition of three-dimensional objects il Faux, I D and Pratt, M J Computational Geometry from orthographic views Comput. Graph. Vol 10 No f o r Design and Manufacture Ellis Horwood, UK 2 (1976) (1979) p 31 4 Markowsky, G and Wesley, M A Fleshing out wire frames I B M J . Res. & Develop. Vol 24 No 5 (1980) BIBLIOGRAPHY pp 582-597 Harlick, R M and Shapiro, L G Understanding 5 Markowsky, G and Wesley, M A Fleshing out engineering drawings Comput. Graph. & Image Proc. projections I B M J. Res. & Develop. Vol 24 No 6 Vol 20 (1982) pp 244-258 (1981) pp 934-954 Lakshmi Srinivas obtainedhis bachelors degree in mechanical engineering from the Indian Institute of Technology, Madras, India, in 1989, Debasish Dutta is an assistant professor in the and his masters degree in mechanicalengineer- Design Laboratory, Department of Mech- ingfrom the University of Toledo in 1990. He is anical Engineering and Applied Mechanics, currently a doctoral student in the Design University of Michigan, USA. He obtained a Laboratory, Dept. of Mechanical Engineering PhD from Purdue University, USA, in 1989. and AppliedMechanics, Universityof Michigan, His areas of interest includegeometricmodeling, USA. His research interests includegeometric/ computational geometry in design and manu- solid modeling,motionplanning and the blending facturing automation, and descriptivegeometry. of surfaces.volume 24 number 3 march 1992 159
Views
Actions
Embeds 0
Report content