Convex hull trick

The convex hull trick is a technique (perhaps best classified as a data structure) used to determine, after preprocessing, which member of a set of linear functions in one variable attains an extremal value for a given value of the independent variable. It has little to do with convex hull algorithms.

History

The convex hull trick is perhaps best known in algorithm competition from being required to obtain full marks in several USACO problems, such as MAR08 "acquire", which began to be featured in national olympiads after its debut in the IOI '02 task Batch Scheduling, which itself credits the technique to a 1995 paper (see references). Very few online sources mention it, and almost none describe it. (The technique might not be considered important enough, or people might want to avoid providing the information to other countries' IOI teams.)

The problem

Suppose that a large set of linear functions in the form $y = m_i x + b_i$ is given along with a large number of queries. Each query consists of a value of $x$ and asks for the minimum value of $y$ that can be obtained if we select one of the linear functions and evaluate it at $x$ . For example, suppose our functions are $y=4$ , $y=4/3+2/3\,x$ , $y=15-3x$ , and $y=3-1/2\,x$ and we receive the query $x=1$ . We have to identify which of htese functions assumes the lowest $y$ -value for $x=1$ , or what that value is. (It is the function $y=4/3+2/3\,x$ , assuming a value of 2.)