Fact-checked by Grok 2 weeks ago

Boundary representation

Boundary representation (B-rep) is a core method in for (CAD), representing three-dimensional objects by explicitly defining their boundary surfaces (faces), bounding curves (edges), and intersection points (vertices), together with the topological relationships that connect these elements to form a watertight volume. This approach distinguishes the interior solid from the exterior space through precise geometric and topological data, enabling accurate manipulation and analysis without relying on or approximations. Developed independently in the early 1970s by Ian C. Braid at the University of Cambridge and Bruce G. Baumgart at Stanford University, B-rep evolved from early efforts in computational geometry to model complex mechanical parts. By the 1980s, it had become the industry standard for parametric CAD systems, powering major software through B-rep kernels such as Parasolid (SolidWorks), ShapeManager derived from ACIS (AutoCAD), and CGM (CATIA). B-rep models are exchanged via standardized formats like STEP (ISO 10303), facilitating interoperability in engineering workflows from design to manufacturing. Key strengths of B-rep include its mathematical precision, where faces are defined by exact surfaces (e.g., NURBS or analytic patches) and edges by curves, allowing infinite resolution and zoom without loss of detail—ideal for high-fidelity and . Topological integrity is maintained through relations like adjacency and orientation, verifiable via the Euler-Poincaré characteristic (V - E + F = 2 for a simple , where V is vertices, E edges, and F faces), ensuring models are manifold and suitable for operations such as filleting, chamfering, or combinations. However, B-rep can demand significant computational resources for complex geometries due to extensive metadata storage, and it is less efficient for organic or highly intricate forms compared to mesh-based or implicit representations. Despite these challenges, its dominance persists in precision manufacturing, numerical simulations, and additive processes like laser powder bed fusion for low-to-medium complexity parts.

Fundamentals

Definition and Principles

Boundary representation (B-rep) is a method in for representing three-dimensional objects by explicitly defining their bounding surfaces, rather than through volumetric occupancy or decomposition into primitives. In this scheme, the solid is described as the enclosed volume formed by an arrangement of connected surfaces that separate the interior from the exterior space. The core principles of B-rep involve the precise of boundaries through both geometric and topological . Geometrically, boundaries are defined using curves for edges and surfaces for faces, enabling exact descriptions of shapes ranging from simple polyhedra to complex freeform surfaces. Topologically, the between these —such as how faces meet at edges and vertices—ensures the integrity of the model, supporting both manifold models where boundaries form closed, orientable surfaces without singularities, and non-manifold models that allow for shared edges among multiple faces or other complex topologies. Mathematically, a solid in B-rep is conceptualized as the closure of an of finite extent in 3-space, with its boundary partitioned into oriented faces whose outward-pointing normals distinguish the interior material from the exterior void. This orientation convention, often following the for face boundaries, ensures that the model unambiguously defines the enclosed volume. For instance, a simple polyhedral object like a illustrates these principles: its boundary consists of six rectangular faces connected along twelve edges and eight vertices, forming a closed manifold surface that encloses a finite volume without internal voids.

Core Components

Boundary representation (B-Rep) models are constructed from fundamental geometric and topological elements that define the surface enclosing a solid object. At the lowest level, vertices serve as zero-dimensional points anchoring the model in . Each vertex is defined by a triplet of coordinates (x, y, z), representing its precise location. These points typically occur at intersections where edges meet or where surface discontinuities arise, and they may carry additional attributes such as values to support smooth blending or analysis at sharp features. Edges form the one-dimensional connections between vertices, delineating the boundaries of surfaces. An is a parameterized segment, bounded by two vertices, and can represent straight lines, circular arcs, conic sections, or higher-order splines such as B-splines or NURBS curves. In a valid B-Rep, each must be adjacent to an even number of faces to ensure the boundary properly encloses the solid volume without gaps or overlaps. The parameterization allows for precise geometric queries, such as length computation or testing, while adjacency information links edges to neighboring elements. Faces constitute the two-dimensional patches that tile the object's surface. Each face is a bounded defined by one or more loops: an outer loop tracing the primary (typically oriented counterclockwise when viewed from outside the ) and optional inner loops for holes (oriented ). Geometrically, a face lies on a , such as a , , , or freeform surface represented by NURBS, with the loops constraining its extent. The union of all faces forms the complete , and each face must be orientable with a consistent direction pointing outward from the interior. The topological structure interconnects these components to capture the model's connectivity and ensure manifold properties. A common implementation uses half-edges, where each full edge is split into two directed half-edges, one for each adjacent face, enabling efficient traversal and adjacency queries (e.g., next and previous half-edges around a face, or twin half-edges across a shared boundary). This directed representation supports operations like walking around a face or identifying neighboring faces. Model integrity is validated using , which for a genus-0 (simply connected, hole-free) manifold states V - E + F = 2, where V is the number of vertices, E the number of edges, and F the number of faces; deviations indicate topological errors such as disconnected components or improper closures. Extensions to non-manifold structures accommodate complex assemblies where edges or faces are shared among multiple solids, such as in feature-based modeling or hybrid wireframe-surface-solid representations. In these schemes, traditional manifold constraints (e.g., exactly two faces per edge) are relaxed, allowing higher-degree incidences while preserving topologies to embed auxiliary entities without disrupting validity. This enables unified handling of part hierarchies in assemblies, where shared components represent mating interfaces.

Modeling and Operations

Boundary Construction

Boundary representation (B-Rep) models are constructed by first generating basic primitives—vertices, edges, and faces—using geometric kernels that support parametric representations such as planes, cylinders, and surfaces for more complex curves and surfaces. Vertices are defined as points in space, often computed at intersections of curves or surfaces. Edges are created as bounded curves connecting vertices, while faces are portions of surfaces bounded by edge loops. For instance, surfaces enable the representation of free-form shapes by fitting control points and knots to define smooth, continuous patches that form faces. Assembly techniques build boundaries from profiles through operations like extruding, sweeping, or revolving, which generate the and geometry of the solid while ensuring the model remains valid. translates a profile along a vector to create prismatic solids, producing parallel faces and connecting edges. Sweeping generalizes this by moving the profile along a curved , maintaining tangency where needed. Revolving rotates a profile around an to form surfaces of , such as cylinders or cones. Watertight closure is achieved by matching shared edges between adjacent faces, enforcing the manifold where each is incident to exactly two faces. To handle increased complexity, B-Rep construction incorporates trimmed surfaces, where faces are subsets of larger parametric surfaces bounded by trimming s to represent non-rectangular domains, and composite edges that chain multiple curve segments for longer boundaries. Self-intersections during assembly, such as those arising from overlapping sweeps, are resolved through computations and topological adjustments, ensuring the remains non-self-intersecting and orientable with consistent outward normals. These methods allow for robust models of intricate geometries while preserving the core components of faces and edges. A representative workflow for constructing a cylinder illustrates these principles: start with a rectangular 2D profile, revolve it around one edge as the axis to generate two circular faces at the ends and a cylindrical lateral face. The revolution creates four vertices from the rectangle's corners, with edges forming two circular loops for the bases and straight generator connections between corresponding points on the bases in the final B-Rep. Edge loops are formed by connecting the generated curves, and normals are oriented outward by ensuring right-hand rule consistency around face boundaries, resulting in a closed, watertight solid.

Topological and Geometric Queries

Topological queries in boundary representation (B-Rep) models facilitate the extraction of structural relationships among model components, such as adjacency and incidence, without relying on geometric computations. These queries leverage the underlying topological data structures, like the half-edge representation, to traverse the model efficiently. For example, to find adjacent faces, one starts at a given half-edge and follows the twin pointer to access the opposite half-edge, then uses the face pointer to reach the neighboring face; this walking algorithm exploits the bidirectional links maintained in the structure to enumerate all adjacent entities in constant time per step. checks, essential for verifying model integrity, construct an adjacency from the B-Rep where vertices represent topological entities (faces, edges, vertices) and arcs denote incidence or adjacency relations; standard graph algorithms, such as , then identify connected components or detect cycles corresponding to boundary loops. Geometric queries compute quantitative spatial properties between B-Rep elements, often requiring solutions to algebraic equations derived from their parametric definitions. Intersection detection between edges and faces, a core operation, involves substituting the of an edge (e.g., a ) into the equation of a face surface and solving the resulting system for parameter values within valid bounds; algebraic solvers handle the high-degree polynomials typical of NURBS surfaces, while numerical methods like subdivision or provide approximations for complex cases. Ray tracing adapted for queries intersects rays with face boundaries by testing against bounding boxes first, then solving local equations per surface to find entry and exit points. computations evaluate derivatives of the surface parametrization: for a \mathbf{r}(u,v), the coefficients yield K = \frac{eg - f^2}{EG - F^2} and H, computed at specific points to assess local . queries, such as minimum between a point and a face, project the point onto the surface along the normal and minimize the subject to parameter constraints. Modification operations alter the B-Rep topology while preserving validity, typically through sequences of Euler operators that adjust , , and face incidences to maintain the Euler-Poincaré characteristic V - E + F = 2 for a single closed orientable boundary. Edge splitting inserts a new along an existing using operators like make-vertex-and-edges (which creates two new half-edges and updates adjacencies), enabling refinement without disrupting . Face trimming computes intersection curves between a trimming loop and the face surface, then splits the face into co-bounded sub-faces by redefining loop structures and reassigning half-edges. Healing gaps addresses minor topological defects, such as sliver faces or dangling s, by detecting near-degeneracies via distance thresholds and applying rectification through contraction or snapping to restore manifold properties. Boolean operations on B-Rep models, including , , and , combine two by first performing exhaustive geometric intersections to classify elements relative to each other, followed by topological merging to assemble the output . The process identifies intersecting -face pairs, computes their intersection curves (parameterized and segmented at vertices), and classifies intervals as entering, exiting, or based on containment tests; merging then discards invalid portions and reconnects half-edges across the shared using Euler-like operators to form the resultant . Efficiency for queries on complex B-Rep models is enhanced by spatial indexing structures, such as bounding volume hierarchies (BVH), which partition the model's faces into a of enclosing volumes (e.g., axis-aligned bounding boxes or oriented spheres) to prune non-intersecting candidates during traversal. Building the BVH involves recursively splitting the face set based on surface area or spatial median, with query time scaling as O(\log n + k) where n is the number of faces and k the output size, significantly accelerating intersection and proximity tests in large assemblies.

Comparisons and Alternatives

Versus Constructive Solid Geometry

(CSG) represents solid objects through a composed of primitive shapes, such as spheres, cylinders, and boxes, combined using operations like , , and to define the implicit volume of the object. This procedural approach stores the model as an unevaluated expression tree, where leaves represent primitives or transformations, and internal nodes denote the operations applied. In contrast to boundary representation (B-Rep), which explicitly defines the surfaces, edges, and vertices bounding the solid, CSG relies on recursive evaluation to determine the , making it implicit rather than direct. B-Rep is particularly suited for precise surface editing and detailed topological manipulations, while CSG excels in and of complex assemblies through high-level operations. B-Rep offers advantages in and applications, as it provides direct access to facets and adjacency information for rendering and toolpath generation. However, it requires more storage for models with filleted or curved features due to the explicit of boundaries, and operations can be computationally intensive. CSG, conversely, achieves compactness through its tree-based storage, reducing data volume for simple , but lacks inherent adjacency data, complicating and modifications. Hybrid approaches often integrate CSG and B-Rep by using CSG trees for user-friendly modeling and parametric control, then evaluating them to generate B-Rep models for rendering, analysis, and , as seen in systems like Pro/ENGINEER. This combination leverages CSG's intuitiveness for design while exploiting B-Rep's efficiency in downstream computations.

Versus Parametric and Voxel Methods

Parametric surface modeling relies on mathematical equations to define curves and surfaces, such as Non-Uniform Rational B-Splines (NURBS) commonly used in (CAD) systems for precise geometric descriptions. Boundary representation (B-Rep) extends this approach by integrating topological structures—such as faces, edges, and vertices—with these surfaces to model complete solid volumes, ensuring unambiguous and interior-exterior distinctions. This combination allows B-Rep to represent solids with the mathematical accuracy of methods while adding the relational data necessary for operations like Boolean unions. In contrast, voxel-based representations discretize space into a regular grid of volume elements (voxels), each assigned a value indicating material occupancy or density, which is prevalent in fields like medical imaging for volumetric data handling. B-Rep achieves vector-based exactness at boundaries through continuous parametric definitions, avoiding the aliasing and resolution-dependent artifacts inherent in voxel grids where surfaces appear stair-stepped. This makes B-Rep superior for applications requiring sharp, precise contours, whereas voxels excel in capturing internal volume properties without explicit boundary topology. Key trade-offs between B-Rep and these alternatives highlight their respective strengths: B-Rep provides high-fidelity ideal for processes like CNC , but it demands significant computational resources for operations on complex topologies due to the need to maintain manifold consistency. Parametric methods alone, while efficient for surface design, lack the solid enclosure needed for volumetric analysis, and approaches simplify simulations involving physical properties like or fluid flow but compromise accuracy, often requiring higher resolutions to mitigate errors. Converting between representations poses challenges, particularly from voxels to B-Rep via the algorithm, which generates triangular meshes approximating isosurfaces from scalar data by evaluating configurations within each . However, this method suffers limitations in feature preservation, such as topological ambiguities that can produce holes or inconsistent connectivity, and it tends to smooth sharp edges, failing to capture fine geometric details without additional refinements. Geometric queries, as used in B-Rep operations, can assist in post-processing these conversions to enforce topological validity.

Historical and Technical Evolution

Origins and Development

The origins of boundary representation (B-Rep) in (CAD) trace back to the 1960s, drawing heavily from concepts in and to model three-dimensional solids through their bounding surfaces. Topological principles, such as (V - E + F = 2 for polyhedra), provided a foundation for ensuring the consistency and integrity of surface representations, while differential geometry informed the handling of curved boundaries and surface continuity. These mathematical underpinnings enabled early efforts to shift beyond simple wireframe models—limited to edges without volumetric information—toward unambiguous solid representations that captured both geometry and . A pivotal milestone came in 1963 with Ivan Sutherland's system, which introduced interactive and constraint-based shape manipulation on a display, laying the groundwork for CAD by allowing users to create and edit vector-based drawings with topological rings for maintaining relationships between elements. This wireframe-oriented approach marked the transition from manual drafting to digital interaction but highlighted the need for fuller to define enclosed volumes. In the early 1970s, Bruce Baumgart advanced B-Rep with the winged-edge at , a topological framework for polyhedral solids that used edge-centered records with pointers to adjacent faces and vertices, facilitating efficient traversal and modifications while assuming manifold . By 1974, Ian Braid's BUILD system at the formalized B-Rep for general solids bounded by planar and curved faces, introducing operators for constructing and manipulating boundary complexes in a CAD context. This work solidified the 1970s shift from wireframe to , enabling precise volumetric definitions essential for engineering applications. Early implementations, however, faced challenges in handling non-manifold —where edges or vertices connect more than two faces— as structures like winged-edge were designed primarily for orientable manifolds, complicating representations of complex assemblies. Additionally, issues arose from in defining boundaries, leading to errors in computations and surface alignments.

Key Advancements and Challenges

In the 1980s, boundary representation (B-Rep) models saw significant advancements through the integration of Non-Uniform Rational B-Splines (NURBS) for representing freeform surfaces, enabling more precise and flexible modeling of complex curves and surfaces beyond simple planar or primitives. This integration, pioneered in systems like Boeing's framework, allowed B-Rep to handle rational spline representations, which are invariant under affine transformations and suitable for applications in and . By embedding NURBS as the geometric kernel within topological structures, these developments facilitated smoother transitions between parametric surfaces and B-Rep boundaries, reducing approximation errors in freeform geometry. During the 1990s, further progress emerged in boundary recovery algorithms that converted (CSG) representations into explicit B-Rep models, addressing the limitations of CSG's implicit nature for detailed surface operations. Techniques such as boundary tracking and polygonization directly extracted polygonal meshes from CSG solids, improving efficiency for rendering and machining by generating watertight B-Rep boundaries without intermediate volumetric computations. These methods, often involving ray-casting or edge-loop detection, became foundational for hybrid modeling workflows, where CSG's hierarchical construction complemented B-Rep's explicit . Post-2010 advancements have leveraged GPU acceleration to enhance geometric queries in B-Rep, such as detection and proximity computations, enabling faster in large-scale simulations. Parallel algorithms on GPUs, utilizing or for boundary element methods, have reduced query times from seconds to milliseconds for complex assemblies, with speedups of up to 100x compared to CPU-based approaches on high-end hardware like cards. This has been particularly impactful for real-time in dynamic environments, where B-Rep's precise boundaries are tessellated on-the-fly for parallel evaluation. From 2020 onward, techniques have driven further evolution in B-Rep, particularly through generative models for automated CAD creation. Diffusion-based models like BrepDiff and BrepGen enable direct generation of editable B-Rep structures from sketches or text prompts, decoupling and for complex designs. architectures, such as BRT, facilitate learning hierarchical representations of B-Rep components, improving retrieval and segmentation tasks in large CAD datasets as of 2025. These integrations address by automating boundary construction, though challenges persist in ensuring topological validity and with legacy kernels. Despite these gains, topological robustness remains a persistent challenge in B-Rep, primarily due to errors that can produce sliver faces—degenerate, near-zero-area polygons that disrupt manifold during Boolean operations or . Such artifacts arise from accumulated rounding errors in edge intersections, leading to inconsistent adjacency relations that invalidate queries like volume computation or slicing. Mitigation strategies, including exact arithmetic predicates or tolerance-based snapping, have been proposed but often precision for reliability in parametric surfaces. Scalability issues also hinder B-Rep in modern CAD for large assemblies, where models exceeding thousands of components strain and due to the explicit storage of all topological and geometric entities. For instance, assembling aircraft parts with millions of edges can lead to exponential growth in intersection calculations, causing performance degradation beyond 10,000 faces per component without hierarchical partitioning. Lightweight schemes, such as selective or level-of-detail representations, help but require careful management to preserve B-Rep integrity across scales. B-Rep data structures have evolved from the winged-edge model, which efficiently navigated half-edges for traversal but struggled with non-manifold topologies, to more versatile modern implementations incorporating selective geometry storage. Contemporary kernels, such as those in , enhance this foundation with modular classes for edges, faces, and shells, supporting of geometric data to optimize memory for complex hierarchies. These enhancements include topological classifiers and curve-on-surface representations, enabling robust handling of trimmed NURBS while maintaining compatibility with legacy winged-edge traversals. Advancements in computing power have driven a shift toward B-Rep approaches, combining explicit boundaries with implicit or voxel-based methods to support applications like (VR) modeling. In VR environments, where sub-millisecond rendering is essential, models offload detailed B-Rep computations to offline preprocessing, using simplified proxies for interactive manipulation, thus leveraging multi-core CPUs and GPUs for immersive design reviews. This evolution has expanded B-Rep's utility from static CAD to dynamic simulations, though it introduces integration challenges in maintaining topological consistency across representation modes.

Standards and Applications

Standardization Efforts

Standardization efforts for boundary representation (B-Rep) have primarily focused on developing neutral formats to enable interoperable exchange of geometric and topological data between CAD systems, with (STEP) emerging as the cornerstone protocol. The STEP standard, formally known as the Standard for the Exchange of Product model data, defines schemas for representing B-Rep solids through explicit and , as outlined in ISO 10303-42 for geometric and topological . Earlier application protocols within STEP, such as AP203 for configuration-controlled designs of parts and assemblies and AP214 for core data for automotive design processes, now superseded by AP242, incorporated B-Rep schemas to support precise exchange of boundary-based models, including faces, edges, and vertices. The evolution of these standards began with the initial release of STEP in 1994, which established a foundation for product data exchange but initially emphasized basic B-Rep capabilities. Subsequent updates in the enhanced support for advanced surfaces and integrated workflows; for instance, AP242, first published in 2014 with subsequent editions in 2020, 2022, and 2025 as the protocol for managed model-based , extends B-Rep representation to include features, product information, and structures while maintaining topological fidelity. Further editions in 2022 and 2025 have introduced support for additive setups and electrical wire harnesses, enhancing B-Rep interoperability. Prior to STEP's dominance, the , developed in the and widely adopted in the pre-1990s era, offered limited B-Rep support by primarily exchanging disconnected surfaces rather than full topological connectivity, often resulting in incomplete solid models upon import. In contrast, STEP provides comprehensive topological fidelity, enabling robust transfer of manifold B-Rep solids without degradation of adjacency relationships between entities. For proprietary environments, the SAT file format serves as a common exchange mechanism, encoding B-Rep data in a human-readable ASCII derived from the geometric modeling kernel, though it remains tied to licensed implementations. Despite these advancements, faces challenges such as loss of during between systems, where numerical tolerances in curves and surfaces may not align, leading to gaps or overlaps in B-Rep boundaries. Validation through addresses these issues by verifying implementations against STEP schemas, using test suites to check for syntactic correctness, semantic accuracy, and topological integrity in B-Rep data.

Modern Implementations and Uses

Boundary representation (B-Rep) serves as the core modeling kernel in numerous contemporary (CAD) systems, enabling precise geometric operations essential for engineering workflows. (OCCT), an open-source library, powers FreeCAD's parametric modeling capabilities, providing robust B-Rep support for creating and manipulating in a customizable environment. Commercial kernels like , developed by , underpin and NX, facilitating advanced boundary-based for mechanical design and simulation integration. Similarly, from drives and Inventor, offering reliable B-Rep handling for architectural and product design tasks requiring exact surface definitions. In CAD/CAM applications, B-Rep excels in precision by representing complex parts with topological accuracy, allowing for direct toolpath generation and machining simulations without loss of geometric fidelity. For , B-Rep models enable efficient boundary extraction and slicing algorithms that preserve surface details during layer-by-layer fabrication, reducing errors in additive of intricate components. Post-2020 advancements in leverage to convert 3D scans into editable B-Rep models; for instance, supervised networks like BRepDetNet detect boundaries and junctions from point clouds, automating the reconstruction of CAD-ready solids from physical artifacts. Emerging integrations highlight B-Rep's versatility beyond traditional CAD. In (BIM) for , B-Rep facilitates automated model generation from data, creating interoperable representations for energy analysis and structural design while adhering to standards like IFC. For finite element analysis (FEA) simulations, B-Rep provides exact boundary conditions on CAD geometries, enabling immersed boundary methods that embed precise domains into meshes for accurate and predictions without intermediate defeatureing. Despite these strengths, practical limitations persist, particularly for shapes where B-Rep's explicit leads to file size bloat due to extensive for numerous faces and edges, complicating and processing in high-complexity models. Open-source advancements, such as enhanced B-Rep tools in libraries like Open CASCADE, address some gaps by supporting hybrid workflows in animation software, though polygonal meshes remain dominant for dynamic simulations.

References

  1. [1]
    [PDF] Solid models and B-REP
    Solid modelling. B-Rep model. « Boundary representation ». Model based on the representation of surfaces. Model of exchange (STEP format) and definition.
  2. [2]
    B-rep vs. implicit modeling: Understanding the basics - nTop
    Mar 12, 2019 · B-rep models consist of topological objects (informally, “topology”), which are backed by an underlying shape or geometry, in this case all ...Precise B-reps · Meshes · Distance fields · Visualizing distance fields
  3. [3]
    The technological foundations of CAD software - Shapr3D
    Mar 21, 2023 · Boundary representation (b-rep) was developed independently both by Ian C. Braid and Bruce G. Baumgart in the early '70s. Despite all of its ...
  4. [4]
    The Main Benefits and Disadvantages of BRep Modeling - Blog
    Jun 12, 2019 · BRep is a mathematically precise representation of a 3D object. This representation defines the geometric boundaries between solid and non-solid geometries.
  5. [5]
    Boundary Representation - an overview | ScienceDirect Topics
    Boundary representation (B-Rep) CAD models represent a volume via the formal definition of its surface boundary. This representation is commonly applied in ...Missing: history | Show results with:history
  6. [6]
    [PDF] 56 SOLID MODELING - Purdue Computer Science
    In boundary representation (Brep) the solid surface is represented as a quilt of faces, edges, and vertices. A distinction is drawn between the topological ...
  7. [7]
    [PDF] SOLID MODELING
    Boundary representation is the principle solid modelling method used in modern CAD/CAM systems. Boundary Representation, or B-rep for short, can be considered ...
  8. [8]
    [PDF] sum of volumes, part i. - data structure and difference operation
    Because ASV performs operations on the boundary of volumes, each object must be a closed surface that forms the closure of an open set of finite extent in E3.
  9. [9]
    [PDF] Geometric Algorithms and Data Representation for Solid Freeform ...
    Thus by looking at the orientation of a face we can tell on which side solid material lies – which side is the interior of the part and which the exterior.<|control11|><|separator|>
  10. [10]
    Boundary Representations
    The orientation of each face is important. Normally, a face is surrounded by a set of vertices. Using the right-handed rule, the ordering of these vertices for ...
  11. [11]
    The synthesis of solids bounded by many faces
    The algorithms described in this paper restrict object faces to lie in surfaces which are either planes or circu- lar cylinders, and edges to lie in curves ...
  12. [12]
    [PDF] Representations for Rigid Solids: Theory, Methods, and Systems
    The third part briefly surveys extant geometric modeling systems and then applies the concepts developed in the paper to the high-level design of a multiple* ...
  13. [13]
    An introduction to solid modeling : Mäntylä, Martti, 1955
    Jul 19, 2021 · An introduction to solid modeling ; Publication date: 1988 ; Topics: Computer graphics, Solids ; Publisher: Rockville, Md. : Computer Science Press.
  14. [14]
    [PDF] Efficient non-manifold boundary representation with inclusion topology
    Non-manifold boundary (NMB) representations supply a unified representation for the wireframe model, the surface model, the solid model, and their mixtures.
  15. [15]
    [PDF] CAD Reconstruction by B-Rep Chain Complex Generation - Hao Pan
    We view the reconstruction of CAD models in the boundary representation. (B-Rep) as the detection of geometric primitives of different orders, i.e. , ver- tices ...
  16. [16]
    [PDF] Algorithms for reverse engineering boundary representation models
    Building the boundary representation model. In order to build the B-rep model we have to compute all the edges and vertices explicitly. As discussed earlier ...Missing: core seminal
  17. [17]
    [PDF] CAD embedded reparameterization of trimmed B-rep geometry ...
    Apr 6, 2020 · The B-rep consisting out of trimmed NURBS patches in (b) is triangulated (c) and feature points and lines are extracted. Subsequently a frame- ...
  18. [18]
    Partial Entity Structure: A Compact Boundary Representation for ...
    In a non-manifold model, a vertex can be adjacent to an arbitrary number of two-manifold surfaces. Note that a two-manifold surface is formed by a group of ...
  19. [19]
    [PDF] 42 GEOMETRIC INTERSECTION - CSUN
    dard boundary representation, such as a DCEL or winged-edge data structure (see. Chapter 67.2.3), and that it is possible to access a random edge or vertex ...
  20. [20]
    (PDF) GWB: A Solid Modeler with Euler Operators - Academia.edu
    At a lower description level, those modeling operators are based on Euler operators acting directly on the faces, edges and vertices of the B-Rep models.
  21. [21]
    Boundary Representation Model Rectification - ScienceDirect.com
    Mäntylä. An Introduction to Solid Modeling (1988). 5. T. Sakkalis, G. Shen, N.M. Patrikalakis. Representational validity of boundary representation models.
  22. [22]
    [PDF] Efficient Collision Detection Using Bounding Volume Hierarchies of ...
    form of bounding volume hierarchy (“BV-tree”). Our main contributions ... (boundary representation) of the convex hull of Sn, and uses it to perform ...
  23. [23]
    [PDF] Lecture 17: Solid Modeling
    Three types of solid modeling techniques are common in computer graphics: constructive solid geometry (CSG), boundary representations (B-Rep), and octrees.
  24. [24]
    [PDF] CMSC 425: Lecture 14 Solid Modeling - UMD Computer Science
    The first is based on representing an object's boundary surface, called a boundary representation or B-rep for short. ... edge data structure, the half-edge data ...
  25. [25]
    [PDF] Solid Modeling Basics - Stony Brook Computer Science
    B-REP vs. CSG ? • Using: CSG is more intuitive. • Computing: BREP is more convenient. • Modern CAD Systems: •. CSG for GUI (feature tree). •. B-REP for internal ...
  26. [26]
    [PDF] Geometric Modeling - Engineering and Computer Science
    Boundary representation does not guarantee that a group of boundary surfaces (often polygons) form a closed solid. The data are also not in the ideal form for ...
  27. [27]
    Replacing NURBS surfaces with analytic surfaces based on ...
    In 3D CAD models, shapes are represented using the boundary representation (B-rep) method. ... We proposed a method for identifying and replacing NURBS surfaces ...
  28. [28]
    [PDF] Marching cubes: A high resolution 3D surface construction algorithm
    Marching cubes creates triangle models of constant density surfaces from 3D data using a divide-and-conquer approach, processing data in scan-line order.
  29. [29]
    [PDF] A survey of the marching cubes algorithm - CGL @ ETHZ
    The marching cubes algorithm is a cell-by-cell method for extracting isosurfaces from scalar volumetric data, and is a popular isosurfacing algorithm.
  30. [30]
    [PDF] Winged Edge Polyhedron Representation - DTIC
    Introduction to Body, Face, Edge, Vertex Modeling. II. Data Structure of Winged Edge Polyhedra. A. Winged Edge Structure. B. Winged Edge Operations. C ...
  31. [31]
    Boundary Representation - an overview | ScienceDirect Topics
    A boundary representation (BRep) of an object is a geometric and topological description of its boundary. The object boundary is segmented into a finite number ...
  32. [32]
    [PDF] Sketchpad: A man-machine graphical communication system
    Ivan Sutherland's Sketchpad is one of the most influential computer pro- grams ever written by an individual, as recognized in his citation for the Tur-.
  33. [33]
    [PDF] On NURBS: a survey - IEEE Computer Graphics and Applications
    three major groups looked at the possibility of using NURBS. Boeing began developing the Tiger system in 1979. Integrating B-splines6-' with rational Bezier ...
  34. [34]
    3D geometric modelling based on NURBS: a review - ScienceDirect
    The aim of this article is to provide a survey of Non-Uniform Rational B-Splines (NURBS) surface properties and available modelling techniques. In the remaining ...Missing: seminal | Show results with:seminal<|separator|>
  35. [35]
    From Voelcker's Boundary Evaluation to Discrete Paradigms
    But the main computational problem was Boundary Evaluation: the process of converting CSG trees to Boundary Representations (BReps) with explicit faces, edges ...
  36. [36]
    Efficient polygonization of CSG solids using boundary tracking
    In this paper, we propose a procedure that directly polygonizes the boundary surface of CSG solids. The procedure consists of a preprocessing step and a ...Missing: research | Show results with:research
  37. [37]
    Accelerated parallel computation of field quantities for the boundary ...
    The work presented in the paper considered two GPU-based accelerators: a desktop graphics card (GTX 760) and a purpose-built accelerator (NVIDIA Tesla K40c).
  38. [38]
    Accelerating geometric queries using the GPU - ResearchGate
    Oct 5, 2009 · In this paper, we provide a hybrid CPU/GPU framework to accelerate minimum distance computations, which is expanded from our previous ...
  39. [39]
    [PDF] b-rep boolean resulting model repair by correcting intersection ...
    Oct 16, 2023 · Unlike mesh or polyhedral models, whose errors mainly come from float errors, parametric B-rep models' error composition is more complex.
  40. [40]
    [PDF] The Problem of Accuracy and Robustness in Geometric Computation
    However, the topology influences whether the error accumulation leads only to inaccuracy or also to internal inconsistency of the output. Although we discussed ...Missing: sliver | Show results with:sliver
  41. [41]
    Exact, robust, and efficient regularized Booleans on general 3D ...
    In this paper, we propose a novel approach addressing the main concerns of Booleans altogether: robustness, input/output topology generalization, efficiency, ...
  42. [42]
    [PDF] LARGE CAD MODEL CHALLENGES - Dell
    Even models for much smaller products may incorporate multiple, complex sub- assemblies, as well as metadata, material properties, and other information. And as.Missing: B- | Show results with:B-<|separator|>
  43. [43]
    Three-dimensional (3D) CAD model lightweight scheme for large ...
    Aug 10, 2025 · This algorithm aims at reducing the sizes of 3D CAD models within five steps and three levels from coarse to fine: components (including sub- ...
  44. [44]
    [PDF] The Winged-Edge Data Structure
    Another simple method is adding an auxiliary edge between each inner loop and the outer loop as shown below. This auxiliary edge will have the same face for ...
  45. [45]
    Data Structures - Open CASCADE Technology
    Apr 24, 2015 · CBRepClass_Edge, This class is used to send the description of an Edge to the classifier. It contains an Edge and a Face. So the PCurve of the ...
  46. [46]
    Modeling Data - OPEN CASCADE
    Modeling Data supplies data structures to implement boundary representation (BRep) of objects in 3D. In BRep the shape is represented as an aggregation of ...
  47. [47]
    Glossary | Hybrid Modeling - Spatial Corp
    When visualization, rendering and animation are required, BRep just doesn't have the processing power. The mathematical precision of BRep makes it ideal for ...Missing: VR | Show results with:VR
  48. [48]
    ISO 10303-42:2024 - Geometric and topological representation
    A ruled surface with B-spline boundary curves can however be exactly represented by the B-spline surface entity. spatial occupancy forms of solid models (such ...
  49. [49]
    ISO 10303 - Wikipedia
    STEP can be typically used to exchange data between CAD, computer-aided manufacturing, computer-aided engineering, product data management/enterprise data ...Missing: Rep | Show results with:Rep
  50. [50]
    ISO 10303-242:2020 - Industrial automation systems and integration ...
    This document specifies the application module for AP242 managed model based 3D engineering. The following are within the scope of this document:Missing: B- Rep
  51. [51]
    ISO 10303 STEP Standards - STEP Tools
    STEP (ISO 10303) is a standard for exchanging digital product information. AP242, part of STEP, is used for CAD data import/export.Missing: B- | Show results with:B-
  52. [52]
    3D Formats Overview: IGES - CAD Exchanger
    May 1, 2020 · Unlike other B-Rep-based formats which followed that format, IGES tries to describe a body primarily via a set of disconnected surfaces instead ...Missing: fidelity | Show results with:fidelity
  53. [53]
    (PDF) A Review and Comparison of IGES and STEP - ResearchGate
    This paper reviews the development in IGES and STEP by categorizing their topics of researches, key players and years of publications ranging from 2000 to 2009
  54. [54]
    ACIS Format: Complete Guide to CAD Data Interoperability
    The two ACIS file formats (.sat and .sab) offer complementary options for data exchange, allowing users to choose between human readability (SAT) and storage ...
  55. [55]
    [PDF] An Analysis of Step, Jt, and Pdf Format Translation Between ...
    Jan 1, 2012 · step in the translation process, for an error to occur or values to lose precision. The direct translation process, in theory, has potential ...
  56. [56]
    [PDF] Development plan: STEP conformance testing service
    Conformance testing helps ensure better reliability, functionality, and more rapid commercialization of products. It is essential that implementation validation ...
  57. [57]
    Convert FreeCAD to SOLIDWORKS - CAD Exchanger
    FreeCAD is a customizable, open-source paramentic 3D CAD and BIM software with FEM support, built on the Opencascade geometric kernel.
  58. [58]
    What is a geometric modeling kernel? - Engineering.com
    Feb 22, 2024 · A geometry kernel provides the core functionality for creating, manipulating, and analyzing geometric entities and solid models.
  59. [59]
    B-Rep - Definition & CAD Modeling - Spatial Corp
    B-Rep, short for Boundary Representation, is a method used in solid modeling and computer-aided design (CAD) to represent the shape of a 3D object using its ...
  60. [60]
    Slicing and support structure generation for 3D printing directly on B ...
    May 22, 2019 · This paper proposes a slicing and support structure generation algorithm for 3D printing directly on boundary representation (B-rep) models.
  61. [61]
    BRep Boundary and Junction Detection for CAD Reverse ... - arXiv
    Sep 21, 2024 · In this paper, we propose a supervised boundary representation (BRep) detection network BRepDetNet from 3D scans of CC3D and ABC dataset.Ii Brep Data Annotation... · Ii-A Annotation Quality... · Iv Experimental Results
  62. [62]
    Towards Automated BIM and BEM Model Generation using a B-Rep ...
    Oct 18, 2024 · This paper introduces an automated method for creating B-Rep models from 3D surveying data using topological elements for BIM and BEM model ...Missing: integration | Show results with:integration
  63. [63]
    Exact 3D boundary representation in finite element analysis based ...
    Apr 27, 2015 · This paper proposes a novel Immersed Boundary Method where the embedded domain is exactly described by using its Computer-Aided Design (CAD) ...
  64. [64]
    Introduction to OpenCascade and CAD modelling kernels
    Apr 24, 2021 · In this regard, B-rep is a trade-off giving enough convenience for both a computer and a human perception. Again, you can attach your attributes ...