module-123 SOLID MODELING INTRO

5/2/2013

I/C: Regalla Srinivasa Prakash

CHARACTERISTICS SOLID MODELING Solids models are known to be complete, valid, and unambiguous representations of objects. A complete solid is one which enables a point in space to be classified relative to the object, if it is inside, outside or on the object. This classification is called as spatial addressability or set membership classification. A valid solid should not have dangling edges or faces, then only it will allow interference analysis, mass property calculations, finite element modeling and analysis, CAPP, machine vision, and NC part programming.
5/2/2013 I/C: Regalla Srinivasa Prakash 2

SOLID MODELING APPROACHES IN CAD PACKAGES

All commercial CAD packages offer one or both of two different solid modeling approaches: 1) Primitives based 2) Feature based

UNIGRAPHICS (EDS Technologies), CATIA (Dassault Systems), I-DEAS (Structural Dynamics Research Corporation) offer both approaches. SolidWorks (Dassault Systems), Pro/Engineer (Parametric Technology Corporation).
5/2/2013 I/C: Regalla Srinivasa Prakash 3

SOLID ENTITIES
APPROACH Primitives based approach ENTITIES Solid primitives (block, cylinder, cone, sphere, wedge and torus)

Feature based approach Sketches

5/2/2013

I/C: Regalla Srinivasa Prakash

PRIMITIVE BASED SOLID MODELING This approach allows designers to use predefined shapes (primitives) as building blocks to create complex solids. Designers must use Boolean operations to combine the primitives This approach is limited by the restricted shapes of the primitives.
C B A
5/2/2013

A, B and C are primitive solids. A = Block B = Cylinder C = Cylinder ABC=D :Boolean operation; Create block A and subtract two cylinders from it using primitives approach.
I/C: Regalla Srinivasa Prakash D = Final solid 5

FEATURE BASED SOLID MODELING

This method is more flexible because it allows the construction of more complicated objects and more elaborate solids more readily than the primitive based modeling. Feature based modeling is in fact a generalization of primitives approach. Boolean operations are still used, but are hidden from the user. For example, creating a protrusion on the face of a cube is a Boolean union and creating a cut in the cube is a Boolean subtraction. These operations are must for creation of the final solid. * Create a rectangle * Subtract two circles * Extrude the resulting feature * The required solid is obtained
Alternatively, * Create a rectangle * Extrude the rectangle to create the block * Selecting the top face of the block as sketching plane, draw two circles * Create through cuts by extrusion to obtain the final solid
5/2/2013 I/C: Regalla Srinivasa Prakash 6

SOLID MODELING
Geometry and topology Solid entities Fundamentals of solid modeling Half-spaces Boundary representation (B-Rep) Constructive Solid Geometry (CSG) Sweeps Solid Manipulations
I/C: Regalla Srinivasa Prakash 7

5/2/2013

Geometry and topology

Geometry is the actual dimensions that define the entities of the object. It is also sometimes called as metric information. Topology (sometimes called as combinatorial structure) is the connectivity and associativity of the object entities.

5/2/2013

I/C: Regalla Srinivasa Prakash

Solid primitives

5/2/2013

I/C: Regalla Srinivasa Prakash

5/2/2013

I/C: Regalla Srinivasa Prakash

10

Desirable properties of solid models:

1) Rigidity: Shape of the solid model is invariant 2) Homogeneous 3-Dimensionality: No dangling portions, no isolated portions, solid boundaries are in contact with the interiors 3) Finiteness and finite describability: The two are different; a (P, R, H) set describe a finite cylinder but may have infinite faces to describe 4) Closure under rigid motion and Boolean operations: Should produce valid solids 5) Boundary determinism: Boundary must clearly determine the solid
5/2/2013 I/C: Regalla Srinivasa Prakash 11

Most commonly used representation schemes:

1) 2) 3) 4) 5) 6) 7) 8) 9)

Half-Spaces B-Rep (boundary representation) CSG (Constructive Solid Geometry) Sweeping Analytic Solid Modeling Cell decomposition Octree Encoding Spatial Enumeration Primitive instancing
I/C: Regalla Srinivasa Prakash 12

5/2/2013

HALF SPACE FORMAL DEFINITION

A half-space is that portion of an n-dimensional space obtained by removing that part lying on one side of an (n-1)-dimensional hyperplane. For example, half a Euclidean space is given by the threedimensional region satisfying x >0, ; while a half-plane is given by the two-dimensional region satisfying x >0 ,
5/2/2013 I/C: Regalla Srinivasa Prakash 13

BOUNDARY REPRESENTATION (B-Rep)

One of the two most popular and widely used schemes (the other being CSG) Based on the concept that a solid is made of a set of faces, which are subsets of closed and orientable surfaces A closed surface is one that is continuous without breaks. An orientable surface is one where it is possible to distinguish two sides by using the direction of the surface normal to point inside or outside the solid model. Each face is bounded by edges and each edge is bounded by vertices
5/2/2013 I/C: Regalla Srinivasa Prakash 14

Euler Operations and Euclidean Calculations:

Topology is created by Euler operations
Euler operations can be used to create, manipulate, edit the faces, edges, and vertices of a boundary model Euler operations, similar to Boolean operations, ensure the validity (closedness, no dangling faces or edges etc.) of B-rep models

Geometry is created by the Euclidean calculations

Geometry includes coordinates of vertices, rigid motion and transformation
5/2/2013 I/C: Regalla Srinivasa Prakash 15

Elements of B-Rep models: Types of Objects Two types of objects: 1) Polyhedral objects
Consist of plane faces and straight edges

