Preprint
Article

Surfaces Intersection and Flattening in 3D Models Through Computer Extended Descriptive Geometry (CeDG)

Altmetrics

Downloads

195

Views

65

Comments

0

A peer-reviewed article of this preprint also exists.

This version is not peer-reviewed

Submitted:

30 March 2023

Posted:

31 March 2023

You are already at the latest version

Alerts
Abstract
Computer extended Descriptive Geometry (CeDG) is a new approach to solve and build computer models of three dimensional (3D) geometrical systems through descriptive geometry procedures that have demonstrated reliability and accuracy. CeDG may calculate a parametric algebraic exact form for the spatial curves generated in the intersection of two surfaces, as well as of the flattened pattern of any developable surface involved in those encounters. This study presents first the theoretical foundations and methodology to calculate those parametric algebraic curves. Secondly, a compound hopper is defined and modelled through CeDG (implemented in GeoGebra) and CAD (Solid Edge 2023) approaches to evaluate the advantages of CeDG against CAD. The results demonstrate the robustness and accuracy of the CeDG technique for surfaces intersection and flattening and the advantages of CeDG against Solid Edge 2023 in solving the hopper case study.
Keywords: 
Subject: Computer Science and Mathematics  -   Computer Science

1. Introduction

Descriptive geometry (DG), a science that was systematized by Gaspard Monge in 1794, and its associated representation systems, such as the dihedral system, have determined the foundations of graphic representation in engineering since the second half of the 19th century. This discipline has a huge importance in the development of spatial vision and constitutes a fundamental pillar in university teaching, although its use in the professional field has been practically replaced by computer-aided design (CAD) software [1]. CAD technology emerged in the mid-1990s as a computer-based approach to create, modify, analyze and document 2D or 3D graphical representations of physical elements, providing an alternative to manual drafts and product prototypes. The main reason for the replacement of DG by CAD systems lies in the current wide availability of software packages capable of representing three-dimensional shapes. The geometry of the CAD model is essentially represented by curves and approximation surfaces, such as B-splines, which provide high control and accuracy [2].
The determination of the intersection between two surfaces of revolution as a problem in CAD has been around for 60 years and continues to be an active topic of research today. The main reason lies in the fact that the technique used has to balance three conflicting objectives such as accuracy, strength and efficiency [3]. The problem of intersection between surfaces involves the design of algorithms suitable for evaluating and performing geometric operations, as well as their representation. The exact requirements of the representation and algorithms depend on the particular application. Generally speaking, any representation should provide functionality to perform the operations of evaluating and rendering the intersection curve, deciding whether a point belongs to the intersection curve, organizing the points that lie on the intersection curve, and using it as the boundary edge of a trimmed surface.
The evaluation of the intersection between two rational parametric surfaces is a recurring operation in solid modelling and can be approached using algebraic sets in a higher dimensional space. Using results from elimination theory, it is possible to project the algebraic set to a lower dimensional space, using the matrix itself as the representation of the algebraic set in this space. Given this representation, properties of rectilinear programs and linear algebra results are used to perform geometric operations on the intersection curve. The accuracy of these operations can be improved by pivoting or other numerical techniques [4].
Nearly 30 years ago, the strength deficiencies shown in the methods of intersection between surfaces applied at the time [5] were being addressed. For this purpose, exact methods based on rational arithmetic (oriented to rational B-spline surfaces) began to be used, techniques that have been transferred to the usual CAD.
Subsequent studies presented a review of the problem of intersection between surfaces for CAD/CAM, also developing a new algorithm based on the geometric properties of the surfaces and their intersection curves, establishing an integration of the segmentation and tracing methods [6]. This algorithm translates the nonlinear problem of surface–surface intersection (SSI) curve finding into a series of steps for solving sets of linear equations. The starting points for the plotting are computed by a combination of numerical and subdivision techniques. In the plotting phase, the intersection curve is drawn in the direction of the combination of its tangent vector and the direction of the geodesic radius of curvature, and the size of the steps is adaptively adjusted according to the curvature of the intersection curve. Nevertheless, at the singular points, only the tangent direction was taken into account.
As an evolution of the previous methods, in [7] two hybrid models are generated for the calculation of the intersection of two Bezier surfaces, obtaining more accurate results, and therefore closer to the real solution, than using the plane/plane intersection. To calculate exactly intersection points, two marching methods were used, employing tangential or circular steps. An important difference between the two techniques lies in the step size. In the method using tangential steps, the step size must be fixed and predefined, while in the circular step method, the step size is dynamic and changes automatically. The choice of techniques to use will depend on the particular problem. If the result is twisted or sinuous, the circular pitch is recommended, otherwise, it is enough to use the tangential pitch.
A new improvement of the previous surface intersection methods is presented in [8] for surfaces based on NURBs. The results obtained in this study allow to eliminate some assumptions that were necessary to apply in the parameterization of surfaces, thus facilitating this process for two general surfaces. Finally, recent studies present new techniques targeting toroidal patches in which the intersection curve of two free-form surfaces is computed by employing a bounding volume hierarchy (BVH), where the leaf nodes contain oscillating toroidal patches [9]. The effectiveness of the technique applies, among other cases, to two nearly identical surfaces (such as Figure 7 of this article).
Computer Extended Descriptive Geometry (CeDG) constitutes a new way of undertaking computer modelling of 3D geometric systems [10], trying to offer a solution to the constraints of the current CAD systems previously pointed out [5]. As discussed, CAD tools favor the construction of virtual prototypes of 3D systems that can be manipulated in space and projected in a simple way according to the chosen representation system. Nevertheless, they do not allow the model to be generated when it depends on some implicit parameter (which can only be measured when the model is built). In addition, they still show important deficiencies in the calculation of flat patterns of sheet metal surfaces.
The CeDG approach combines the ability of DG to solve spatial geometric problems with the skill of dynamic geometry [11] in the evolution of geometric-algebraic model building. CeDG parametric models preserve the integrity of curves and surfaces, in contrast to CAD systems. A preliminary version of the CeDG approach implemented on the dynamic geometry software Geogebra [12] has proved its capability to overcome some of the above limitations [10].
The objective of this study is the development of theoretical methods for the computation of encounters between surfaces and for their flattening, based on CeDG. For this purpose, a methodology which is completely different from those presented so far will be used, not being oriented to NURBS-based surfaces.
The usual procedure used in DG to calculate the intersection between two surfaces consists of defining it by means of their projections, which are obtained through interpolation on a set of points belonging to them. The points are obtained by means of DG techniques, which are applied iteratively, so that the accuracy and complexity of the resulting curve is proportional to the number of points attained [13]. The CeDG approach uses an extension of the DG procedures, taking advantage of the existence of an exact algebraic function that defines the sought intersection curve, which represents the algebraic calculation of a general point of this curve. The algebraic function can be extracted by means of a locus function, which is automatically computed from the sequence of geometric-algebraic instructions associated with the calculation of a single generic point of the intersection [10].
This paper develops the theoretical technique that computes the intersections and flattening (first objective), which is used to solve the case study defined by a compound hopper, being its CeDG result (3D model and flat pattern) compared with the solution obtained using Solid Edge 2023 (second objective). The details of the comparison are presented in the Methods section.

