Symbolic Computation: Parker Edwards, University of Notre Dame, Feature Sizes and Bottlenecks for Algebraic Manifolds
SAS 4201In computational topology and geometry, theoretical guarantees for algorithms often take the following form: Start with a finite sample of points from a subspace of . If the sample is "dense…