Algorithms for Dynamic Computational Geometry with Applications
Abstract
Most of the literature of computational geometry concerns geometric properties of sets of static points. M.J. Atallah introduced “dynamic computational geometry,” concerned with both momentary and long-term geometric properties of sets of moving point-objects. This area of research seems to have been dormant recently. The current paper examines new problems in dynamic computational geometry: the “Too Close,” “Too Far,” and “3 Aligned” problems. Worst-case optimal solutions are given for these problems using the sequential and coarse-grained multicomputer (CGM) models of computation.
Fields of Study & Subjects
Computational Geometry and Mesh Generation
Complexity and Algorithms in Graphs
Data Management and Algorithms
Publication details
- Journal / source
- Asian journal of mathematics and computer research
- Volume
- 33
- Issue
- 1
- Pages
- 15–28
- Publication date
- 4 February 2026
- Language
- EN