2. Materials and Methods

The study follows two stages. The theoretical development of the C e D G technique for surfaces intersection and flattening is presented in the first stage. We use the parametric 3D model of an oblique cone that intersects with an oblique cylinder (Figure 1) and it is subsequently flattened, to clarify the meaning and scope of the algebraic entities and procedures involved in the novel method.
The variables and other nomenclature used in the theoretical development are defined before their first use. Notwithstanding, those terms that refer to very relevant objects are listed also in the Abbreviations section. The 3D surfaces and entities are defined by their vertical and horizontal projections.
The technique is applied in the second stage to solve the hopper defined by the projections of Figure 2, computing the surface intersections and flat patterns (flattening) of the upper duct, D u ( d u - d u ), and the lower duct, D l ( d l - d l ), and comparing them against the flat patterns obtained through Solid Edge 2023. According with the methodology pointed in Prado-Velasco and Ortiz-Marín [13] the flat pattern refers to the neutral surface (fiber) of the hopper.
The hopper is completed by a fluid duct, D f ( d f - d f ), which transports fluid towards the upper duct, and an oblique duct, D o ( d o - d o ), where aggregates (small discrete mass of coarse - medium particles) from the aggregates border, B a ( b a - b a ) go into the system. The fluid duct is a conical surface that discharges into D u through the discharge area, A d , which assuming that the system operates in steady state, may be defined through the following equation:
G = S d ρ ( r ) v ( r ) d S ( r ) = ρ d v d A d ,
in which G is the mass flow rate of fluid through D f and ρ , v and d S are the density and velocity of fluid and a differential element of area perpendicular to v at the position r in the discharge surface, S d . Thus, ρ d , v d and A d are average values of density and fluid velocity, and the area of the discharge section.
The model wants to be optimized to achieve a very fast expansion of the fluid in the last portion of the conical duct (quasi - adiabatic expansion). With that aim, the 3D model must facilitate the research on the dimensional parameters that provide a fluid expansion given by the outlet / inlet area ratio A r = A d / A i > 3 ( A i is the fluid duct inlet area). The value of A r is controlled by the D u - D f connection curve, which depends on the conicity of D f (Con) and the horizontal distance between the D f axis and v (Eccentricity), Ecc, whereas the remaining dimensions of the hopper are constant. The conicity induces a smooth increment of area, whereas the eccentricity promotes a greater surface inside the D u - D f connection curve without a gradual increment along the fluid duct.
The other hopper dimensions taken as parameters are the diameter of the inlet fluid border ( b f - b f ), D df , diameter of the upper border ( b u - b u ), D bu , diameter of the lower border ( b l - b l ), D bl , height of the lower duct with respect to its vertex, H ld , angle of fluid duct axis with respect to the vertical, α df , and the angle of oblique duct with respect to the horizontal, α do .
The discharge surface, S d , may be defined by the cylindric surface inside the warped intersection curve between surfaces D f and D u , which will be computed during the hopper modelling. According to the equation (1), the area A d may be considered perpendicular to the streamline. We are interested to perform an analysis focused on the 3D model and independent of the fluid system. Therefore, we will use the 3D hopper model to propose and compute a surrogate of A d .
We define the following three specific targets in this second stage:
  • Feasibility to reach the parametric 3D hopper’s model and the required flat patterns.
  • Application of the 3D model to achieve A r > 3 with minimum conicity through the eccentricity dimension.
  • Accuracy of the D u and D l flat patterns.
The values of model parameters were grouped in two main dimensional groups (Nom and Var) and several variations within these ones, as shown in Table 1. The parameters that are not set in this table were kept constant during the study. These are D bu = 6 m, D bl = 5 m, H ld = 7 m, α df = 65 ° and α do = 45 ° . Nonetheless, they were modified to verify that the final model responds properly to their change.
The Nom dimensions’ group refers to the parameters used during the model building. Nom 0 is the initial model, whereas Nom 1 was the model achieved for minimal conicity and A r > 3 in the second target. The Var dimensions’ group is a variant group used to test the accuracy of the model. It changes the axis of D f and D o , as well as the inlet fluid duct diameter, D df . Conicity and eccentricity were swept across a wide set of values, including quasi non-conicity (Con = 0.09) and non - eccentricity (Ecc = 0).
The advantages and limitations of the C E D G and Solid Edge 2023 approaches are evaluated through the first two targets. In order to simplify the metrics and extension of the third target, we use three key points of the intersection curves from flat patterns. Numeric precision will be limited to three decimals (mm).

3. Results

3.1. Surfaces’ intersection and flattening through locus - based parametric functions

3.1.1. Surface to surface intersections

