Builds a cross-section from one polygon given as points; only the X and Y of each point are used.
fillRule decides which regions of a self-crossing polygon count as inside;
removeDuplicates drops consecutive repeated points within tolerance first.
The polygon points, the fill rule and the duplicate handling
The cross-section
Builds a cross-section from several polygons given as points, for instance an outline and its holes; only the X and Y of each point are used.
fillRule decides which regions count as inside where polygons overlap; removeDuplicates
drops consecutive repeated points within tolerance first.
The polygons as point lists, the fill rule and the duplicate handling
The cross-section
Reads a cross-section back as its polygons, each a list of 2D points.
The cross-section
One list of 2D points per polygon
Reads a cross-section back as its polygons with 3D points, Z set to 0, ready for drawing as polylines.
The cross-section
One list of points per polygon
Reads several cross-sections back as their polygons, as crossSectionToPolygons does for
one.
The cross-sections
One polygon list per cross-section, in the same order
Reads several cross-sections back as polygons with 3D points, as crossSectionToPoints does
for one.
The cross-sections
One list of point polygons per cross-section, in the same order
Flat outlines in the Manifold kernel, the 2D shapes that
operations.extrudeandoperations.revolveturn into solids and thatsliceandprojectcut out of them. A cross-section is one or more closed polygons in the XY plane, holes included;shapesbuilds them,booleanscombines them,operationsoffsets, hulls and extrudes them,transformsmoves them andevaluatemeasures them. The methods here convert between cross-sections and plain point lists, and free the memory a cross-section holds.