Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Near-Quadratic Bounds for the $L_{1}$ Voronoi Diagram of Moving Points

Near-Quadratic Bounds for the $L_{1}$ Voronoi Diagram of Moving Points

File(s)
93-1348.ps (155.32 KB)
93-1348.pdf (648.93 KB)
Permanent Link(s)
https://hdl.handle.net/1813/6118
Collections
Computer Science Technical Reports
Author
Chew, L. Paul
Abstract

Given a set of $n$ moving points in the plane, how many topological changes occur in the Voronoi diagram of the points? If each point has constant velocity then there is an upper bound of $O(n^{3})$ [Guibas, Mitchell and Roos] and an easy lower bound of $\Omega(n^{2})$. It is widely believed that the true upper bound should be close to $O(n^{2})$. We show this belief to be true for the case of Voronoi diagrams based on the $L_{1}$ (or $L_{\infty}$) metric; the number of changes is shown to be $O(n^{2} \alpha (n))$ where $\alpha(n)$ grows so slowly it is effectively a small constant for all reasonable values of $n$.

Date Issued
1993-05
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1348
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance