Abstract
Computational experience has shown that the efficiency of variable dimension restart algorithms on Sn and on \(S\, = \,\prod\nolimits_{j\, = \,1}^N S ^{n_j }\) depends heavily on the underlying subdivision or triangulation of these sets. A well known triangulation of Sn is the Q-triangulation. Other triangulations of Sn include the iterated barycentric triangulation and a triangulation which is closely related to the Union Jack triangulation of Rn (see Todd [1976b]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Doup, T.M. (1988). Triangulations of Sn and S. In: Simplicial Algorithms on the Simplotope. Lecture Notes in Economics and Mathematical Systems, vol 318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46651-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-46651-9_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50233-3
Online ISBN: 978-3-642-46651-9
eBook Packages: Springer Book Archive