Maintaining the Approximate Width of a Set of Points in the Plane

d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. We maintain the set of points under insertions and deletions of points and we are able to report an approximation of the width of this dynamic point set. Our data structure takes linear space and allows for reporting the approximation with relative accuracy  in O( p 1= logn) time; and the update time is O(log2 n). The method uses the tentative prune-and-search strategy of Kirkpatrick and Snoeyink.

• Type: Conference
• Year: 1993
• Where: CCCG
• Authors: Günter Rote, Christian Schwarz, Jack Snoeyink
• Keywords: CCCG 1993, CCCG 2007, Schwarzz Jack Snoeyinkx, Smallest Distance, Tentative Prune-and-search Strategy