Abstract
It is an outstanding open problem of computational geometry to prove a near-quadratic upper bound on the number of combinatorial changes in the Voronoi diagram of points moving at a common constant speed along linear trajectories in the plane. In this note we observe that this quantity is Θ( n 2) if the points start their movement from a common line.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have