| 783 | | --------------------------------------------------------------------------------------------------- |
| 784 | | == Boost.Msm == |
| 785 | | * '''Author(s):''' Christophe Henry |
| 786 | | * '''Version:''' 1.10 |
| 787 | | * '''State:''' Accepted, not yet incorporated |
| 788 | | * '''Last upload:''' |
| 789 | | * '''Links:''' [http://www.boostpro.com/vault/index.php?action=downloadfile&filename=Msm1.10.zip&directory=Msm&PHPSESSID=96307fee8086c06036af42fae790b449 Boost Vault][http://svn.boost.org/svn/boost/sandbox/msm Boost Sandbox] |
| 790 | | * '''Categories:''' [#DataStructures Data Structures] |
| 791 | | * '''Description:''' Msm is a framework which enables you to build a Finite State Machine in a straightforward, descriptive and easy-to-use manner . It requires minimal effort to generate a working program from an UML state machine diagram. This work was inspired by the state machine described in the book of David Abrahams and Aleksey Gurtovoy “C++ Template Metaprogramming” and adds most of what UML Designers are expecting from an UML State Machine framework(entry/exit actions, guards, composite states, orthogonal zones, history...). |
| 846 | | --------------------------------------------------------------------------------------------------- |
| 847 | | == Boost.Polygon == |
| 848 | | * '''Author(s):''' Simonson, Lucanus J |
| 849 | | * '''Version:''' v0.1 |
| 850 | | * '''State:''' Accepted, not yet incorporated |
| 851 | | * '''Last upload:''' 2009 February 17 |
| 852 | | * '''Links:''' [http://svn.boost.org/svn/boost/sandbox/gtl Boost Sanbox] |
| 853 | | * '''Categories:''' [#MathAndNumerics Math And Numerics] |
| 854 | | * '''Description:''' The boost polygon library provides algorithms focused on manipulating planar polygon geometry data. Specific algorithms provided are the polygon set operations (intersection, union, difference, disjoint-union) and related algorithms such as polygon connectivity graph extraction, offsetting and map-overlay. An example of the disjoint-union (XOR) of figure a and figure b is shown below in figure c. These so-called Boolean algorithms are of significant interest in GIS (Geospatial Information Systems), VLSI CAD as well al other fields of CAD, and many more application areas, and providing them is the primary focus of this library. The polygon library is not intended to cover all of computational geometry in its scope, and provides a set of capabilities for working with coordinates, points, intervals and rectangles that are needed to support implementing and interacting with polygon data structures and algorithms. Specifically, 3d and non-Cartesian/non-planar geometry is outside of the scope of the polygon library. |
