🤖 AI Summary
Recent progress in dynamic computational geometry has stagnated, primarily due to the lack of systematic frameworks for modeling both instantaneous and long-term geometric properties of moving point sets—contrasting sharply with well-established static paradigms.
Method: This paper introduces a spatiotemporal trajectory-based algorithmic framework for dynamic geometry, integrating motion modeling, geometric evolution analysis, and complexity-aware optimization techniques. It systematically designs efficient algorithms for fundamental dynamic problems—including convex hulls, nearest neighbors, and Voronoi diagrams—under continuous motion.
Contribution/Results: The work establishes the first comprehensive methodology for dynamic geometry, encompassing problem formalization, algorithm construction, and rigorous theoretical analysis. It significantly improves timeliness and scalability in maintaining geometric structures under dynamic updates. The framework provides a rigorous theoretical foundation and practical algorithmic tools for applications in autonomous driving, sensor networks, and spatiotemporal data analytics.
📝 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.