Bitbybit Docs
    Preparing search index...

    Class FaceSubdivideToHexagonWiresDto<T> (Inputs.OCCT)

    A face, hexagon counts and optional patterns for shapes.face.subdivideToHexagonWires, which lays a honeycomb of hexagon wires over the face's UV range. The patterns are read hexagon by hexagon and repeat when they run out.

    Type Parameters

    • T
    Index

    Constructors

    • Provide options without default values

      Type Parameters

      • T

      Parameters

      • Optionalshape: T
      • OptionalnrHexagonsU: number
      • OptionalnrHexagonsV: number
      • OptionalflatU: boolean
      • OptionalscalePatternU: number[]
      • OptionalscalePatternV: number[]
      • OptionalfilletPattern: number[]
      • OptionalinclusionPattern: boolean[]
      • OptionaloffsetFromBorderU: number
      • OptionaloffsetFromBorderV: number
      • OptionalextendUUp: boolean
      • OptionalextendUBottom: boolean
      • OptionalextendVUp: boolean
      • OptionalextendVBottom: boolean

      Returns FaceSubdivideToHexagonWiresDto<T>

    Properties

    shape: T

    The face to draw the hexagons on.

    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.

    scalePatternU?: number[]

    Sizes of the hexagons along U as fractions of their full size, applied in turn about each hexagon's center; 1 or no list means no scaling.

    undefined
    

    true

    scalePatternV?: number[]

    Sizes of the hexagons along V as fractions of their full size, applied in turn about each hexagon's center; 1 or no list means no scaling.

    undefined
    

    true

    filletPattern?: number[]

    Corner rounding of the hexagons 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 are drawn, applied in turn: true draws one, false skips it.

    undefined
    

    true

    offsetFromBorderU?: number

    A fraction of the U range trimmed at each end before laying the grid, so the pattern keeps 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 pattern keeps clear of the border; keep it below 0.5.

    0
    

    0

    0.5

    0.01

    extendUUp?: boolean

    When true, the grid is stretched so the hexagons at the high end of U reach past that border, covering it without a jagged edge.

    false
    
    extendUBottom?: boolean

    When true, the grid is stretched so the hexagons at the low end of U reach past that border, covering it without a jagged edge.

    false
    
    extendVUp?: boolean

    When true, the grid is stretched so the hexagons at the high end of V reach past that border, covering it without a jagged edge.

    false
    
    extendVBottom?: boolean

    When true, the grid is stretched so the hexagons at the low end of V reach past that border, covering it without a jagged edge.

    false