An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...