/**
 * Simple algorithm for computing convex hull, not the fastest, but it does the job and has very small implementation
 * Please note that the result does not repeat the first vertex, meaning that the last point is not the same as the first point
 * NOTE: complexity is O(nh) where h is the number of point on the hull and n is number of input points
 * @see https://en.wikipedia.org/wiki/Gift_wrapping_algorithm
 * @param {number[]|Float32Array|Float64Array} input 2d point set, of form [x0,y0,x1,y1, ... xn,yn]
 * @param {number} point_count number of points in the input set
 * @returns {number[]} indices of vertices from input that make up the hull, this result is ordered to form a closed loop around the hull if followed
 */
export function convex_hull_jarvis_2d(input: number[] | Float32Array | Float64Array, point_count?: number): number[];
//# sourceMappingURL=convex_hull_jarvis_2d.d.ts.map