TL;DR
This paper explores patterns in triangulated 2- and 3-spheres, providing a new proof of a key lemma in the recognition algorithm for 3-spheres, advancing understanding of their combinatorial structures.
Contribution
It introduces a novel proof of a lemma crucial to the recognition algorithm for 3-spheres, enhancing theoretical understanding.
Findings
New proof of a key lemma in 3-sphere recognition
Deeper insight into patterns in triangulated spheres
Potential implications for algorithms in topological recognition
Abstract
Patterns in triangulated -spheres and -spheres are investigated. A new proof of a lemma in Abigail Thompson's proof of the Recognition Algorithm for -spheres is obtained.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Digital Image Processing Techniques · Topological and Geometric Data Analysis