Output details
11 - Computer Science and Informatics
University of Birmingham
Computing with Abstract Matrix Structures
<12>This is the first computational approach to deal with matrices that are composed of abstract, symbolic regions, that is regions that are of variable size and contain elided elements. While previously researchers have attempted this topic only solutions for very restricted cases had been found (such as triangular matrices). This is the first time a working calculus has been devised that can deal with combinations of regions which are arbitrary convex polynomials, while handling all constraints on spatial relationships between these regions under addition and multiplication. The work has since been employed in handwriting and sketch based interfaces.