2) Curved objects Consist of curvilinear general surfaces and general curvilinear edges

5/2/2013

I/C: Regalla Srinivasa Prakash

16

Elements of B-Rep models:

Faces: Face is a closed, orientable and bounded (by edges) surface. Edges: It is finite, non- self intersecting directed space curve bounded by two vertices Vertices: Vertex is a point in space. Loops: It is an ordered alternating sequence of vertices and edges Boundary Hole: A blind hole Interior Hole: A hole lying inside and having no boundary on the surface of the solid Handles: Handle is a through hole in the solid. It may be termed as a 3-D hole. The number of handles in a solid is called as genus.
5/2/2013 I/C: Regalla Srinivasa Prakash 17

POLYHEDRAL OBJECTS
Four different classes:
1. Simple polyhedra 2. Polyhedra having loops 3. Polyhedra having boundary (blind) holes and interior holes 4. Polyhedra having through holes or handles

5/2/2013

I/C: Regalla Srinivasa Prakash

18

A DISJOINT SOLID
A solid having more than one body is called as disjoint solid. Thus a hollow sphere, a cuboid with internal hole, a solid having two pieces that are completely disconnected etc. are examples of disjoint solids. Can you create a disjoint solid in Pro/Engineer?
5/2/2013 I/C: Regalla Srinivasa Prakash 19

5/2/2013

I/C: Regalla Srinivasa Prakash

20

EULER OPERATIONS
Euler in 1752 proved that polyhedra that are homomorphic to a sphere, that is their faces are non self-intersecting and belong to closed orientable surfacse, are topologically valid if they satisfy the following Euler-Poincare Law equation: F E + V L= 2(B G) F= Number of faces E= Number of edges V= Number of vertices L = Inner loops on faces B= bodies G = genus (handles)
5/2/2013 I/C: Regalla Srinivasa Prakash 21

SIMPLE POLYHEDRA
When L=B=G=0, then the solid satisfies the following equation and is called as simple polyhedron. FE+V=2

5/2/2013

I/C: Regalla Srinivasa Prakash

22

A cuboid is a simple solid: F=6 E = 12 V=8 In this case F + V - E = 2.

A tetrahedron is the simplest: F=4 E=6 V=4 In this case F + V - E = 2.

The given solid is simple: F=8 E = 18 V = 12 In this case F + V - E = 2.

5/2/2013 I/C: Regalla Srinivasa Prakash 23

SOLIDS THAT ARE NON-HOMOMORPHIC TO A SPHERE (OPEN SOLIDS)

Open solids satisfy the following version of Euler law: FE+VL=BG In this equation B refers to an open body which can be a wire, an area or a volume.

5/2/2013

I/C: Regalla Srinivasa Prakash

24

Open solids

WIRE OPEN POLYDRA

LAMINA OPEN POLYDRA

SHELL OPEN POLYDRA

5/2/2013

OPEN POLYDRA (OBJECTS) HAVING NO TOP FACE

I/C: Regalla Srinivasa Prakash 25

CURVED POLYHEDRA
Simplest curbed polyhedra are cylinder and sphere.

F = 3; E = 3; V = 2 F = 1; E = 0; V = 1
5/2/2013 I/C: Regalla Srinivasa Prakash 26

CURVED POLYHEDRA
If the curved objects are represented by storing the equations of curves and surfaces of edges and faces, the resulting boundary scheme is called as exact B-Rep scheme. Alternatively, one may use faceted B-Rep (also called as tesselated representation), in which each curved face is divided into planar facets. Increasing the number of facets increases accuracy of display but takes more time. Faceted representation is not good for CNC machining because the machine hardware will do one more level of interpolation resulting in errors.
5/2/2013 I/C: Regalla Srinivasa Prakash 27

DATA STRUCTURE FOR B-Rep SOLIDS TOPOLOGY GEOMETRY Model Body Genus Face Loop Edge Vertex
5/2/2013 I/C: Regalla Srinivasa Prakash 28

Underlying surface equation

Underlying curve equation

CONSTRUCTIVE SOLID GEOMETRY (CSG) Principle: A physical object can be divided into a set of primitives that can be combined in a certain order following a set of rules (Boolean operations) to form the object. Primitives themselves are valid CSG models. Each primitive is also a solid considered to have been built by a B-Rep process of combining faces from edges, edges from vertices. Database contains both topology and geometry Validity check for CSG solids is much simpler than B-Rep solids because each primitive is already a valid solid.
I/C: Regalla Srinivasa Prakash 29

5/2/2013

Data structures of CSG representation

Graph
Diagraph

Tree
Binary tree Inverted Binary tree

5/2/2013

I/C: Regalla Srinivasa Prakash

30

Data Structure for CSG Solids: CSG Trees

5/2/2013

I/C: Regalla Srinivasa Prakash

31

Data Structure for CSG Solids: CSG Trees How to divide a given solids into primitives?
OP7 OP3 OP3 n = Total nodes

OP7

P4 P5

OP7

P3
OP1 P2 P1

nL + nR = 2n 2

P3

OP1

Perfect Tree: nL = n R = n 1
5/2/2013 I/C: Regalla Srinivasa Prakash

P1

P2

32

SWEEPING
A point set is swept along a directrix. 1. Translational sweep: Along a straightline directrix 2. Rotational sweep: axi-symmetric rotation 3. Non-linear sweep: along a curve directrix 4. Hybrid sweep: More than one directrix 5. Invalid Sweep: Produces dangling faces
5/2/2013 I/C: Regalla Srinivasa Prakash 33