Let S be a set of n points in d-space aild let 1 :5 k :5 n be an integer. A unified approach is given for solving the problem of finding a sub set of S of size k that mjnimizes some closenessâ€¦ (More)

We give an algorithm that computes the closest pair in a set of <italic>n</italic> points in <italic>k</italic>-dimensional space on-line, in <italic>O</italic>(<italic>n</italic> logâ€¦ (More)

Let <italic>V</italic> be a set of <italic>n</italic> points in <italic>k</italic>-dimensional space. It is shown how the closest pair in <italic>V</italic> can be maintained under insertions inâ€¦ (More)

Anaerobic digestion (AD) of sugar beet pressed pulp (SBPP) is a promising treatment concept. It produces biogas as a renewable energy source making sugar production more energy efficient and it turnsâ€¦ (More)

We show how to compute the smallest area parallelogram enclosing a convex n-gon in the plane in linear time, and we describe an application of this result in digital image processing. Related workâ€¦ (More)

We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in D-dimensionalâ€¦ (More)

The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. We maintain the set of points under insertions and deletions of points and we areâ€¦ (More)

Active, widely tunable optical materials have enabled rapid advances in photonics and optoelectronics, especially in the emerging field of meta-devices. Here, we demonstrate that spatially selectiveâ€¦ (More)