Intersection of convex objects in two and three dimensions

B. Chazelle, D. P. Dobkin
1987 Journal of the ACM  
One of the basic geometric operations involves determining whether a pair of convex objects intersect. This problem is well understood in a model of computation in which the objects are given as input and their intersection is returned as output. For many applications, however, it may be assumed that the objects already exist within the computer and that the only output desired is a single piece of data giving a common point if the objects intersect or reporting no intersection if they are
more » ... int. For this problem, none of the previous lower bounds are valid and algorithms are proposed requiring sublinear time for their solution in two and three dimensions.
doi:10.1145/7531.24036 fatcat:fgq6o6axxveplige5z7mhmzhk4