Zhuming Bi - Computer Aided Design and Manufacturing

In an explicit form :

(2.14)

In an implicit form :

(2.15)

In computer aided geometric modelling, 2D and 3D curves are commonly used to generate 3D surfaces. Depending on surface features, 3D surfaces can be classified into swept , ruled‐generated , or free‐formed surfaces, as shown in Table 2.5.

Table 2.5Types and features of surfaces.

Surface type	Feature	Illustration
Swept	A swept surface is defined by two elements, i.e. driving curve ( D ) and guide curve ( G ) or trajectory. The driving curve ( D ) can be open or closed. The guide curve ( G ) will run along D with the constant contact point.
Ruled	A ruled surface is defined by three 3D curves. The G curve drives along the D 1 curve and leans in D 2. In the first case, D 1 and D 2 are divided into equal segments and the end points of these segments are connected by G . In the second case, the G curve just leans to D 1 and G will be parallel in every position. Other variations can be generated from a ruled surface by application of a non‐constant G curve.
Freeform generated	If a surface cannot be described by analytic or moving curves, they are called free‐form or sculpture surfaces. Control points are used to determine the surface. The mathematic presentation of these surfaces is similar to the spline curves. The parametric surface description uses two independent variables ( u , v ).

Geometric modelling is used to create a virtual geometric representation of a real or imagined object, which includes information of the shape, dimensions, and materials of an object. Many methods have been developed to model geometrics of products. A better understanding of the theoretical basics of geometric modelling helps in (i) improving modelling efficiency and (ii) shortening the learning curves of various CAD systems. While every method has its limitations, no universal solution is available that satisfies all demands for geometric models in itself. To select a modelling method, one must ensure the validity of the geometries.

A manifold is a topological space that locally resembles a Euclidean space near each point. In an n ‐dimensional manifold, any neighbourhood of a point is homoeomorphic to the Euclidean space of dimension n . Accordingly, computer geometric models can be classified based on manifolds or non‐manifolds . Table 2.6shows a few examples of manifolds or non‐manifolds; a non‐manifold usually includes some entities of different dimensions (1D, 2D, or 3D).

Table 2.6Manifold and non‐manifold examples in 1D, 2D, and 3D.

N ‐dimension	Manifold example	Non‐manifold example
1D (line)			The intersecting point is not locally homogeneous.
2D (surface)			The intersecting line is not locally homogeneous.
3D (solid)			The geometry mixes 2D and 3D entities.

In a computer representation, the information about physical objects is digitized. In other words, a free‐form curve or surface is represented by a set of straight‐line segments or flat patches. The geometric topology concerns the connectivity of geometric elements. As shown in Figure 2.20, not all geometric elements can be connected together for a valid geometric topology.

Figure 2.20Examples of valid and invalid geometries. (a) Same geometries with different topologies. (b) Different geometries with the same topologies. (c) Invalid geometry.

A valid polyhedral in a 3D space should be homomorphic to a sphere and the validity of the geometry can be evaluated using the Euler–Poincare Law as

(2.16)

where F , E , V , B , L , and G are the numbers of faces, edges, vertices, bodies, inner loops on faces, and genuses in a geometry, respectively.

The meanings of inner loops and genuses are illustrated by the examples in Figure 2.21.

Figure 2.21Inner loop and genus examples. (a) Inner loop example. (b) Genus examples.

To use the Euler–Poincare Law to justify the validity of simple objects in the first column of Table 2.7.

Table 2.7Examples of simple objects.

Example	F	E	V	F − E + V = 2
	6	12	8	6 − 12 + 8 ≡ 2
	7	12	7	7 − 12 + 7 ≡ 2
	18	48	32	18 − 48 + 32 ≡ 2
	3	3	2	3 − 3 + 2 ≡ 2
	2	2	2	2 − 2 + 2 ≡ 2
	2	2	2	2 − 2 + 2 ≡ 2