Abstract
Let P be a collection of n points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic bound, on the maximum number of discrete changes that the Delaunay triangulation DT(P) of P experiences during the motion of the points of P. In this paper we obtain an upper bound of O(n2+e), for any e>0, under the assumptions that (i) any four points can be co-circular at most twice, and (ii) either no ordered triple of points can be collinear more than once, or no triple of points can be collinear more than twice.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
