/**
 * Relaxes existing convex hull by removing edges until desired cardinality of the hull is reached
 * The algorithm reaches the similar solution as the one proposed by humus, but arrives at a solution much faster as it doesn't need to consider every combination of edges
 * The algorithm is greedy, and thus it can lead to suboptimal cuts, especially on lower number of output vertices
 *
 * @author Alex Goldring
 * @copyright Company Named Limited (c) 2026
 *
 * @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
 * @param {number} input_point_count number of points in the input to consider
 * @returns {number} actual number of points, this can be lower because input polygon has too few points
 */
export function fixed_convex_hull_relaxation(output: number[] | Float32Array, output_offset: number, output_point_count: number, input_points: number[], input_point_count: number): number;
//# sourceMappingURL=fixed_convex_hull_relaxation.d.ts.map