Abstract

There are many problems in computational geometry for which the best know algorithms take time (n2) (or more) in the worst case while only very low lower bounds are known. In this paper we describe a large class of problems for which we prove that they are all at least
... read more