/** @internal NOTE: Internal APIs. Subject to change. Use of these APIs in production applications is not supported. */ /** */
import { Vertex2 } from '.';
/**
 * Given a collection of points(vertices), representing corners of outer edges of a polygon. Calculate
 * the centroid.
 * @param points Points
 * @param dst Where centroid value is written
 * @returns Reference to `dst`
 */
export declare function calculateCentroidVertex2ToRef<T extends Vertex2>(points: IterableIterator<Vertex2>, dst: T): T;
/**
 * Sorts the {@link Vertex2} array in clockwise order IN PLACE SORTING.
 * @param points An array of {@link Vertex2} points. Will be sorted in place, in clockwise order.
 * @returns A reference to `points` (now sorted).
 */
export declare function sortVertex2CW<T extends Vertex2>(points: T[]): T[];
/**
 * Checks if a polygon is self-intersecting.
 * @param polygonPoints An array of {@link Vertex2} polygon corners (points).
 * @returns `true` if the polygon shape is complex, `false` otherwise.
 */
export declare function isComplexPolygonVertex2(polygonPoints: Vertex2[]): boolean;
//# sourceMappingURL=Vertex2.d.ts.map