Options
All
  • Public
  • Public/Protected
  • All
Menu

Type parameters

  • T

Hierarchy

  • DVMesh

Index

Constructors

constructor

  • new DVMesh<T>(pts?: ReadonlyVec[] | Pair<ReadonlyVec, T>[], size?: number): DVMesh<T>
  • Type parameters

    • T

    Parameters

    • Optional pts: ReadonlyVec[] | Pair<ReadonlyVec, T>[]
    • size: number = 1e5

    Returns DVMesh<T>

Properties

first

first: Edge<Vertex<T>>

nextID

nextID: number

Methods

add

  • add(p: ReadonlyVec, val?: T, eps?: number, update?: boolean): boolean
  • Adds a single new point p w/ optional value val to the mesh, unless there already is another point existing within radius eps. If update is true (default), the mesh dual will be automatically updated using DVMesh.computeDual.

    remarks

    If adding multiple points, ensure computeDual will only be called for/after the last point insertion to avoid computational overhead.

    Parameters

    • p: ReadonlyVec
    • Optional val: T
    • eps: number = ...
    • update: boolean = true

    Returns boolean

addAll

  • addAll(pairs: Iterable<Pair<ReadonlyVec, T>>, eps?: number): void
  • Parameters

    • pairs: Iterable<Pair<ReadonlyVec, T>>
    • Optional eps: number

    Returns void

addKeys

  • addKeys(pts: Iterable<ReadonlyVec>, eps?: number): void
  • Parameters

    • pts: Iterable<ReadonlyVec>
    • Optional eps: number

    Returns void

computeDual

  • computeDual(): void
  • Syncronize / update / add dual faces (i.e. Voronoi) for current primary mesh (i.e. Delaunay).

    Returns void

delaunay

  • delaunay(bounds?: ReadonlyVec[]): Vec[][]
  • Parameters

    • Optional bounds: ReadonlyVec[]

    Returns Vec[][]

edges

  • edges(voronoi?: boolean, boundsMinMax?: VecPair): VecPair[]
  • Parameters

    • voronoi: boolean = false
    • Optional boundsMinMax: VecPair

    Returns VecPair[]

locate

  • locate(p: ReadonlyVec, eps?: number): [Edge<Vertex<T>>, boolean]
  • Returns tuple of the edge related to p and a boolean to indicate if p already exists in this triangulation (true if already present).

    Parameters

    • p: ReadonlyVec

      query point

    • eps: number = ...

    Returns [Edge<Vertex<T>>, boolean]

traverse

  • traverse(proc: Visitor<T>, edges?: boolean, e?: Edge<Vertex<T>>): void

voronoi

  • voronoi(bounds?: ReadonlyVec[]): Vec[][]
  • Parameters

    • Optional bounds: ReadonlyVec[]

    Returns Vec[][]

Generated using TypeDoc