Next Article in Journal
Water Pumping and Refilling (WPR): A Resource Allocation Algorithm for Maximizing Acceptance Ratio in Asymmetrical Edge Computing Networks
Next Article in Special Issue
The Place of Descriptive Geometry in the Face of Industry 4.0 Challenges
Previous Article in Journal
Absolute Structure Determination of Chiral Zinc Tartrate MOFs by 3D Electron Diffraction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Intersection and Flattening of Surfaces in 3D Models through Computer-Extended Descriptive Geometry (CeDG)

by
Manuel Prado-Velasco
* and
Laura García-Ruesgas
Department of Engineering Graphics, University of Seville, 41092 Seville, Spain
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(5), 984; https://doi.org/10.3390/sym15050984
Submission received: 30 March 2023 / Revised: 17 April 2023 / Accepted: 21 April 2023 / Published: 26 April 2023

Abstract

:
Computer-extended Descriptive Geometry (CeDG) is a new approach to solving and building computer models of three-dimensional (3D) geometrical systems through descriptive geometry procedures (thus inheriting invariant-symmetry properties from projective geometry) that have demonstrated reliability and accuracy. CeDG may calculate a parametric implicit functional 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 first presents the theoretical foundations and methodology to calculate those curves. Secondly, a compound hopper is defined and modeled 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 he intersection and flattening of surfaces and the advantages of CeDG against Solid Edge 2023 in solving the hopper case study.

1. Introduction

Descriptive geometry (DG), which inherits the invariant-symmetry properties of projective geometry, is 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 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 initial 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 subsequent evolution of CAD gives tools to model very complex surfaces through Non-Uniform Rational B-Splines (NURBSs) such as, for instance, those that define a human vascular system [3], overcoming the scope of DG.
The determination of the intersection between two surfaces has been a problem in CAD for around 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, accuracy, strength and efficiency [4]. 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 modeling 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 onto 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 [5].
Nearly 30 years ago, the strength deficiencies shown in the methods of intersection between surfaces applied at the time [6] 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 reviewed 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 [7]. This algorithm translates the nonlinear problem of finding the surface–surface intersection (SSI) curve into a series of steps for solving sets of linear equations. The starting points for the plotting are computed using 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 [8], two hybrid models were generated for the calculation of the intersection of two Bezier surfaces, obtaining results that are more accurate and therefore closer to the real solution than using the plane/plane intersection. Two matching methods were used to calculate exactly the intersection points, 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 to the previous surface intersection methods was presented in [9] for surfaces based on NURBS. The results obtained in this study allow some assumptions to be eliminated 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. The effectiveness of the technique applies, among other cases, to two nearly identical surfaces ([10], Figure 7).
Computer-Extended Descriptive Geometry (CeDG) constitutes a new way of undertaking computer modeling of 3D geometric systems [11], trying to offer a solution to the previously identified constraints of the current CAD systems [6]. 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 [12] in the building of geometric-mathematical models. A CeDG model is a flat sequence of mathematical entities that may be associated with graphical objects in a one-to-one relationship. The entities consist first of 2D primitive objects (point and lines), and other 2D curves, which combine themselves to produce projections of 3D objects according to DG. Any entity in the CeDG model keeps mathematical dependencies with other previously built entities. In this manner, any change in an entity’s parameter propagates to the dependent entities in a dynamic manner, ensuring the consistency of the model. The model is completed with a second collection of mathematical entities that implements mathematical procedures from DG and physical relationships that could be required (e.g., forces equilibrium applied to a system).
The CeDG modeling is implemented in a dynamic geometry system working under the deterministic condition (in opposition to continuous), to extend the mathematical procedures of DG with the aim of describing the projections of 3D curves through implicit parametric functions. To the best of our knowledge, this is the first approach that uses the DG procedures to build parametric computer 3D models in a manner that exploits the body of knowledge of DG, which includes the preservation of the integrity of curves and surfaces, in contrast to CAD systems. The CeDG approach gives a response to the need for DG in the world of 3D modeling [13], which is opposed to the opinion that DG is dead Ortiz-Marín et al. [14].
The underlying concepts of CeDG appeared in the PhD thesis of Wottreng [15], although the research was limited to the analysis of the influence of the developments of Gaspard Monge on descriptive and differential geometry. A preliminary version of the CeDG approach implemented on the dynamic geometry software Geogebra [16] demonstrated its reliability to model some 3D systems [11].
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 that is different from those presented so far will be used.
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 are proportional to the number of points attained [17]. The CeDG approach extends the DG procedures to find a parametric mathematical function that defines the sought intersection curve. The parametric function is extracted by means of a locus function from the geometrical constructions of the model, which is computed from the sequence of geometric-mathematical entities associated with the calculation of a single generic point of the intersection [11].
This paper develops a theoretical technique that computes the intersections and flattening (first objective), which is used to solve the case study defined by a compound hopper, whose CeDG result (3D model and flat pattern) is compared with the solution obtained using Solid Edge 2023 (second objective). The details of the comparison are presented in the Section 2.

2. Materials and Methods

The study has two stages. The theoretical development of the CeDG 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 is subsequently flattened, to clarify the meaning and scope of the mathematical entities and procedures involved in the novel method.
The variables and other terms used in the theoretical development are defined at their first use. Notwithstanding, those that refer to especially 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 to the methodology pointed out in Prado-Velasco and Ortiz-Marín [17] 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 to 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 a steady state, may be defined through the following Equation (1), in which G is the mass flow rate of fluid through D f and ρ , v and d S are the density and velocity of the 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.
G = S d ρ ( r ) v ( r ) d S ( r ) = ρ d v d A d ,
The model needs 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 the horizontal projection of vertex, 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 , the diameter of the upper border ( b u b u ), D bu , the diameter of the lower border ( b l b l ), D bl , the height of the lower duct with respect to its vertex, H ld , the angle of fluid duct axis with respect to the vertical, α df , and the angle of the 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 modeling. According to the Equation (1), the area A d may be considered perpendicular to the streamline. We are interested in performing 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. Each row represents the values of the dimensions referred to (Con, Ecc, D df , α df and α do ) that were assigned to evaluate the models according to the above specific targets.
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 was 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 CeDG and Solid Edge 2023 approaches were evaluated through the first two targets. In order to simplify the metrics and extension of the third target, we used three relevant 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 a 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 compute the intersection curve as C = { P ( ω ) = C 1 ( ω ) C 2 ( ω ) for all ω Ω }.
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 [18], we may compute the intersection curve C through their orthogonal projections on the dihedral planes, σ (horizontal) and σ (vertical).
Descriptive geometry gives mathematical procedures that solve the p σ projection for any value of ω . The encapsulation (sequence of mathematical entities in a dynamic geometry model) of that series of mathematical procedures through dependent mathematical objects for the parameter ω delivers a locus entity, which defines the following equation for the horizontal projection curve, σ :
L σ ( ω ) σ = locus ( p σ ( ω ) , ω Ω ) ,
in which L σ is a 2D parametric function in Ω , and locus is the mathematical entity that gives the points p σ associated with all values of ω Ω .
The vertical projection, σ , is achieved by the same Equation (2) when the horizontal projection of P ( ω ) , p σ , is substituted by the vertical projection, p σ .
To illustrate this method, Figure 3 presents the computation of the intersection between an oblique cone with an oblique cylinder according to Equation (2). The surfaces are defined by their circular sections with a horizontal plane (bases) and their axis (and vertex v’ − v in the cone). 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 ensure 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. In 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 Figure 3). Therefore, the reference set, Ω , is the interval [0, γ Px ], where γ Px is the angle between lines PLI − h − PLS (12.8 in Figure 3).
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 give 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). Therefore, the vertical and horizontal projections of C , σ and σ , are given by the following four-leaf parametric curves:
σ L σ ( ω ) = locus ( { a c , b c , a d , b d } , ω Ω )
σ L σ ( ω ) = locus ( { a c , b c , a d , b d } , ω Ω )
The leaves of σ and σ have been emphasized through alternating colors (see Figure 3). Figure 3 presents the connection between C and the cone basis ( b 1 b 1 and b 2 b 2 ), beside the horizontal cone section just below C (dashed circle), to clarify the solution.
Reducing the distance between the centers of circular bases, o − o 2 , the bite between surfaces changes to the penetration of the cylinder into the cone, as shown in Figure 4. The boundary planes are now both tangent to the cylinder base (PLS is 3 and PLI is 4). The intersection curve splits into two separate pieces, which are defined by the parametric curves L σ ( ω ) and L σ ( ω ) (Equations (3) and (4)) for the vertical and horizontal projections, respectively.
The mathematical-geometric objects described in detail in previous paragraphs and manipulated according DG procedures to calculate the intersections points P i ( ω ) = C 1 ( ω ) C 2 ( ω ) , i = 1 , 2 , 3 , 4 ) = (ac’ − ac, bc’ − bc, ad’ − ad, bd’ − bd) can be implemented through mathematical entities in the CeDG model. As these points depend on ω , which is a parameter in Ω = [ 0 , γ Px ] , it is possible to define the loci of Equations (3) and (4) through subsequent mathematical entities that depend on the previous ones. We conclude that this surface-to-surface intersection technique produces a sequence of dependent mathematical entities that may be implemented in a dynamic geometry software in a manner compliant with the CeDG approach, as illustrated in Figure 3 and Figure 4.
An important feature of this technique is that it keeps the geometric integrity of the intersection curve. That is, C , defined through the vertical and horizontal projection, σ and σ , is not an approximation but the true mathematical object, expressed through the parametric functions L σ ( ω ) and L σ ( ω ) . These functions, in turn, are implicitly coded in the CeDG model, allowing transcendental (non-algebraic) functions.
Although the example is based on quadric surfaces, the method is not restricted to this type of surface. According to descriptive geometry knowledge [18], S 1 and S 2 may be any type of surfaces for which a collection of auxiliary surfaces S ( ω ) exists and produces computable intersection curves C 1 ( ω ) = S 1 S ( ω ) and C 2 ( ω ) = S 2 S ( ω ) in S 1 and S 2 , respectively. The term computable is used here to refer to known curves (straight lines, conics, or other ones implemented on well-known mathematical objects), and to curves that may be calculated through the first ones in a recurrent process.
Although a deep analysis of this issue exceeds the scope of this paper, several examples of non-quadric technical surfaces include polyhedral surfaces and even evolution surfaces (e.g., a ship’s hull) [18].

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 transformation of any 3D curve in this type of surface. It has been implemented in GeoGebra as part of the built-in features of CeDG.
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 on the transformed g. This two-stage procedure defines a sequence of dependent mathematical objects, which builds the locus entity that defines the flat transform 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 a 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, ensuring 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 transform of the generatrix line through p σ is parallel to the reference one. The function f R converts its argument from σ into the transform in R.
Finally, the flat transform of P A A in the cylinder is P π , which pertains to the flat transform of its generatrix line, with the 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 invariance conditions and manipulate the 3D space through mathematical objects, the flat transform 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 the cone’s vertex (V) to obtain a warped curve in S , A , which is called support curve. We know that the flat transform of A is a circular arch (D) with the radius of the sphere. The flat transform 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 from P A to P A 0 along A (see Figure 5). The flat transform of a generatrix line through P A A contains the flat transform of vertex ( V ref placed together with the reference generatrix line) and f D ( P A ) .
The flat transform of P C C in the cone is P τ , which pertains to the flat transform 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 transform 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 mathematical manipulation of this surface.
The variable ω Ω may be substituted by another 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 transformation 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 CeDG model, between two selected generatrix lines, as presented in Figure 6.
Projections are presented in lowercase, whereas flat transformations are in uppercase (except 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 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 transform 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 to 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 CeDG model updates dynamically to changes in the parameters, which include the modification of the intersection. In this manner, if we reduce the distance between the centers of circular bases o − o 2 , as was performed in Figure 4, the bite changes to penetration, splitting into 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.
We must remark on several issues of this novel surface flattening method. First, the mathematical-geometric procedures that have been described and applied to compute the parametric points ( ω R ) , ω R F and ω R E in the flat domain, can be implemented through mathematical entities in CeDG modeling to allow the determination of the loci given by Equation (6). The implementation is performed automatically during the model building process in a dynamic geometry software such as GeoGebra. Second, the technique keeps the geometric integrity of the flattened curves, through the parametric functions: locus(( ω R ), t ω R ), locus( ω R F, t ω R ) and locus( ω R E, t ω R ), which in turn are implicitly coded in the CeDG model.
Finally, the technique is limited to ruled single curvature surfaces S , in which for any point P in C S there exists a generatrix line that includes P and may be converted to the flat domain without surface deformation.

3.2. Hopper’s CeDG Modeling

Figure 8 shows the D u D f connection, calculated according to 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 auxiliary plane from S ( ω ) with ω Ω intersects the fluid duct in two generatrix lines, C 1 ( ω ) , and 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 the vertical projections 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 was calculated using a collection of horizontal planes with heights from the low border, b l , to the height of Q 5 , as shown. In this manner, we define ω = z h (pointed out in Figure 9) 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 seeming elliptic.
Once the connection curves are defined in our CeDG model, the upper and lower ducts may be flattened. The flat pattern of the upper duct was 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 a 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 sets 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 to A are used to verify the accuracy of the flat transform. These areas 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 of a 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 a 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 transform, 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 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 were 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 CeDG 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 the method’s requirements (see Section 2). Figure 12a shows the connection curve D u D f after two sequential rotations ( ϕ ev and ϕ eh with the 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 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 remains 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 m 2 . 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 CeDG model and presented in Figure 12b. The conicity values greater than or equal to 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). However, it is possible to even further reduce the tonicity, and the sensitivity of A o to errors in the hopper’s dimensions increases excessively. Therefore, we selected Con = 0.09 and Ecc = 1.66 m as design parameters ( Nom 1 dimensions’ group).
The CeDG model of the hopper associated with the Nom 1 design dimensions is presented in Figure 13.

3.3. Hopper’s CAD Modeling

Figure 14 shows the D u D f connection. Both bodies were modeled with the support of the 3D CAD solid modeling software, parametric features, and synchronous technology Solid Edge 2023. We 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 was also 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 one to work with the neutral surface (fiber) of the hopper, as indicated in the methodology pointed out in Prado-Velasco and Ortiz-Marín [17], and the minimum thickness value allowed by this software is the one indicated above.
In Figure 15, a 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 our whole 3D model in such a way that its flat pattern could be computed, we needed 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 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 Figure 15). This is a fundamental condition if the solid cylinder is required to be converted into a sheet metal module. Once the slot is created, it is possible to access the tools command and select the icon to convert into the 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, which was obtained by using Solid Edge’s draft module. The spatial points indicated are the same as those selected in the CeDG 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 modeled with the Solid Edge 2023 solids module. The truncated straight cone was generated with the protrusion by the 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 to D u with the aim of solving its flat pattern. The protrusion by the revolution command was used to generate the truncated cone, which was subsequently made a swept hollowing with the same characteristics as the 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 for 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 the 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 was 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 used the same surrogate of the discharge area as in the CeDG model to facilitate the comparison.
The obtained values are very similar to those calculated using the CeDG 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, nor the other 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 modeling. In addition, this CAD tool does not provide an easy method to compute and evaluate A r , as a function of the eccentricity and conicity of our 3D hopper. Each specific target of the second stage of our study is compared as follows.
  • Feasibility to reach the required models. The 3D model of the hopper that includes the ducts connections was properly obtained both in CeDG 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 the oblique cylindrical duct with an intersection of the bite type. We used different strategies, as described in the Section 3, 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 CeDG 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, we did not find a direct manner to extract the A r function in Solid Edge 2023.
  • With respect to accuracy, a 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 less than 0.01%. In the case of P m and P M , z relative deviations were lower than 0.02%, whereas y relative deviations were lower than 3.9%. The relative deviations between A r values were lower 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 was needed. We conclude that the accuracy was high in both models.