The encounter or intersection curve between two 3D surfaces, S 1 and S 2 , C , may be defined as the set of all 3D points, P, that pertain to both surfaces ( P S 1 S 1 ).
We define S ( ω ) as collection of auxiliary surfaces that intersects both with S 1 and S 2 when the argument ω Ω , where Ω is a reference set on n for n = 1 or n = 2 . Accordingly, the point P ( ω ) = C 1 ( ω ) C 2 ( ω ) will pertain to C , for C 1 ( ω ) = S 1 S ( ω ) and C 2 ( ω ) = S 2 S ( ω ) .
If we choose a reference set Ω , such that the collection S ( ω Ω ) sweeps all the points from S 1 and S 2 , then we may set the intersection curve, C , as the set of points P ( ω ) = C 1 ( ω ) C 2 ( ω ) for ω Ω .
The projection of P ( ω ) from C onto a plane is called p σ ( ω ), in such a way that σ is the projection curve of C on that plane. As we may completely define a 3D curve from any two non-degenerated plane projections [14], we may compute the intersection curve C through their orthogonal projections on the dihedral planes, σ (horizontal) and σ (vertical).
Descriptive geometry gives algebraic procedures that solve p σ projection for any value of ω . The encapsulation of that sequence of algebraic procedures through dependent algebraic objects for the parameter ω may achieve a reliable locus entity, defining the following equation for the horizontal projection curve, σ :
L σ ( ω ) σ = locus ( p σ ( ω ) , ω Ω ) ,
where L σ is a 2D parametric function in Ω , and locus is the algebraic entity that gives the points p σ associated with the value ω Ω . The vertical projection, σ , is achieved by the same equation when the horizontal projection of P ( ω ) is substituted by the vertical projection, p σ . This method was applied successfully to build C E D G models using GeoGebra as dynamic geometry software [10].
Figure 3 presents the computation of the intersection between an oblique cone with an oblique cylinder using this method. They are defined by their circular sections with an horizontal plane (bases) and their axis. The vertical contour of the cone has been added to facilitate the interpretation.
We select the collection S ( ω ) of planes that contain the cone vertex, v’ - v, and a line parallel to the cylinder axis, called r’ - r. As the incidence of this plane onto the horizontal plane is the h’ - h point, a plane from this collection may be defined through the s’ - s horizontal line, as shown in Figure 3. The line must intersect the two circular bases to assure that S ( ω ) intersects the two surfaces. The lines h - PLI and h - PLS define the boundary planes of this collection for the relative position of the surfaces. These lines must be tangents to any of the circular bases. This manner, the PLS point is computed as PLS = If(y(1)<y(3) then point 1 else point 3), where 1 and 3 are presented in Figure 3 and y is the vertical coordinate. A similar condition with points 2 and 4 defines the PLI point. This conditional logic attends any relative position of these oblique surfaces.
We have defined ω as the angle γ P between lines s and h - PLS (9.8° in the figure). Therefore the reference set, Ω , is the interval [0, γ Px ], where γ Px is the angle between lines PLI - h - PLS (12.8° in the figure).
A general plane S ( ω ) intersects in two generatrix lines ( C 1 ( ω ) ) for the cylinder and other two for the cone ( C 2 ( ω ) ), which intersects to gives four intersection points ( P i ( ω ) = C 1 ( ω ) C 2 ( ω ) , i = 1 , 2 , 3 , 4 ), from C , as shown in Figure 3 (ac’ - ac, bc’ - bc, ad’ - ad, bd’ - bd) . The constructive procedure is shown. Therefore, the vertical projection of C , σ , is given by the following four leaves parametric curve:
σ L σ ( ω ) = locus ( { a c , b c , a d , b d } , ω Ω )
The leaves of σ have been emphasized through alternating colours (see Figure 3). The horizontal projection of C , σ , is also a four - leaves parametric curve given by
σ L σ ( ω ) = locus ( { a c , b c , a d , b d } , ω Ω )
Figure 4. Projection curves of cone - cylinder intersection (penetration) in a C E D G model.
Figure 4. Projection curves of cone - cylinder intersection (penetration) in a C E D G model.
Preprints 70356 g004
Reducing the distance between the centers of circular bases, o - o 2 , the bite between surfaces changes to a penetration of the cylinder into the cone, as shown in Figure 4. The boundary planes are now both tangent to the cylinder bases (PLS is 3 and PLI is 4). The intersection curve splits into two separates pieces, that are defined by the L σ ( ω ) parametric curve of equation (3) for the vertical projection and L σ ( ω ) of equation (4) for the horizontal projection.
An interesting property of this technique is that it keeps the geometric integrity of the intersection curve (i.e. these curves are not approximations but the true algebraic object). As Figure 3 and Figure 4 illustrate, it may be implemented in dynamic geometry tools through the graphical entities associated with the descriptive geometry’s algebraic objects. The input surfaces are not limited to ruled or quadric surfaces, but to smooth surfaces for which some computable auxiliary surface produces low complexity intersection curves. Most technical surfaces fulfil with these requirements.

3.1.2. Surface flattening

