0% found this document useful (0 votes)
22 views10 pages

BE ME 8th Sem SolidModeling-Boundary Representation Shivam Sharma

The document discusses boundary representation (B-Rep), which defines a solid model using its enclosing surfaces or boundaries. B-Rep includes topological data connecting faces, edges, and vertices. It must fulfill conditions like each edge adjoining two faces to prevent self-intersections and ensure a closed solid. B-Rep uses a data structure with nodes for faces, edges, and vertices connected by pointers to represent the topology.

Uploaded by

jw368899
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views10 pages

BE ME 8th Sem SolidModeling-Boundary Representation Shivam Sharma

The document discusses boundary representation (B-Rep), which defines a solid model using its enclosing surfaces or boundaries. B-Rep includes topological data connecting faces, edges, and vertices. It must fulfill conditions like each edge adjoining two faces to prevent self-intersections and ensure a closed solid. B-Rep uses a data structure with nodes for faces, edges, and vertices connected by pointers to represent the topology.

Uploaded by

jw368899
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Boundary representation (B-Rep)

• Solid model is defined by their enclosing surfaces or boundaries. This


technique consists of the geometric information about the faces,
edges and vertices of an object with the topological data on how
these are connected.
• Why B-Rep includes such topological information?
- A solid is represented as a closed space in 3D space (surface
connect without gaps)
- The boundary of a solid separates points inside from points outside
solid.

• 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

vertex1 vertex2 vertex3 vertex4 vertex5


Metric information/
(x, y, z) geometry
Boundary representation-
ambiguity and uniqueness
• Valid B-Reps are unambiguous
• Not fully unique, but much more so than CSG
• Potential difference exists in division of
– Surfaces into faces.
– Curves into edges
• Capability to construct unusual shapes that would not
be possible with
the available CSG aircraft fuselages, swing shapes
• Less computational time to reconstruct the image
• Requires more storage
• More prone to validity failure than CSG
• Model display limited to planar faces and linear edges
– complex curve and surfaces only approximated

You might also like