Bitbybit Docs
    Preparing search index...

    Class FaceSubdivideToHexagonHolesDto<T> (Inputs.OCCT)

    A face, hexagon counts and optional patterns for shapes.face.subdivideToHexagonHoles, which cuts a honeycomb of hexagonal holes into the face. Without a scale pattern each hole is half the size of its hexagon.

    Type Parameters

    • T
    Index

    Constructors

    • Provide options without default values

      Type Parameters

      • T

      Parameters

      • Optionalshape: T
      • OptionalnrHexagonsU: number
      • OptionalnrHexagonsV: number
      • OptionalflatU: boolean
      • OptionalholesToFaces: boolean
      • OptionalscalePatternU: number[]
      • OptionalscalePatternV: number[]
      • OptionalfilletPattern: number[]
      • OptionalinclusionPattern: boolean[]
      • OptionaloffsetFromBorderU: number
      • OptionaloffsetFromBorderV: number

      Returns FaceSubdivideToHexagonHolesDto<T>

    Properties

    shape: T

    The face to cut the holes into.

    undefined
    
    nrHexagonsU?: number

    How many hexagons across the U range.

    10
    

    1

    Infinity

    1

    nrHexagonsV?: number

    How many hexagons across the V range.

    10
    

    1

    Infinity

    1

    flatU: boolean

    When true, the hexagons turn a flat side toward the U direction; when false a corner points that way.

    holesToFaces?: boolean

    When true, the result also carries one face per hole after the perforated face.

    false
    
    scalePatternU?: number[]

    Sizes of the holes along U as fractions of their hexagon, applied in turn; leaving the list out uses 0.5.

    undefined
    

    true

    scalePatternV?: number[]

    Sizes of the holes along V as fractions of their hexagon, applied in turn; leaving the list out uses 0.5.

    undefined
    

    true

    filletPattern?: number[]

    Corner rounding of the holes as fractions from 0 to 1 of the largest radius that fits, applied in turn; 0 leaves sharp corners.

    undefined
    

    true

    inclusionPattern?: boolean[]

    Which hexagons become holes, applied in turn: true cuts one, false leaves the face whole there.

    undefined
    

    true

    offsetFromBorderU?: number

    A fraction of the U range trimmed at each end before laying the grid, so the holes keep clear of the border; keep it below 0.5.

    0
    

    0

    0.5

    0.01

    offsetFromBorderV?: number

    A fraction of the V range trimmed at each end before laying the grid, so the holes keep clear of the border; keep it below 0.5.

    0
    

    0

    0.5

    0.01