Computational geometry: an introduction
Computational geometry: an introduction
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
A practical evaluation of kinetic data structures
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Interval methods for kinetic simulations
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Data structures for mobile data
Journal of Algorithms
Adaptive functional programming
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric and Kinetic Minimum Spanning Trees
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Computational geometry.
Kinetic data structures
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An empirical comparison of techniques for updating Delaunay triangulations
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Self-adjusting computation
An experimental analysis of self-adjusting computation
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Kinetic and dynamic data structures for convex hulls and upper envelopes
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Kinetic 3D convex hulls via self-adjusting computation
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Imperative self-adjusting computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Memory management for self-adjusting computation
Proceedings of the 7th international symposium on Memory management
Compiling self-adjusting programs with continuations
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
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
Self-adjusting computation: (an overview)
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Self-adjusting computation with Delta ML
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
| Hi-index | 0.00 |
Define a static algorithm as an algorithm that computes some combinatorial property of its input consisting of static, i.e., non-moving, objects. In this paper, we describe a technique for syntactically transforming static algorithms into kinetic algorithms, which compute properties of moving objects. The technique offers capabilities for composing kinetic algorithms, for integrating dynamic and kinetic changes, and for ensuring robustness even with fixed-precision floating-point arithmetic. To evaluate the effectiveness of the approach, we implement a library for performing the transformation, transform a number of algorithms, and give an experimental evaluation. The results show that the technique performs well in practice.