Computer Science – Computational Geometry
Scientific paper
2010-05-06
Computer Science
Computational Geometry
A preliminary version accepted to SoCG 2010
Scientific paper
We present a simple randomized scheme for triangulating a set $P$ of $n$ points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of $P$ move continuously along piecewise algebraic trajectories of constant description complexity. Our triangulation scheme experiences an expected number of $O(n^2\beta_{s+2}(n)\log^2n)$ discrete changes, and handles them in a manner that satisfies all the standard requirements from a kinetic data structure: compactness, efficiency, locality and responsiveness. Here $s$ is the maximum number of times where any specific triple of points of $P$ can become collinear, $\beta_{s+2}(q)=\lambda_{s+2}(q)/q$, and $\lambda_{s+2}(q)$ is the maximum length of Davenport-Schinzel sequences of order $s+2$ on $n$ symbols. Thus, compared to the previous solution of Agarwal et al.~\cite{AWY}, we achieve a (slightly) improved bound on the number of discrete changes in the triangulation. In addition, we believe that our scheme is simpler to implement and analyze.
Kaplan Haim
Rubin Natan
Sharir Micha
No associations
LandOfFree
A Kinetic Triangulation Scheme for Moving Points in The Plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Kinetic Triangulation Scheme for Moving Points in The Plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Kinetic Triangulation Scheme for Moving Points in The Plane will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-25772