Voronoi diagrams of moving points in the plane
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A Delaunay refinement algorithm for quality 2-dimensional mesh generation
SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Data structures for mobile data
Journal of Algorithms
Journal of the ACM (JACM)
Voronoi Diagrams of Moving Points in the Plane
WG '91 Proceedings of the 17th International Workshop
A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes
Discrete & Computational Geometry
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
Robust Kinetic Convex Hulls in 3D
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A cost semantics for self-adjusting computation
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Size complexity of volume meshes vs. surface meshes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
CEAL: a C-based language for self-adjusting computation
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
An experimental analysis of self-adjusting computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Deformable spanners and applications
Computational Geometry: Theory and Applications
Traceable data types for self-adjusting computation
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Kinetic stable Delaunay graphs
Proceedings of the twenty-sixth annual symposium on Computational geometry
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
Dynamic well-spaced point sets
Proceedings of the twenty-sixth annual symposium on Computational geometry
Parallelism in dynamic well-spaced point sets
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Hi-index | 0.00 |
We provide a kinetic data structure (KDS) to the planar kinetic mesh refinement problem, which concerns computation of meshes of continuously moving points. Our KDS computes the Delaunay triangulation of a size-optimal well-spaced superset of a set of moving points with algebraic trajectories of constant degree. Our KDS is compact, requiring linear space in the size of the output. It is local, using a point in O(log Delta) certificates. It is responsive, repairing itself in O(log Delta) time per event. It is efficient, processing O(n2 log3 Delta) events in the worst case; this is optimal up to a polylogarithmic factor. Also, our KDS is dynamic, responding to point insertions and deletions in O(log Delta) time. In our bounds Delta stands for the geometric spread, the ratio of the diameter to the closest pair distance. To the best of our knowledge, this is the first KDS for mesh refinement.