Bitbybit Docs
    Preparing search index...

    Class CrossSectionFromPolygonsPointsDto (Inputs.Manifold)

    Several polygons as points and the fill options for crossSection.crossSectionFromPolygons, for outlines with holes.

    Index

    Constructors

    Properties

    polygonPoints: Point3[][]

    One list of points per polygon; only X and Y are used.

    fillRule?: fillRuleEnum

    Which regions count as inside where polygons overlap: even-odd, non-zero, positive or negative winding.

    positive
    
    removeDuplicates?: boolean

    When true, consecutive repeated points in each polygon, the last and first included, are dropped before building.

    false
    
    tolerance?: number

    How close two points must be to count as repeated, in model units.

    1e-7