Monday, January 3, 2011

So here is how my application works

You bring up a geography, and overlay existing known networks.  That is on one window.  The other window contains the maximal set of rank one maps, based on the dimensions displayed in the geography.  Like the road network, in the right the user gets a cannonical graph of rank one roads, presented as a Fib tree, ready to pick subsets. Lemme see, then the user can select a region, then slide a rank indicator, the Fib tree always finding the shortest rank Fib number to quantize that region over those dimensions.  The output is a Fib polynomial, the prime polynomial the user requested.

The user can do time and space separately or cojoint; and the same for separate dimensions, say roads, sewers, weather, housing density, wages, diners,...  The Fib you select tells you minimum load size for various trips around geography.

No comments: