/**
 * Compute a bounding polygon with a fixed given number of vertices such that the area would be minimal
 * Uses combinatorial sets of edges to find the subset, which when extending those edges produces poly with minimum area
 * NOTE: very very slow as it's O(n^k) where n is number of edges and k is number of points on the desired bounding polygon
 *
 * @param {number[]|Float32Array} output result will be written here
 * @param {number} output_offset offset into output array where to write the result
 * @param {number} output_point_count number of points to comprise bounding polygon
 * @param {number[]} input_points Points to be bounded, must be an ordered loop. Must form a convex hull
 * @param {number} input_point_count number of points in the input to consider
 * @returns {number} number of points added to the output
 *
 * @see 2014 "Implementation of linear minimum area enclosing triangle algorithm" Ovidiu Pârvu & David Gilbert
 * @see https://github.com/MagnusTiberius/humus3/blob/9d43412d6e6be869e224817f0a966fe48a1af40f/Util/ConvexHull.cpp#L281
 */
export function fixed_convex_hull_humus(output: number[] | Float32Array, output_offset: number, output_point_count: number, input_points: number[], input_point_count: number): number;
//# sourceMappingURL=fixed_convex_hull_humus.d.ts.map