Expand description
Tessellated face-set lowering into indexed meshes.
§Why a mesh and not topology
A tessellated face set is already a discretisation. Unlike an
IfcFacetedBrep, which is an exact solid whose planar faces happen to be
polygons, a face set carries no adjacency, no bound nesting, and no claim
to exactness. Recovering topology from it means inferring shared edges by
comparing float positions, which invents information the file never had.
So these lower to axiolid-mesh types and stay meshes.
§Authored n-gons survive
IfcPolygonalFaceSet faces are n-gons with optional holes. Triangulating
them here would be a lossy decision taken at read time, in the wrong crate:
a hole-aware tessellator needs a fill rule and a tolerance, both of which
belong to the kernel. PolygonMesh stores the authored loops verbatim, so
the choice stays with whoever consumes the graph.
§Coordinates are shared, indices are not
Both families index one IfcCartesianPointList3D. The point list is read
once and scaled once; faces only carry indices into it. Emitting one vertex
per face corner would multiply a wall’s vertex count by roughly six and
break every consumer that relies on shared positions.
Constants§
- UV_
CHANNEL - Name of the texture-coordinate channel on the lowered mesh.
Functions§
- lower_
polygonal_ face_ set_ node - Lower an
IfcPolygonalFaceSetintoGeometryNode::PolygonMesh. - lower_
triangulated_ face_ set_ node - Lower an
IfcTriangulatedFaceSetintoGeometryNode::TriMesh.