UNPKG

vis-network

Version:

A dynamic, browser-based visualization library.

38 lines 1.71 kB
import { BezierEdgeBase } from "./bezier-edge-base"; import { Label, EdgeOptions, Point, VBody } from "./types"; /** * A Base Class for all Cubic Bezier Edges. Bezier curves are used to model * smooth gradual curves in paths between nodes. * * @extends BezierEdgeBase */ export declare abstract class CubicBezierEdgeBase<Via> extends BezierEdgeBase<Via> { /** * Create a new instance. * * @param options - The options object of given edge. * @param body - The body of the network. * @param labelModule - Label module. */ constructor(options: EdgeOptions, body: VBody, labelModule: Label); /** * Calculate the distance between a point (x3,y3) and a line segment from (x1,y1) to (x2,y2). * * @remarks * http://stackoverflow.com/questions/849211/shortest-distancae-between-a-point-and-a-line-segment * https://en.wikipedia.org/wiki/B%C3%A9zier_curve * * @param x1 - First end of the line segment on the x axis. * @param y1 - First end of the line segment on the y axis. * @param x2 - Second end of the line segment on the x axis. * @param y2 - Second end of the line segment on the y axis. * @param x3 - Position of the point on the x axis. * @param y3 - Position of the point on the y axis. * @param via1 - The first point this edge passes through. * @param via2 - The second point this edge passes through. * * @returns The distance between the line segment and the point. */ protected _getDistanceToBezierEdge2(x1: number, y1: number, x2: number, y2: number, x3: number, y3: number, via1: Point, via2: Point): number; } //# sourceMappingURL=cubic-bezier-edge-base.d.ts.map