Eaves’ First Algorithm
- 413 Downloads
The first algorithms for u.s.c. mappings were developed by Hansen and Scarf . However, it is more natural for us to use triangulations rather than primitive sets, and hence we will describe Eaves’ algorithm [10,12]. Section 1 introduces the crucial notions of vector labelling and complete simplices. Section 2 describes how the problem to be solved, based on V.3.1, is set up. In Section 3 we define a graph Γ similar to the graph Γn of Chapter III. Eaves’ algorithm is presented in Section 4.
Unable to display preview. Download preview PDF.