美国数学建模竞赛特等奖论文——1995 A O A Specialized Root-Finding Method【数学建模】.pdfVIP

A Specialized Root-Finding Method 209 A Specialized Root-Finding Method for Rapidly Determining the Intersections of a Plane and a Helix Matthew Evans Andrew Flint Noah Kubow Harvey Mudd College Claremont, CA 91711 {mevans, aflint, nkubow}@hmc.edu Advisor: David L. Bosley Introduction Our problem is to locate all of the intersections between a helix and a plane that are in general position. The problem statement leaves several potentially significant parameters unspecified. In the most general case, solutions may be entirely intractable. Certainly, such cases would be computationally difficult and therefore in- appropriate for real-time simulations. At the onset of our investigation, we made the following assumptions: • Software application. The problem is motivated by a desire to predict intersections using computer software, and therefore any solution should be proposed as if it were the computational engine for a larger package. We further assume that all relevant information about the plane and helix is passed into this engine from the user interface. • Nonzero tolerance. The engine should be expected to locate approxi- mate points of intersection within a certain numerical tolerance. Exact solutions are not required for graphical applications. Particularly when a rapid sequence of solutions is desired, the tolerance should increase, to minimize computation time. • Frame-by-frame animation. We approach the problem of real-time sim- ulation as a finite sequence of discrete static instances of the general prob- lem. For example, a 90◦ rotation of the plane is simulated by a handful of fixed relative orientations, which the engine solves sequentially. Each solution set is then used to construct a single frame in the sequence, which is animated for the user in real time. 210 The UMAP Journal 16.3 • Nondegenerate, r