# Stiefel manifolds and polygons.

@article{Shonkwiler2019StiefelMA, title={Stiefel manifolds and polygons.}, author={C. Shonkwiler}, journal={arXiv: History and Overview}, year={2019} }

Polygons are compound geometric objects, but when trying to understand the expected behavior of a large collection of random polygons -- or even to formalize what a random polygon is -- it is convenient to interpret each polygon as a point in some parameter space, essentially trading the complexity of the object for the complexity of the space. In this paper I describe such an interpretation where the parameter space is a Stiefel manifold and show how to exploit the geometry of the Stiefel… Expand

#### References

SHOWING 1-10 OF 11 REFERENCES

The Geometry of Algorithms with Orthogonality Constraints

- Physics, Mathematics
- SIAM J. Matrix Anal. Appl.
- 1998

Discrete Frenet frame, inflection point solitons, and curve visualization with applications to folded proteins.

- Mathematics, Biology
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2011

Numerical methods for computing angles between linear subspaces

- Mathematics, Computer Science
- Milestones in Matrix Computation
- 2007