BE ME 8th Sem SolidModeling-Boundary Representation Shivam Sharma
BE ME 8th Sem SolidModeling-Boundary Representation Shivam Sharma
• B- Rep model
– Technique guarantees that surfaces definitively divide model space
into solid and even after model modification commands.
– B-Rep graph store face, edge and vertices as nodes, with
pointers, or branches between the nodes to indicate
connectivity.
Boundary representation- validity
• System must validate topology of created solid.
• B-Rep has to fulfill certain conditions to disallow
self-intersecting and open objects
• This condition include
– Each edge should adjoin exactly two faces and
have a vertex at each end.
– Vertices are geometrically described by point
coordinates
– At least three edges must meet at each vertex.
– Faces are described by surface equations
– The set of faces forms a complete skin of the
solid with no missing parts.
– Each face is bordered by an ordered set of edges
forming a
closed loop.
– Faces must only intersect at common edges or
vertices.
– The boundaries of faces do not intersect
themselves
v5
B-Rep data structure
f3 E4 f2
E1 v4 E3
E7
v3
f4 f5E2 E6 solid
E8 f1
v1 E5 v2
face1 face2 face3 face4 face5
Combinatorial
edge1 edge2 edge3 edge4 edge5 edge6 edge7 edge8 structure /
topology