Groups
Category
A kinetic tournament tree maintains the minimum (or maximum) of moving values whose pairwise order can change over time.
A Li Chao tree maintains a set of lines y = m x + b and answers minimum (or maximum) value queries at a given x in O(log C) time, where C is the numeric range of x.