Name
Abstract | ||
|---|---|---|
We present a framework for implementing geometric algo- rithms involving motion. It is written in C++ and mod- eled after and makes extensive use of CGAL (Computational Geometry Algorithms Library) (4). The framework allows easy implementation of kinetic data structure style geomet- ric algorithms—ones in which the combinatorial structure changes only at discrete times corresponding to roots of func- tions 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. |
Year | Venue | Keywords |
|---|---|---|
2004 | ALENEX/ANALC | structural change,computational geometry,discrete time |
Field | DocType | Citations |
Mathematical optimization,Real roots,Polynomial,Kinetic data structure,Computer science,Computational geometry,Computational science,Computational model | Conference | 11 |
PageRank | References | Authors |
0.72 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leonidas J. Guibas | 1 | 13084 | 1262.73 |
| Menelaos I. Karavelas | 2 | 229 | 18.99 |
| Daniel Russel | 3 | 38 | 2.17 |