Maintaining the extent of a moving point set


Journal Article

Let S be a set of n moving points in the plane. We give new efficient and compact kinetic data structures for maintaining the diameter, width, and smallest area or perimeter bounding rectangle of S. If the points in S move with algebraic motions, these structures process O(n2+δ) events. We also give constructions showing that Ω(n2) combinatorial changes are possible for these extent functions even if each point is moving with constant velocity. We give a similar construction and upper bound for the convex hull, improving known results.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Guibas, LJ; Hershberger, J; Veach, E

Published Date

  • January 1, 2001

Published In

Volume / Issue

  • 26 / 3

Start / End Page

  • 353 - 374

International Standard Serial Number (ISSN)

  • 0179-5376

Digital Object Identifier (DOI)

  • 10.1007/s00454-001-0019-x

Citation Source

  • Scopus