Ruled single curvature surfaces can be flattened without deformation. Here we present a locus based technique that gives the exact flat transformed of any 3D curve in this type of surfaces. It has been implemented in GeoGebra as part of the built-in features of C E D G .
The flat transformation of a curve C that pertains to a ruled single curvature surface, S , may be formally computed by means of a two-stage procedure. First, a generic generatrix line of S , g, that contains a point P C is transformed to the flat domain. This transformation is equivalent to the placement of a line in the flat domain. Secondly, the point P is transformed to the flat domain, that is, it is placed onto the g transformed. This two-stage procedure defines a sequence of dependent algebraic objects, which builds the locus entity that defines the flat transformed of C through a parametric function. Figure 5 shows a scheme of this process for a cylinder and a cone, both oblique with generic directrix.
In the case of a cylinder (Figure 5 - left), we must intersect it with a plane perpendicular to the axis, to give the section σ . The flat transformed of σ is the R straight line, perpendicular to transformed generatrix lines. We may use any generatrix line as reference in the flat domain, as shown in Figure 5 (dashed line). Then, defining p σ σ as a parameter, it is transformed to f R ( p σ ) onto R, assuring the invariance of lengths of transformed paths. That is, the distance between f R ( P σ ) and f R ( p σ 0 ) is equal to the length of σ between P σ and P σ 0 . The flat transformed of the generatrix line through p σ is parallel to the reference one. The function f R converts its argument from σ into the transformed in R.
Finally, the flat transformed of P A A in the cylinder is P π , which pertains to the flat transformed of its generatrix line, with a distance between P π and f R ( P σ ) equal to the distance between P A and P σ .
Considering that descriptive geometry provides mathematical procedures to achieve the invariance conditions and manipulate the 3D space through algebraic objects, the flat transformed of A , π , may be computed as:
π L π ( ω ) = locus ( P π ( f R ( ω ) ) , ω Ω ) ,
where L π is a 2D parametric function of ω = P σ σ , Ω is a subset of σ that defines the cylinder piece to be flattened, and P π ( f R ( ω ) ) is a point of π defined by the generatrix line through f R ( ω ) .
In the case of an oblique cone as surface S to be flattened (Figure 5 - right), we first intersect this surface with a sphere centered in cone’s vertex (V) to obtain a warped curve in S , A , which is called support curve. We know that the flat transformed of A is a circular arch (D) with the radius of the sphere. The flat transformed of P A A is f D ( P A ) D , with a distance to the reference point f D ( P A 0 ) along D equal to the distance of P A to P A 0 along A (see Figure 5). The flat transformed of a generatrix line through P A A contains the flat transformed of vertex ( V ref is placed together with the reference generatrix line) and f D ( P A ) .
The flat transformed of P C C in the cone is P τ , which pertains to the flat transformed of its generatrix line, with a distance between P τ and f D ( P A ) equal to the distance between P C and P A . Under the same consideration of equation 5, the flat transformed of C ( τ ) may be computed as:
τ L τ ( ω ) = locus ( P τ ( f D ( ω ) ) , ω Ω ) ,
where L τ is a 2D parametric function of ω Ω , such that the generatrix line through ω contains P A , and Ω is a plane section of the cone that facilitates the algebraic manipulation of this surface.
The variable ω Ω may be substituted by other variable t ω T , if there exists any mapping function between Ω and T .
The computation of the distance from P A to P A 0 along A is not trivial since A is a warped curve with a geometry that depends on the conical surface. We use the flat transformed of A as pertaining to a cylinder, taking advantage of the invariance of lengths during the flat transformation.
This method for surface flattening is applied to the conical surface intersected with the cylinder (bite) from the previous C E D G model, between two selected generatrix lines, as presented in Figure 6.
According to our nomenclature, projections are presented in lowercase, whereas flat transformations are in uppercase (excepting for Greek symbols). In Figure 6, ω R is a point in Ω , which is the circular arch from r B to r A in the circular base of the conical surface (plane section). It is defined as ω R = Point(circular base, t ω R ), where t ω R is a real parameter in T = [ 0 , 1 ] and Point is the mapping function between Ω and T .
The generatrix line through ω R intersects to the sphere (radius equal to segment v’ - r A ) in p AR - p AR . Accordingly, p AR pertains to the horizontal projection of the support curve A , which is calculated through equation (2) using ω c in the circular base, defined between r A and ω R . Therefore, the horizontal projection of A between r A and ω R is locus( p Ac , ω c ) (orange horizontal projection).
We define a right cylinder from the horizontal projection of A (bottom base) to the support curve (warped) A . The flat transformed of A as a curve of the cylinder is π , which is shown in Figure 6 (upper - right). According to the equation (5), π is defined as locus( P AR , t ω R ). The distance between r A and p ARL in the horizontal projection of A is computed through Perimeter(locus) command.
The distance between R A and P AR along D (circular arch in cone flat domain, Figure 6 bottom - right) must be equal to the distance between R A and P AR along π curve, which is known. Therefore, P AR in D and its associated generatrix line through ( ω R ) may be placed in the flat domain. The flat transformation of the cone base through R A to R B may be computed as locus(( ω R ), t ω R ), according equation (6). Finally, the flat transformation of the cone - cylinder intersection inside the flat pattern is defined by two parametric functions: locus( ω R F, t ω R ) and locus( ω R E, t ω R ), since ω R f’ - ω R f and ω R e’ - ω R e are the intersections of the generatrix line through ω R with the cylinder.
The C E D G model updates dynamically to changes of the parameters, what includes the modification of the intersection. This manner, if we reduce the distance between the centers of circular bases o - o 2 , as was performed in Figure 4, the bite will change to penetration, splitting in two pieces, and the flat pattern dynamically changes to give what shows Figure 7. It must be noted that we have also moved r B to increase the cone surface that is flattened.
Figure 7. Cone surface intersected with cylinder (penetrated, Figure 4) flattened between generatrix lines through r A and r B .
Figure 7. Cone surface intersected with cylinder (penetrated, Figure 4) flattened between generatrix lines through r A and r B .
Preprints 70356 g007

3.2. Hopper’s CeDG modelling

