import { INode, ICombo } from '@antv/g6-core';
export interface PolyPoint {
    x: number;
    y: number;
    id?: string;
}
export type PBBox = Partial<{
    x: number;
    y: number;
    minX: number;
    minY: number;
    maxX: number;
    maxY: number;
    height: number;
    width: number;
    centerX: number;
    centerY: number;
}>;
export declare const getBBoxFromPoint: (point: PolyPoint) => PBBox;
export declare const getBBoxFromPoints: (points?: PolyPoint[]) => PBBox;
export declare const isBBoxesOverlapping: (b1: PBBox, b2: PBBox) => boolean;
export declare const filterConnectPoints: (points: PolyPoint[]) => PolyPoint[];
export declare const simplifyPolyline: (points: PolyPoint[]) => PolyPoint[];
export declare const getSimplePolyline: (sPoint: PolyPoint, tPoint: PolyPoint) => PolyPoint[];
export declare const getExpandedBBox: (bbox: any, offset: number) => PBBox;
export declare const isHorizontalPort: (port: PolyPoint, bbox: PBBox) => boolean | number;
export declare const getExpandedBBoxPoint: (bbox: any, point: PolyPoint, anotherPoint: PolyPoint) => PolyPoint;
/**
 *
 * @param b1
 * @param b2
 */
export declare const mergeBBox: (b1: PBBox, b2: PBBox) => PBBox;
export declare const getPointsFromBBox: (bbox: PBBox) => PolyPoint[];
export declare const isPointOutsideBBox: (point: PolyPoint, bbox: PBBox) => boolean;
export declare const getBBoxXCrossPoints: (bbox: PBBox, x: number) => PolyPoint[];
export declare const getBBoxYCrossPoints: (bbox: PBBox, y: number) => PolyPoint[];
export declare const getBBoxCrossPointsByPoint: (bbox: PBBox, point: PolyPoint) => PolyPoint[];
/**
 * 曼哈顿距离
 */
export declare const distance: (p1: PolyPoint, p2: PolyPoint) => number;
/**
 * 如果 points 中的一个节点 x 与 p 相等，则消耗 -2。y 同
 * 即优先选择和 points 在同一水平线 / 垂直线上的点
 */
export declare const _costByPoints: (p: PolyPoint, points: PolyPoint[]) => number;
/**
 * ps 经过 p 到 pt 的距离，减去其他路过节点造成的消耗
 */
export declare const heuristicCostEstimate: (p: PolyPoint, ps: PolyPoint, pt: PolyPoint, source?: PolyPoint, target?: PolyPoint) => number;
export declare const reconstructPath: (pathPoints: PolyPoint[], pointById: any, cameFrom: any, currentId: string, iterator?: number) => void;
/**
 * 从 arr 中删去 item
 */
export declare const removeFrom: (arr: PolyPoint[], item: PolyPoint) => void;
export declare const isSegmentsIntersected: (p0: PolyPoint, p1: PolyPoint, p2: PolyPoint, p3: PolyPoint) => boolean;
export declare const isSegmentCrossingBBox: (p1: PolyPoint, p2: PolyPoint, bbox: PBBox) => boolean;
/**
 * 在 points 中找到满足 x 或 y 和 point 的 x 或 y 相等，且与 point 连线不经过 bbox1 与 bbox2 的点
 */
export declare const getNeighborPoints: (points: PolyPoint[], point: PolyPoint, bbox1: PBBox, bbox2: PBBox) => PolyPoint[];
/**
 * sorted array ascendly
 * add new item to proper index when calling add
 */
export declare class SortedArray {
    arr: {
        id: string;
        value: number;
    }[];
    private map;
    constructor();
    private _innerAdd;
    add(item: any): void;
    remove(id: any): void;
    private _clearAndGetMinId;
    private _findFirstId;
    minId(clear: any): any;
}
export declare const pathFinder: (points: PolyPoint[], start: PolyPoint, goal: any, sBBox: PBBox, tBBox: PBBox, os: any, ot: any) => PolyPoint[];
export declare const isBending: (p0: PolyPoint, p1: PolyPoint, p2: PolyPoint) => boolean;
export declare const getBorderRadiusPoints: (p0: PolyPoint, p1: PolyPoint, p2: PolyPoint, r: number) => PolyPoint[];
export declare const getPathWithBorderRadiusByPolyline: (points: PolyPoint[], borderRadius: number) => string;
export declare const getPolylinePoints: (start: PolyPoint, end: PolyPoint, sNode: INode | ICombo, tNode: INode | ICombo, offset: number) => PolyPoint[];
/**
 * 去除连续同 x 不同 y 的中间点；去除连续同 y 不同 x 的中间点
 * @param points 坐标集合 { x: number, y: number, id: string }[]
 * @returns
 */
export declare const removeRedundantPoint: (points: any) => any;