Many of Frontier's strengths rely on the degree-of-freedom-graph-based decomposition and recombination method called the Frontier Vertex Algorithm (FA) for geometric constraint systems. This algorithms applies equally well to 3d, although the sketcher user interface currently available with Frontier is restricted to 2d.
released on 1 January 1970
|License||Verified by||Verified on||Notes|
|GPLv2||Janet Casey||20 December 2001|
Leaders and contributors
Resources and communication
|Required to use||Maple V (or later)|
This entry (in part or in whole) was last reviewed on 10 July 2001.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.