Compact Interval Trees: A Data Structure for Convex Hulls

@inproceedings{Guibas1990CompactIT,
  title={Compact Interval Trees: A Data Structure for Convex Hulls},
  author={Leonidas J. Guibas and John Hershberger and Jack Snoeyink},
  booktitle={SODA},
  year={1990}
}
In this paper, we investigate the problem of finding the common tangents of two convex polygons that intersect in two (unknown) points. First, we give a @(log’ n) bound for algorithms that store the polygons in independent arrays. Second, we show how to beat the lower bound if the vertices of the convex polygons are drawn from a fixed set of n points. We introduce a data structure called a compact interval tree that supports common tangent computations, as well as the standard binary-search… CONTINUE READING

Similar Papers

Loading similar papers…