The failure of Solid Edge 2023 to achieve the flat pattern of a particular surface’s configuration agrees with other comparative studies [17]. 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.
Our results validate the reliability and accuracy of the new theoretical method presented to compute surfaces’ intersections and their flattening for the type of surfaces of the case study. This method takes advantage of the mathematical procedures of descriptive geometry and extends them by means of a locus implicit parametric equation within the novel CeDG approach. The integrity of geometrical objects that characterizes CeDG [11,17] is also kept in this method. Although this study does not evaluate the reliability and accuracy of CeDG and the surface–surface intersection method with non-quadric surfaces, the underlying foundation is not limited to them, as pointed out in the Section 3. The study of the reliability of our method to address the intersections among NURBSs surfaces is a relevant subject that requires more research, since NURBS curves and surfaces are not usually addressed in native form by dynamic geometry software, and thus they must be first implemented as mathematical entities in an efficient computational manner.
The implicit building of parametric functions defining the intersection and flattened curves is an important property shared by other 3D modeling techniques such as the implicit complex (IC) framework of Kartasheva et al. [19] (the third condition of the definition of a graphical cell in the IC). However, CeDG is based on locus-based parametric functions, which differ completely from the IC concept. In addition, CeDG does not have a framework that associates projections with 3D objects. The development of that framework is a current research line in CeDG [20].
CeDG is implemented in a software of dynamic geometry, which provides a different technology from the technology of current CAD systems. Other studies about 3D geometrical modeling have used the locus concept with a different goal. For instance, Gao et al. [21] uses the locus as a mathematical technique to solve some geometrical issues, such as the geometric constraints problem that appears frequently in parametric CAD and other domains, and Oprea and Ruse [22] 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 by Rojas-Sola et al. [23] that improved the set of available resources to build sketches by incorporating a locus tool into several geometrical cases and implemented them in Adobe Authorware v7 (e-learning authoring tool with a graphical programming language that was officially discontinued in 2007). A more recent study advanced that research line by implementing an algorithm to solve relevant loci cases, which was designed for educational use [24]. Certainly, the development of new mathematical algorithms that improve the locus equation computations is an ongoing research line in industry and research [25].
Although CeDG 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, the Locus implicit function cannot be used as a general 2D geometric object, and the measurement of lengths along it has limitations [16]. These issues define other 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 CeDG and Solid Edge 2023 models are available on request from the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
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)
CeDGComputer 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; 2008; Book Section 3; p. 650. Available online: http://cadhistory.net/ (accessed on 2 February 2023).
  2. Manni, C.; Pelosi, F.; Sampoli, M.L. Generalized B-splines as a tool in isogeometric analysis. Comput. Methods Appl. Mech. Eng. 2011, 200, 867–881. [Google Scholar] [CrossRef]
  3. Zhang, Y.; Bazilevs, Y.; Goswami, S.; Bajaj, C.L.; Hughes, T.J.R. Patient-specific vascular NURBS modeling for isogeometric analysis of blood flow. Comput. Methods Appl. Mech. Eng. 2007, 196, 2943–2959. [Google Scholar] [CrossRef] [PubMed]
  4. Xiaohong, J.; Kai, L.; Jinsan, C. Computing the Intersection of Two Rational Surfaces Using Matrix Representations. Comput.-Aided Des. 2022, 150, 103303. [Google Scholar]
  5. Manocha, D.; Canny, J. A new approach for surface intersection. In Proceedings of the first ACM symposium on Solid Modeling Foundations and CAD/CAM Applications—SMA ’91, Austin, TX, USA, 5–7 June 1991. [Google Scholar] [CrossRef]
  6. Patrikalakis, N.M. Surface-to-surface intersections. IEEE Comput. Graph. Appl. 1993, 13, 89–95. [Google Scholar] [CrossRef]
  7. Li, X.; Jiang, H.; Chen, S.; Wang, X. An efficient surface–surface intersection algorithm based on geometry characteristics. Comput. Graph. 2004, 28, 527–537. [Google Scholar] [CrossRef]
  8. Dejdumrong, N. The Determination of Surface Intersection Using Subdivision and Polyhedron Intersection methods. In Proceedings of the 2nd International Conference on Computer and Automation Engineering (ICCAE), Singapore, 26–28 February 2010. [Google Scholar]
  9. Busé, L.; Luu Ba, T. The surface/surface intersection problem by means of matrix based representations. Comput. Aided Geom. Des. 2012, 29, 579–598. [Google Scholar] [CrossRef]
  10. 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. Comput.-Aided Des. 2020, 127. [Google Scholar] [CrossRef]
  11. 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. Comput.-Aided Des. Appl. 2021, 18, 272–284. [Google Scholar] [CrossRef]
  12. Kortenkamp, U. Foundations of Dynamic Geometry. Ph.D. Thesis, Swiss Federal Institute of Technology, Zurich, Switzerland, 1999. [Google Scholar]
  13. Croft, F.M. The Need (?) for Descriptive Geometry in a World of 3D Modeling. Eng. Des. Graph. J. 1998, 62, 4–8. [Google Scholar]
  14. Ortiz-Marín, R.; Del Río-Cidoncha, G.; Martínez-Palacios, J. Where is Descriptive Geometry Heading? In Lecture Notes in Mechanical Engineering; Cavas-Martínez, F., Sanz-Adan, F., Morer Camo, P., Lostado Lorza, R., Santamaría Peña, J., Eds.; Springer: Berlin/Heidelberg, Germany, 2020; pp. 365–373. [Google Scholar] [CrossRef]
  15. Wottreng, K.A. Computer Methods in Descriptive and Differential Geometry Monge’s Legacy. Ph.D. Thesis, University of Illinois at Chicago, Chicago, IL, USA, 1999. [Google Scholar]
  16. Hohenwarter, J.; Hohenwarter, M. Geogebra Classic Manual. 2019. Available online: https://wiki.geogebra.org/en/Manual (accessed on 10 February 2023).
  17. 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]
  18. Leighton Wellman, B. Geometría Descriptiva [Technical Descriptive Geometry]; Editorial Reverté, S.A.: Barcelona, Spain, 1987; p. 615. [Google Scholar]
  19. Kartasheva, E.; Adzhiev, V.; Comninos, P.; Fryazinov, O.; Pasko, A. An Implicit Complexes Framework for Heterogeneous Objects Modelling. In Heterogeneous Objects Modelling and Applications: Collection of Papers on Foundations and Practice; Pasko, A., Adzhiev, V., Comninos, P., Eds.; Springer: Berlin/Heidelberg, Germany, 2008; pp. 1–41. [Google Scholar] [CrossRef]
  20. Prado-Velasco, M.; García-Ruesgas, L. Asociación entre vistas ortográficas y objetos 3D en CeDG: Prueba de concepto (Association between ortographic views and 3D objects in CeDG: Proof of concept). In Innovaciones Educativas en el Ámbito Edificatorio; Editorial Dykinson: Madrid, Spain, 2022; pp. 57–69. ISBN 978-84-1122-751-3. [Google Scholar]
  21. Gao, X.S.; Hoffmann, C.M.; Yang, W.Q. Solving spatial basic geometric constraint configurations with locus intersection. Comput.-Aided Des. 2004, 36, 111–122. [Google Scholar] [CrossRef]
  22. Oprea, G.; Ruse, G. A descriptive approach of intersecting geometrical loci—The cylinder case. U.P.B. Sci. Bull. Ser. D 2006, 68, 81–88. [Google Scholar]
  23. 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, 1181. [Google Scholar] [CrossRef]
  24. 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, 10. [Google Scholar] [CrossRef]
  25. 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: Proceedings of the 12th International Conference, CICM 2019, Prague, Czech Republic, 8–12 July 2019; Lecture Notes in Computer Science; Springer International Publishing: Berlin/Heidelberg, Germany, 2019; Volume 11617, pp. 140–154. ISBN 978-3-030-23249-8. [Google Scholar] [CrossRef]
