Bitbybit Docs
    Preparing search index...

    Class CrossSectionFromPolygonPointsDto (Inputs.Manifold)

    One polygon as points and the fill options for crossSection.crossSectionFromPoints.

    Index

    Constructors

    Properties

    points: Point3[]

    The polygon's points in order; only X and Y are used.

    fillRule?: fillRuleEnum

    Which regions of a self-crossing polygon count as inside: even-odd, non-zero, positive or negative winding.

    positive
    
    removeDuplicates?: boolean

    When true, consecutive repeated points, 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