edge_t connecting two vertices: vertex with smaller index is always first \note: hash edge_t is specialized at the bottom

simple structure representing a 3d vector and the operations we will perform with it

simple structure representing a 2d vector and the operations we will perform with it

For each primitive to be stored in the BVH, we store the centroid of its bounding box, its complete bounding box, and its index in the primitives arra

Each BVHBuildNode represents a node of the BVH. All nodes store a BBox, which stores the bounds of all of the children beneath the node. Each interior

:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

The LinearBVHNode structure stores the information needed to traverse the BVH. In addition to the bounding box for each node, for leaf nodes it stores

* Enum of strategies for treating intersecting constraint edges */

Position of a cut surface patch with respect to the input mesh

The winding order of the polygons of a cut surface patch

base struct from which other structs represent connected components inherit

struct defining the state of a context object

* Information about removed duplicated vertices. * * Contains mapping information and removed duplicates indices. * @note vertices {0,1,2,3,4} wher

struct representing a fragment