Figure 1. Cone–cylinder intersection for illustrating the theoretical development (first stage).
Figure 1. Cone–cylinder intersection for illustrating the theoretical development (first stage).
Symmetry 15 00984 g001
Figure 2. Hopper defined through its projections (second stage).
Figure 2. Hopper defined through its projections (second stage).
Symmetry 15 00984 g002
Figure 3. Projection curves of cone–cylinder intersection (bite) in a CeDG model.
Figure 3. Projection curves of cone–cylinder intersection (bite) in a CeDG model.
Symmetry 15 00984 g003
Figure 4. Projection curves of the cone–cylinder intersection (penetration) in a CeDG model.
Figure 4. Projection curves of the cone–cylinder intersection (penetration) in a CeDG model.
Symmetry 15 00984 g004
Figure 5. Flattening transformation with generatrix line mapping: cylinder (left)–cone (right).
Figure 5. Flattening transformation with generatrix line mapping: cylinder (left)–cone (right).
Symmetry 15 00984 g005
Figure 6. Cone surface intersecting with a cylinder (bite, Figure 3) flattened between generatrix lines through r A and r B . The projections of surfaces include auxiliary lines that help to follow the building process that gives the flat pattern (right–bottom).
Figure 6. Cone surface intersecting with a cylinder (bite, Figure 3) flattened between generatrix lines through r A and r B . The projections of surfaces include auxiliary lines that help to follow the building process that gives the flat pattern (right–bottom).
Symmetry 15 00984 g006
Figure 7. Cone surface intersecting with cylinder (penetrated, Figure 4) flattened between generatrix lines through r A and r B .
Figure 7. Cone surface intersecting with cylinder (penetrated, Figure 4) flattened between generatrix lines through r A and r B .
Symmetry 15 00984 g007
Figure 8. CeDG modeling of D u D f connection curve.
Figure 8. CeDG modeling of D u D f connection curve.
Symmetry 15 00984 g008
Figure 9. CeDG modeling of D l D o connection curve.
Figure 9. CeDG modeling of D l D o connection curve.
Symmetry 15 00984 g009
Figure 10. Flat pattern of the upper duct ( D u ) in the CeDG model.
Figure 10. Flat pattern of the upper duct ( D u ) in the CeDG model.
Symmetry 15 00984 g010
Figure 11. Flat pattern of the lower duct ( D l ) in the CeDG model.
Figure 11. Flat pattern of the lower duct ( D l ) in the CeDG model.
Symmetry 15 00984 g011
Figure 12. Visual inspection 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) in the CeDG model.
Figure 12. Visual inspection 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) in the CeDG model.
Symmetry 15 00984 g012
Figure 13. Final design of the hopper through CeDG modeling.
Figure 13. Final design of the hopper through CeDG modeling.
Symmetry 15 00984 g013
Figure 14. Solid Edge modeling of the D u D f ducts system.
Figure 14. Solid Edge modeling of the D u D f ducts system.
Symmetry 15 00984 g014
Figure 15. Solid Edge modeling of the D u duct with the D f connection curve.
Figure 15. Solid Edge modeling of the D u duct with the D f connection curve.
Symmetry 15 00984 g015
Figure 16. Flat pattern of the D u cylinder together with the intersection curve produced by the D f truncated cone in the Solid Edge model.
Figure 16. Flat pattern of the D u cylinder together with the intersection curve produced by the D f truncated cone in the Solid Edge model.
Symmetry 15 00984 g016
Figure 17. Solid Edge modeling of the D l D o ducts system.
Figure 17. Solid Edge modeling of the D l D o ducts system.
Symmetry 15 00984 g017
Figure 18. Solid Edge modeling of the D l duct with the connection curve.
Figure 18. Solid Edge modeling of the D l duct with the connection curve.
Symmetry 15 00984 g018
Figure 19. Final design of the hopper through Solid Edge modeling.
Figure 19. Final design of the hopper through Solid Edge modeling.
Symmetry 15 00984 g019
Table 1. Dimensions’ groups values (meters) for 3D model CeDG–CAD comparison.
Table 1. Dimensions’ groups values (meters) for 3D model CeDG–CAD comparison.
Dim. GroupCon Ecc D df α df  α do 
Nom 0 0.270.6265 45
Nom 1 0.091.66265 45
Var 0 0.51.110.550 52
Var 1 0.500.550 52
Var 2 0.092.430.550 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 CeDG for each dimension’s groups.
Table 2. Coordinates of selected points of flat patterns from upper and lower duct (m) and A r ratio, computed with CeDG for each dimension’s 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.4873.2753.6911.9791.5631.6334.9215.44051.728 3.259
Nom 1 3.6573.1474.2692.6562.0161.6374.7775.44039.679 3.024
Var 0 3.4782.2764.0102.5540.9720.9774.2687.46444.246 56.361
Var 1 2.2872.4762.4761.1240.8811.0983.6687.46462.302 31.696
Var 2 2.1102.6424.1771.9012.3200.9634.2277.46438.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 dimension’s 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 dimension’s 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.4873.2753.6912.0221.5631.6754.921--3.543
Nom 1 3.6583.1474.2702.6662.0151.6324.777--3.003
Var 0 3.4782.2764.0092.5510.9710.9814.268--56.618
Var 1 2.2872.4762.4761.1430.8811.1433.669--31.694
Var 2 2.1112.6424.1771.8312.3120.7614.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.

Share and Cite

MDPI and ACS Style

Prado-Velasco, M.; García-Ruesgas, L. Intersection and Flattening of Surfaces in 3D Models through Computer-Extended Descriptive Geometry (CeDG). Symmetry 2023, 15, 984. https://doi.org/10.3390/sym15050984

AMA Style

Prado-Velasco M, García-Ruesgas L. Intersection and Flattening of Surfaces in 3D Models through Computer-Extended Descriptive Geometry (CeDG). Symmetry. 2023; 15(5):984. https://doi.org/10.3390/sym15050984

Chicago/Turabian Style

Prado-Velasco, Manuel, and Laura García-Ruesgas. 2023. "Intersection and Flattening of Surfaces in 3D Models through Computer-Extended Descriptive Geometry (CeDG)" Symmetry 15, no. 5: 984. https://doi.org/10.3390/sym15050984

APA Style

Prado-Velasco, M., & García-Ruesgas, L. (2023). Intersection and Flattening of Surfaces in 3D Models through Computer-Extended Descriptive Geometry (CeDG). Symmetry, 15(5), 984. https://doi.org/10.3390/sym15050984

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop