A Computational Framework for Handling Motion

We present a framework for implementing geometric algorithms involving motion. It is written in C++ and modeled after and makes extensive use of CGAL (Computational Geometry Algorithms Library) [4]. The framework allows easy implementation of kinetic data structure style geometric algorithms--ones in which the combinatorial structure changes only at discrete times corresponding to roots of functions of the motions of the primitives. This paper discusses the architecture of the framework and how to use it. We also briefly present a polynomial package we wrote, that supports exact and filtered comparisons of real roots of polynomials and is extensively used in the framework. We plan to include our framework in the next release of CGAL.

• Type: Conference
• Year: 2004
• Where: ALENEX
• Authors: Leonidas J. Guibas, Menelaos I. Karavelas, Daniel Russel
• Keywords: ALENEX 2004, ALENEX 2007, Algorithms Involving Motion, Combinatorial Structure Changes, Computational Geometry Algorithms Library