The Figure 8 shows the D u - D f connection, calculated according with the technique presented in Section 3.1.1.
We set a collection S ( ω ) of auxiliary planes through the cone vertex (fluid duct) and parallel to the axis of the upper duct (vertical). The argument ω is a point in the circular base of the upper duct, between p 3 and p 4 ( Ω is that circular arch). The auxiliar plane from S ( ω ) with ω Ω intersects to the fluid duct in two generatrix lines, C 1 ( ω ) , and to the upper duct in a generatrix line (at the inlet side), C 2 ( ω ) . These generatrix lines intersect themselves to give the points P 1 and P 2 through their projections. As seen, the horizontal projection is p 1 = p 2 = ω , whereas de vertical projection are p 1 and p 2 .
Therefore, the D u - D f connection curve is given by the parametric functions locus( p 1 , ω ) and locus( p 2 , ω ) (vertical projection, two - leaves), and locus( ω , ω ) = Ω (horizontal projection, one leaf).
The intersection curve D l - D o is presented in Figure 9. It has been calculated using a collection of horizontal planes with heights from the low border, b l , to the height of Q 5 , as shown. This manner, we define ω = z h (pointed out in figure) and Ω = [ z ( b l ) , z ( q 5 ) ] . C 1 ( ω ) and C 2 ( ω ) are now circles that intersect in q 1 and q 2 (horizontal projection), and q 1 = q 2 (vertical projection), and thus the intersection curve is given by the parametric functions locus( q 1 , z h ) = locus( q 2 , z h ) (vertical projection, one leaf), and locus( q 1 , z h ) - locus( q 2 , z h ) (horizontal projection, two-leaves).
The D l - D o connection curve is warped despite its horizontal projection seems elliptic.
Once the connection curves are defined in our C E D G model, the upper and lower ducts may be flattened. The flat pattern of the upper duct has been calculated as indicated in Figure 10. The section perpendicular to the axis of the cylinder is projected as the b u circle in the horizontal plane. We have taken the generatrix line through A (a’ - a) as reference in the flat domain. We define the Ω subset of the b u circular section as the circular arch from p 3 to p 4 , which set the boundaries where the D f cone intersects with D u (Figure 10). The generatrix line through the point ω Ω intersects the D u - D f connection in two points, p 1 and p 2 , with horizontal projections p 1 = p 2 = ω . Then, they may be transformed to the flat domain thanks to the transformation length invariance to give P 1 and P 2 .
We can apply now the equation (5) according to the surface flattening technique, which solves the flat transformation of the D u - D f connection curve as the parametric functions locus ( P 1 , ω ) and locus ( P 2 , ω ) with ω = p 1 = p 1 (two leaves).
Figure 10 (right) also shows several relevant points within the intersection curve whose positions with respect A are used to verify the accuracy of the flat transformed. These area P M and P m , with maximum and minimum height, P 3 and P 4 , associated with the curve’s boundary limits, and P 6 and P 5 (which are defined below), will be used to compute A r .
The lower duct, D l , is a cone that is flattened according to equation (6). The process is presented in Figure 11, including the final flat pattern (right). As D l is a revolution circular cone, we have selected the sphere that generates the cone border, b c - b c , as support curve A . We use again the point A (a’ - a) to set the reference generatrix line, which facilitates the patterns’ junction. As A is a flat curve, it may be also used as plane section and then Ω = A . Defining the point q (horizontal projection) from Ω , it may be transported to the flat transformed of A , D, keeping the length between its transformed, Q, and A (reference) along D, as shown. The intersection of the generatrix line through q with the D l - D o connection curve is q 3 - q 3 , which it is transported to the flat domain to deliver Q 3 (keeping the distance V - Q 3 ). Therefore, the D l - D o flat pattern is given by the parametric function locus ( Q 3 , q ) .
The model solution also shows Q 4 , which is the intersection of the reference generatrix line with the D l - D o connection curve, and its highest point, Q 5 , which will be used subsequently in the comparative analysis against the CAD model. These points have been computed in the hopper projections, using the associated generatrix lines from D o and D l , and transformed to the flat domain.
Table 2 presents the coordinates of the selected relevant points within the intersection curves flat patterns for each set of hopper dimensions’ values.
The C E D G model of the hopper was visually inspected to propose a surrogate of the discharge area of the fluid duct ( A o ) that avoids a more complex computation in agreement with methods requirements (see Materials and Methods section). Figure 12a shows the connection curve D u - D f after two sequential rotations ( ϕ ev and ϕ eh with axis through D f vertex perpendicular to dihedral planes) in a position where the internal segment P 5 - P 6 (pertaining to a generatrix from D u that encounters with the D f contour generatrices in Figure 8) is parallel to the vertical projection plane. It is clear that the second internal segment P 3 - P 4 is approximately perpendicular to the first one. The product of the lengths of these segments is the area of a rectangular surface that keeps approximately perpendicular to the average streamline. Accordingly, we decided to define A o = P 5 P 6 ¯ · P 3 P 4 ¯ . The last column in Table 2 shows the outlet / inlet area ratio, A r , in the fluid duct.
For the values of dimensions used during the model building ( Nom 0 , see Table 1), P 3 P 4 ¯ = 3.320 m, P 5 P 6 ¯ = 3.339 m, and thus A o = 11.085 m2. The inlet area is A i = π D df 2 / 4 = π m 2 , and then A r = 3.529. Although the area ratio is greater than 3 as wished, the conicity could be reduced.
The value A r as a function of the conicity, Con, and the eccentricity, Ecc, of the fluid duct is computed by the C E D G model and presented in Figure 12b. The values of conicity greater or equal than 0.25 are marked in red. The point marked in that plot achieves a A r value slightly greater than 3 (3.024) with 1.66 m of eccentricity and a minimum value of conicity (0.09). Although, it is possible to reduce even more the conicity, the sensitivity of A o to errors in the hopper’s dimensions increases excessively. Therefore, we select Con = 0.09 and Ecc = 1.66 m as design parameters ( Nom 1 dimensions’ group).
The C E D G model of the hopper associated with the Nom 1 design dimensions is presented in Figure 13.

3.3. Hopper’s CAD modelling

