Halfedge data structure
The hds module provides a general purpose halfedge data
structure Mesh for 2-manifold meshes with polygonal
faces. The iterators and traits modules build
on the facilities provided by hds and provide convenient
access to both combinatorial and geometric characteristics of a mesh.
Halfedge data structure. |
|
Combinatorial mesh item neighborhood iterators. |
|
Geometric mesh traits. |
|
Mesh item flags. |
Note
The mesh class and many mesh items provide special method implementations, so called double underscore methods or dunder methods for short.