Constructors constructor new DVMesh( pts?: ReadonlyVec [] | Pair < ReadonlyVec , T > [] , size?: number ) : DVMesh Parameters Optional pts: ReadonlyVec [] | Pair < ReadonlyVec , T > [] Default value size: number = 100000 Methods add add( p: ReadonlyVec , val?: T , eps?: number , update?: boolean ) : boolean Parameters p: ReadonlyVec Optional val: T Default value eps: number = EPS Default value update: boolean = true Returns boolean addAll addAll( pairs: Iterable < Pair < ReadonlyVec , T > > , eps?: undefined | number ) : void Parameters pairs: Iterable < Pair < ReadonlyVec , T > > Optional eps: undefined | number Returns void addKeys addKeys( pts: Iterable < ReadonlyVec > , eps?: undefined | number ) : void Parameters pts: Iterable < ReadonlyVec > Optional eps: undefined | number Returns void delaunay delaunay( bounds?: ReadonlyVec [] ) : Vec [] [] Parameters Optional bounds: ReadonlyVec [] Returns Vec [] [] edges edges( voronoi?: boolean , boundsMinMax?: VecPair ) : VecPair [] Parameters Default value voronoi: boolean = false Optional boundsMinMax: VecPair Returns VecPair [] locate locate( p: ReadonlyVec , eps?: number ) : [ Edge < Vertex < T > > , boolean ] Parameters p: ReadonlyVec Default value eps: number = EPS Returns [ Edge < Vertex < T > > , boolean ] traverse traverse( proc: Visitor < T > , edges?: boolean , e?: Edge < Vertex < T > > ) : void Parameters Default value edges: boolean = true Default value e: Edge < Vertex < T > > = this.first Returns void voronoi voronoi( bounds?: ReadonlyVec [] ) : Vec [] [] Parameters Optional bounds: ReadonlyVec [] Returns Vec [] [] Legend Class with type parameter Constructor Property Method Function Type alias with type parameter Interface with type parameter
Adds a single new point
pw/ optional valuevalto the mesh, unless there already is another point existing within radiuseps. Ifupdateis true (default), the mesh dual will be automatically updated using DVMesh.computeDual.If adding multiple points, ensure
computeDualwill only be called for/after the last point insertion to avoid computational overhead.