Figure 14 shows the D u - D f connection. Both bodies were modelled with the support of the 3D CAD solid modelling software, parametric features and synchronous technology Solid Edge 2023. We have made use of the protrusion command in the solids module to model both the cylinder and the truncated cone. In the case of the latter, a demolding operation has also been added to ensure the desired conicity in each case. Once the two solids were created, a thickness of 0.0001 mm was applied because Solid Edge 2023 does not allow to work with the neutral surface (fiber) of the hopper, as indicated in the methodology pointed out in Prado-Velasco and Ortiz-Marín [13] and the minimum thickness value allowed by this software is the one indicated above.
In Figure 15, D u cylinder is shown together with the intersection curve between it and the previous D f straight truncated cone. To obtain this part of the our whole 3D model in such a way that its flat pattern could be computed, we need to proceed as follows. First of all, the solid cylinder was created with the protrusion command and then a thickness of 0.0001 mm was applied. As it was said before, this is the minimum value allowed by the computer application. Next, a conical cut was applied with the characteristics of the D f duct, thus obtaining the cylinder together with the intersection curve produced by the truncated cone.
Subsequently, it was necessary to make a tiny cut in the lateral surface of the cylinder to generate a slot and be able to open the solid (see it at Figure 15). This is a fundamental condition if the solid cylinder is required to be converted into sheet metal module. Once the slot is created, it is possible to access the tools command and select the icon Convert into sheet metal part. Finally, by selecting the flat pattern button in the tools tab, the flat pattern of the cylinder together with the conical encounter of the D f duct is obtained, as shown in Figure 16 that was obtained by using Solid Edge’s draft module. The spatial points indicated are the same as those selected in the C E D G model. Models of Figure 14, Figure 15 and Figure 16 correspond to the Nom 1 design dimensions.
The intersection curve D l - D o is presented in Figure 17. As in the case of the preceding cylinder, both bodies were modelled with the Solid Edge 2023 solids module. The truncated straight cone was generated with the protrusion by revolution command whereas the oblique cylinder was created by using the protrusion sweep command. Then, a thickness of 0.0001 mm was applied.
The D l truncated cone was processed in a similar manner than D u with the aim of solving its flat pattern. The protrusion by revolution command was used to generate the truncated cone, to which was subsequently made a swept hollowing with the same characteristics as D o oblique cylinder in order to generate on it the intersection curve produced by this cylinder, as shown in Figure 18. After applying a thickness command of 0.0001 mm, a tiny lateral slot was achieved to the truncated cone in order to open the lateral surface for subsequent application of the sheet metal module. Nevertheless, it was not possible to find a generatrix that would allow that flattening under the bite with the oblique cylinder.
We tried to use the Sheet Metal Body in Rough command to check if this option could work. After performing several tests, we concluded that the D l duct can only be flattened when the intersection with D o is a penetration (two holes) in opposition to a bite (one more complex hole). The Solid Edge surface module was also tested without success because it cannot compute the D l flat pattern.
Therefore, Table 3 has been created with the available information, in which the coordinates of the selected relevant points within the flat patterns of the intersection curves for each set of hopper values are presented together with the values of the outlet (discharge) / inlet area ratio, A r , in the D f fluid conduit. We use the same surrogate of the discharge area than in C E D G model, to facilitate the comparison.
The obtained values are very similar to those calculated using the C E D G technique, as expected. Notwithstanding, we could not apply the 3D model from Solid Edge to extract the function A r as a function of the eccentricity and conicity, either others parameters.
Finally, the Solid Edge model of the hopper associated with the Nom 1 design dimensions is presented in Figure 19.

4. Comparative analysis and discussion

According to the results obtained Solid Edge could not complete the hopper modelling. In addition, this CAD tool does not provide an easy method to compute and evaluate A r , as a function of eccentricity and conicity of our 3D hopper. The comparison for each specific target of the second stage of our study (Methods) were as follows.
  • Feasibility to reach the required models. The 3D model of the hopper, which include the ducts connections were properly obtained both in C E D G and CAD, as shown in Figure 13 and Figure 19. Nonetheless, Solid Edge 2023 was not able to compute the flat pattern of the lower duct (truncated cone) because this duct encounters to the oblique cylindrical duct with an intersection of bite type. We used different strategies, as described in the Results section, without success.
  • Once the 3D models were computed, we tried to use them for the analysis of the influence of the geometrical parameters in the outlet / inlet area ratio of the fluid duct, A r , and finally for the optimization of the hopper to achieve A r 3 in a fast expansion. The C E D G model allowed a visual inspection of the fluid duct - upper duct connection through spatial rotation, as well as the plotting and quantitative computation of the relationship between A r and any geometrical parameter of the 3D system. We used this feature to plot A r (Ecc, Con) and select the design values Ecc = 1.66 m and Con = 0.09 (Figure 12b). In opposition, the model computed with Solid Edge 2023 does not provide a direct manner to extract the A r function.
  • With respect to the accuracy, the comparison between Table 2 and Table 3 shows that the position of P 3 - P 4 (boundary points) in the flat pattern had relative deviations lesser than 0.01 %. In the case of P m and P M , z relative deviations were lesser than 0.02 %, whereas y relative deviations were lesser than 3.9 %. The relative deviations between A r values were lesser than 0.6 % with the exception of the value for Nom 0 dimensions’ group which was 8.7 %. Values greater than 5 % occurred in those cases where a manual selection of some 3D object were needed. We conclude that the accuracy was high in both models.
The fail of Solid Edge 2023 to achieve the flat pattern of a particular surfaces’ configuration agrees with other comparative studies [13]. Although a more complete analysis of this lack exceeds the scope of this paper, the strategy of current CAD technology for surfaces’ flattening seems limited to a set of configurations previously defined in the software. This approach is clear in some CAD tools focused on sheet metal such as LogiTRACE v14.
As a consequence, our results validate the reliability and accuracy of the new theoretical method presented to compute surfaces intersections and their flattening. This method takes advantage of the mathematical procedures of descriptive geometry and extend them by means of a locus algebraic equation, within the novel C E D G approach. The integrity of geometrical objects (i.e. handle without approximation) that characterizes C E D G [10,13] is kept also in this method.
To the best of our knowledge, C E D G is the first approach of computer parametric 3D modelling based on an extension of descriptive geometry supported by the locus algebraic concept. C E D G is implemented in a software of dynamic geometry, which gives a technology different than the technology of current CAD systems. Others studies about 3D geometrical modelling have used the locus concept with a different goal. For instance, Gao et al. [15] uses the locus as a mathematical technique to solve some geometrical issues, like the geometric constraints problem that appear frequently in parametric CAD and other domains, and Oprea and Ruse [16] addressed the computation of some loci problems through descriptive geometry tools.
Other studies have tried to recover the interest in applying the locus concept to CAD software tools. This is the case of the study from Rojas-Sola et al. [17] that improved the set of available resources to build sketches by incorporating a locus tool to several geometrical cases, and implemented in Adobe Authorware v7 (e-learning authoring tool with a graphical programming language that was officially discontinued in 2007). A more recent study has advanced in that research line by implementing an algorithm to solve relevant loci cases, which was designed for educational use [18]. Certainly, the study of new mathematical algorithms that improve the locus equation computations is a ongoing research line on industrial and research [19].
Although C E D G is a computer parametric 3D approach designed for both educational and professional domains, it is still immature for the professional domain and it requires more research to improve the usability, computational efficiency, and capability to interact with other CAD tools. Concerning the GeoGebra implementation, although the Locus command gives the true parametric algebraic functional locus associated with a 2D point that has a complex dependency on the others mathematical objects, it cannot be used as a general 2D algebraic object and the measurement of lengths along it has limitations [12]. These issues define the ongoing research lines.

