![]()  | 
  
    RobWorkProject
    23.9.11-
    
   | 
 
Half-edge structure. More...
#include <BREP.hpp>
Public Member Functions | |
| HalfEdge (std::size_t curveIndex) | |
| Constructor.  More... | |
| ~HalfEdge () | |
| Destructor.  | |
Public Attributes | |
| std::size_t | curveIndex | 
| Index of the geometric curve data.  | |
| const Vertex * | previousVertex | 
| Pointer to the vertex at beginning of curve (previous and next might be the same vertex).  | |
| const Vertex * | nextVertex | 
| Pointer to the vertex at end of curve (previous and next might be the same vertex).  | |
| const Face * | face | 
| Pointer to the face (all half-edges forming a loop will point to the same face).  | |
| HalfEdge * | nextEdge | 
| Pointer to the next edge in a loop (can be a pointer to itself).  | |
| HalfEdge * | previousEdge | 
| Pointer to the previous edge in a loop (can be a pointer to itself).  | |
| HalfEdge * | oppositeEdge | 
| Pointer to the opposite edge (part of the loop of an adjacent face).  | |
| bool | reversed | 
| True if the curve is in the reverse direction. As a pair of half-edges points to the same curve data, one of the half-edges will have to be reversed.  | |
Half-edge structure.
Each edge in the BREP is represented as a pair of half-edges. A half-edge has pointers to the previous and next vertices, previous and next edges, and a face.
      
  | 
  inline | 
Constructor.
| curveIndex | [in] the curve index (a pair of half-edges will point to the same curve). |