Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
This paper considers the design of a camera path through a scene. Given a valid set of keyframes for the camera, we want to build a camera path that avoids collisions with the sce...
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...