类 GrahamScan

En

Graham Scan algorithm for convex hull calculation.

Zh

凸包算法。

构造函数

constructor

方法

getFrom getFromR pListToPointList pointListToPlist scan scanPList

构造函数

constructor

方法

静态getFrom

  • getFrom(rst: any[], src: any[], count: number): any[]

    参数

    • rst: any[]

      The original array is used to add new child elements.

    • src: any[]

      An array used to retrieve child elements.

    • count: number

      The number of child elements to add.

    返回 any[]

    Add the RST object of the child elements.

    En

    Take cout items from the src array at index 0 and add them to the tail of the tst array.

    Zh

    将数组src从索引0位置，依次取cout个项添加至tst数组的尾部。

静态getFromR

  • getFromR(rst: any[], src: any[], count: number): any[]

    参数

    • rst: any[]

      The original array is used to add new child elements.

    • src: any[]

      An array used to retrieve child elements.

    • count: number

      The number of child elements to add.

    返回 any[]

    Add the RST object of the child elements.

    En

    Take cout items from the end index position to the head index position of the src array and add them to the tail of the tst array.

    Zh

    将数组src从末尾索引位置往头部索引位置方向，依次取cout个项添加至tst数组的尾部。

静态pListToPointList

  • pListToPointList(pList: any[], tempUse?: boolean): any[]

    参数

    • pList: any[]

      The Point list.

    • 可选tempUse: boolean

      Whether to use temporary storage.

    返回 any[]

    A list of [x,y...].

    En

    Convert a list of [x,y...] to a list of Points.

    Zh

    将 [x,y...] 列表转换为 Point 列表。

静态pointListToPlist

  • pointListToPlist(pointList: any[]): any[]

    参数

    • pointList: any[]

      The list of Points.

    返回 any[]

    The [x,y...] list.

    En

    Convert a list of Points to a [x,y...] list.

    Zh

    将 Point 列表转换为 [x,y...] 列表。

静态scan

  • scan(PointSet: any[]): any[]

    参数

    • PointSet: any[]

      The Point list.

    返回 any[]

    The minimum polygon vertex set.

    En

    Find the minimum polygon vertex set that includes all points.

    Zh

    寻找包括所有点的最小多边形顶点集合。

静态scanPList

  • scanPList(pList: number[]): void

    参数

    • pList: number[]

      The [x,y...] list.

    返回 void

    En

    Find the minimum polygon vertex set that includes all points.

    Zh

    寻找包括所有点的最小多边形顶点集合。

显示设置

成员可见性

目录

构造函数
方法