Author Contributions

Conceptualization, M.P.V. and L.G.R.; methodology, M.P.V.; software, M.P.V. and L.G.R.; validation, M.P.V. and L.G.R.; investigation, M.P.V. and L.G.R.; resources, M.P.V. and L.G.R.; writing—original draft preparation, M.P.V. and L.G.R.; writing—review and editing, M.P.V. and L.G.R.; supervision, M.P.V. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No datasets were created, but the C E D G and Solid Edge 2023 models are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

S i Data surfaces for i = 1 , 2
C Curve in 3D space
A B ¯ Distance between A and B points
A (a’ - a) Spatial (3D) object (vertical projection - horizontal projection)
P y horizontal distance between P and right A points in flat pattern (Figure 10)
P z vertical distance between P and right A points in flat pattern (Figure 10)
C E D G Computer extended Descriptive Geometry

References

  1. Weisberg, D.E., Computer-Aided Design Strong Roots at MIT. In The Engineering Design Revolution:The People, Companies and Computer Systems That Changed Forever the Practice of Engineering; http://cadhistory.net/, 2008; book section 3, p. 650.
  2. Manni, C.; Pelosi, F.; Sampoli, M.L. Generalized B-splines as a tool in isogeometric analysis. Computer Methods in Applied Mechanics and Engineering 2011, 200, 867–881. [Google Scholar] [CrossRef]
  3. Xiaohong, J.; Kai, L.; Jinsan, C. Computing the Intersection of Two Rational Surfaces Using Matrix Representations. Computer-Aided Design 2022, 150. [Google Scholar]
  4. Manocha, D.; Canny, J. A new approach for surface intersection, 1991. [CrossRef]
  5. Patrikalakis, N.M. Surface-to-surface intersections. IEEE Computer Graphics and Applications 1993, 13, 89–95. [Google Scholar] [CrossRef]
  6. Li, X.; Jiang, H.; Chen, S.; Wang, X. An efficient surface–surface intersection algorithm based on geometry characteristics. Computers & Graphics 2004, 28, 527–537. [Google Scholar] [CrossRef]
  7. Dejdumrong, N. The Determination of Surface Intersection Using Subdivision and Polyhedron Intersection methods, 2010.
  8. Busé, L.; Luu Ba, T. The surface/surface intersection problem by means of matrix based representations. Computer Aided Geometric Design 2012, 29, 579–598. [Google Scholar] [CrossRef]
  9. Park, Y.; Son, S.H.; Kim, M.S.; Elber, G. Surface–Surface-Intersection Computation Using a Bounding Volume Hierarchy with Osculating Toroidal Patches in the Leaf Nodes. Computer-Aided Design 2020, 127. [Google Scholar] [CrossRef]
  10. Prado-Velasco, M.; Ortíz Marín, R.; García, L.; Rio-Cidoncha, M.G.D. Graphical Modelling with Computer Extended Descriptive Geometry (CeDG): Description and Comparison with CAD. Computer-Aided Design and Applications 2021, 18, 272–284. [Google Scholar] [CrossRef]
  11. Kortenkamp, U. Foundations of Dynamic Geometry. Thesis, 1999.
  12. Hohenwarter, J.; Hohenwarter, M. Geogebra Classic Manual (https://wiki.geogebra.org/en/Manual), 2019.
  13. Prado-Velasco, M.; Ortiz-Marín, R. Comparison of Computer Extended Descriptive Geometry (CeDG) with CAD in the Modeling of Sheet Metal Patterns. Symmetry 2021, 13, 685. [Google Scholar] [CrossRef]
  14. Leighton Wellman, B. Geometría Descriptiva [Technical Descriptive Geometry]; Editorial Reverté, S.A., 1987; p. 615.
  15. Gao, X.S.; Hoffmann, C.M.; Yang, W.Q. Solving spatial basic geometric constraint configurations with locus intersection. Computer-Aided Design 2004, 36, 111–122, Citado por el impresentable reviewer 2 de GMOD. [Google Scholar] [CrossRef]
  16. Oprea, G.; Ruse, G. A descriptive approach of intersecting geometrical loci - the cylinder case. U.P.B. Sci. Bull., Series D 2006, 68, 81–88. [Google Scholar]
  17. Rojas-Sola, J.I.; Hernández-Díaz, D.; Villar-Ribera, R.; Hernández-Abad, V.; Hernández-Abad, F. Computer-Aided Sketching: Incorporating the Locus to Improve the Three-Dimensional Geometric Design. Symmetry 2020, 12. [Google Scholar] [CrossRef]
  18. Hernández-Díaz, D.; Hernández-Abad, F.; Hernández-Abad, V.; Villar-Ribera, R.; Julián, F.; Rojas-Sola, J.I. Computer-Aided Design: Development of a Software Tool for Solving Loci Problems. Symmetry 2022, 15. [Google Scholar] [CrossRef]
  19. Kovács, Z.; Pech, P. , Experiments on Automatic Inclusion of Some Non-degeneracy Conditions Among the Hypotheses in Locus Equation Computations. In Intelligent Computer Mathematics; Lecture Notes in Computer Science, 2019; book section Chapter 10, pp. 140–154. [CrossRef]
Figure 1. Cone - Cylinder intersection for theoretical development (first stage).
Figure 1. Cone - Cylinder intersection for theoretical development (first stage).
Preprints 70356 g001
Figure 2. Hopper defined through its projections (second stage).
Figure 2. Hopper defined through its projections (second stage).
Preprints 70356 g002
Figure 3. Projection curves of cone - cylinder intersection (bite) in a C E D G model.
Figure 3. Projection curves of cone - cylinder intersection (bite) in a C E D G model.
Preprints 70356 g003
Figure 5. Flattening transformation with generatrix lines mapping.
Figure 5. Flattening transformation with generatrix lines mapping.
Preprints 70356 g005
Figure 6. Cone surface intersected with cylinder (bite, Figure 3) flattened between generatrix lines through r A and r B .
Figure 6. Cone surface intersected with cylinder (bite, Figure 3) flattened between generatrix lines through r A and r B .
Preprints 70356 g006
Figure 8. Modelling of D u - D f connection curve.
Figure 8. Modelling of D u - D f connection curve.
Preprints 70356 g008
Figure 9. Modelling of D l - D o connection curve.
Figure 9. Modelling of D l - D o connection curve.
Preprints 70356 g009
Figure 10. Flat pattern of upper duct ( D u ).
Figure 10. Flat pattern of upper duct ( D u ).
Preprints 70356 g010
Figure 11. Flat pattern of lower duct ( D l ).
Figure 11. Flat pattern of lower duct ( D l ).
Preprints 70356 g011
Figure 12. Visual inspect of the fluid duct connection (a) and numerical relation of its area section, A r , as a function of eccentricity (abscissa) and conicity (0.09 - 0.25 in blue, 0.27 - 0.35 in red, increments of 0.02) (b).
Figure 12. Visual inspect of the fluid duct connection (a) and numerical relation of its area section, A r , as a function of eccentricity (abscissa) and conicity (0.09 - 0.25 in blue, 0.27 - 0.35 in red, increments of 0.02) (b).
Preprints 70356 g012
Figure 13. Final design of the hopper through the C E D G model.
Figure 13. Final design of the hopper through the C E D G model.
Preprints 70356 g013
Figure 14. Modelling of the D u - D f ducts system.
Figure 14. Modelling of the D u - D f ducts system.
Preprints 70356 g014
Figure 15. Modelling of the D u duct with the D f connection curve.
Figure 15. Modelling of the D u duct with the D f connection curve.
Preprints 70356 g015
Figure 16. Flat pattern of the D u cylinder together with the intersection curve produced by the D f truncated cone.
Figure 16. Flat pattern of the D u cylinder together with the intersection curve produced by the D f truncated cone.
Preprints 70356 g016
Figure 17. Modelling of the D l - D o ducts system.
Figure 17. Modelling of the D l - D o ducts system.
Preprints 70356 g017
Figure 18. Modelling of the D l duct with the connection curve.
Figure 18. Modelling of the D l duct with the connection curve.
Preprints 70356 g018
Figure 19. Final design of the hopper through the Solid Edge model.
Figure 19. Final design of the hopper through the Solid Edge model.
Preprints 70356 g019
Table 1. Dimensions’ groups values (meters) for 3D model C E D G - CAD comparison.
Table 1. Dimensions’ groups values (meters) for 3D model C E D G - CAD comparison.
Dim. group Con Ecc D df α df α do
Nom 0 0.27 0.6 2 65° 45°
Nom 1 0.09 1.66 2 65° 45°
Var 0 0.5 1.11 0.5 50° 52°
Var 1 0.5 0 0.5 50° 52°
Var 2 0.09 2.43 0.5 50° 52°
† Dimensionless. ‡ Sexagesimal degrees.
Table 2. Coordinates of selected points of flat patterns from upper and lower duct (m) and A r ratio, computed with C E D G for each dimensions’ groups.
Table 2. Coordinates of selected points of flat patterns from upper and lower duct (m) and A r ratio, computed with C E D G for each dimensions’ groups.
Dim. group P 3 y P 3 z P 4 z P my P mz P My P Mz Q 5 g Q 5 α A r
Nom 0 3.487 3.275 3.691 1.979 1.563 1.633 4.921 5.440 51.728° 3.259
Nom 1 3.657 3.147 4.269 2.656 2.016 1.637 4.777 5.440 39.679° 3.024
Var 0 3.478 2.276 4.010 2.554 0.972 0.977 4.268 7.464 44.246° 56.361
Var 1 2.287 2.476 2.476 1.124 0.881 1.098 3.668 7.464 62.302° 31.696
Var 2 2.110 2.642 4.177 1.901 2.320 0.963 4.227 7.464 38.599° 15.825
† Dimensionless. ‡ Sexagesimal degrees.
Table 3. Coordinates of selected points of flat patterns from upper duct (m) and A r ratio, computed with Solid Edge 2023 for each dimensions’ groups.
Table 3. Coordinates of selected points of flat patterns from upper duct (m) and A r ratio, computed with Solid Edge 2023 for each dimensions’ groups.
Dim. group P 3 y P 3 z P 4 z P my P mz P My P Mz Q 5 g Q 5 α A r
Nom 0 3.487 3.275 3.691 2.022 1.563 1.675 4.921 - - 3.543
Nom 1 3.658 3.147 4.270 2.666 2.015 1.632 4.777 - - 3.003
Var 0 3.478 2.276 4.009 2.551 0.971 0.981 4.268 - - 56.618
Var 1 2.287 2.476 2.476 1.143 0.881 1.143 3.669 - - 31.694
Var 2 2.111 2.642 4.177 1.831 2.312 0.761 4.228 - - 15.930
† Dimensionless. ‡ Sexagesimal degrees.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated