Smallest k-Enclosing Rectangle

Given $n$ unweighted points in the plane, and given an integer $k$ , compute the smallest (area or perimeter) axis-aligned rectangle enclosing exactly $k$ points.

Parameters

$n$ : number of points
$k$ : number of points desired in rectangle

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Displaying 1 of 1 reductions

			See more
(min, +) Convolution	Smallest k-Enclosing Rectangle	2019

Other relevant algorithms