A triangulation of the n-cube

@article{Sallee1982ATO,
  title={A triangulation of the n-cube},
  author={John F. Sallee},
  journal={Discrete Mathematics},
  year={1982},
  volume={40},
  pages={81-86}
}
In 1967, H. Scarf developed a finite algorithm for approximating a fixed point; of a continuous mapping of a simplex into itse9f [8]. This algorithm was refned and extended by H. Kuhn, B.C. Eaves and 0. Merrill, among others. (See Karamardian [4] and Todd [lo] for tlSesc: and oth,er references.) Several algorithms use a technique of pivoting amlong, simplices which triangulate an n-cube, and there is some hope that reducing the number of simplices in a triangulation may lead to more efficient… CONTINUE READING

From This Paper

Topics from this paper.