Abstract.
We revisit the notion of kinetic efficiency for noncanonically defined discrete attributes of moving data, like binary space partitions and triangulations. Under reasonable computational models, we obtain lower bounds on the minimum amount of work required to maintain any binary space partition of moving segments in the plane or any Steiner triangulation of moving points in the plane. Such lower bounds—the first to be obtained in the kinetic context—are necessary to evaluate the efficiency of kinetic data structures when the attribute to be maintained is not canonically defined.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received June 10, 1999, and in revised form March 9, 2000. {\it Online publication August\/ 11, 2000.}
Rights and permissions
About this article
Cite this article
Agarwal, P., Basch, J., de Berg, M. et al. Lower Bounds for Kinetic Planar Subdivisions . Discrete Comput Geom 24, 721–733 (2000). https://doi.org/10.1007/s004540010060
Issue Date:
DOI: https://doi.org/10.1007/s004540010060