v.3.2.0

• Polyarcular interval type implemented: the concave implementation (ciat.PolyarcularInterval) can exactly represent concave intervals bounded by edges and arcs, which includes all the other interval types and their sums. The products are not necessarily bounded by edges and arcs, so those intervals are approximated. The sum and multiply functions are fairly slow when the operands are concave because the result boundary has to be trimmed. The convex implementation (ciat.PolyarxInterval) is much faster and more accurate than the polygonal interval type, but less accurate than the concave polyarc. The convex implementation is optimized for the addition of polar intervals or polar-circular products, which is an important use-case in array tolerance analysis.
• The polygonal interval casting of polar-circular product has been improved.
• Some bugfix and a few utility functions