Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Triangulating Smooth Submanifolds with Light Scaffolding

Triangulating Smooth Submanifolds with Light Scaffolding We propose an algorithm to sample and mesh a k-submanifold $${\mathcal{M}}$$ of positive reach embedded in $${\mathbb{R}^{d}}$$ . The algorithm first constructs a crude sample of $${\mathcal{M}}$$ . It then refines the sample according to a prescribed parameter $${\varepsilon}$$ , and builds a mesh that approximates $${\mathcal{M}}$$ . Differently from most algorithms that have been developed for meshing surfaces of $${\mathbb{R} ^3}$$ , the refinement phase does not rely on a subdivision of $${\mathbb{R} ^d}$$ (such as a grid or a triangulation of the sample points) since the size of such scaffoldings depends exponentially on the ambient dimension d. Instead, we only compute local stars consisting of k-dimensional simplices around each sample point. By refining the sample, we can ensure that all stars become coherent leading to a k-dimensional triangulated manifold $${\hat{\mathcal{M}}}$$ . The algorithm uses only simple numerical operations. We show that the size of the sample is $${O(\varepsilon ^{-k})}$$ and that $${\hat{\mathcal{M}}}$$ is a good triangulation of $${\mathcal{M}}$$ . More specifically, we show that $${\mathcal{M}}$$ and $${\hat{\mathcal{M}}}$$ are isotopic, that their Hausdorff distance is $${O(\varepsilon ^{2})}$$ and that the maximum angle between their tangent bundles is $${O(\varepsilon )}$$ . The asymptotic complexity of the algorithm is $${T(\varepsilon) = O(\varepsilon ^{-k^2-k})}$$ (for fixed $${\mathcal{M}, d}$$ and k). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

Triangulating Smooth Submanifolds with Light Scaffolding

Loading next page...
 
/lp/springer-journals/triangulating-smooth-submanifolds-with-light-scaffolding-rZwZCn7zMi

References (43)

Publisher
Springer Journals
Copyright
Copyright © 2011 by Springer Basel AG
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-011-0066-5
Publisher site
See Article on Publisher Site

Abstract

We propose an algorithm to sample and mesh a k-submanifold $${\mathcal{M}}$$ of positive reach embedded in $${\mathbb{R}^{d}}$$ . The algorithm first constructs a crude sample of $${\mathcal{M}}$$ . It then refines the sample according to a prescribed parameter $${\varepsilon}$$ , and builds a mesh that approximates $${\mathcal{M}}$$ . Differently from most algorithms that have been developed for meshing surfaces of $${\mathbb{R} ^3}$$ , the refinement phase does not rely on a subdivision of $${\mathbb{R} ^d}$$ (such as a grid or a triangulation of the sample points) since the size of such scaffoldings depends exponentially on the ambient dimension d. Instead, we only compute local stars consisting of k-dimensional simplices around each sample point. By refining the sample, we can ensure that all stars become coherent leading to a k-dimensional triangulated manifold $${\hat{\mathcal{M}}}$$ . The algorithm uses only simple numerical operations. We show that the size of the sample is $${O(\varepsilon ^{-k})}$$ and that $${\hat{\mathcal{M}}}$$ is a good triangulation of $${\mathcal{M}}$$ . More specifically, we show that $${\mathcal{M}}$$ and $${\hat{\mathcal{M}}}$$ are isotopic, that their Hausdorff distance is $${O(\varepsilon ^{2})}$$ and that the maximum angle between their tangent bundles is $${O(\varepsilon )}$$ . The asymptotic complexity of the algorithm is $${T(\varepsilon) = O(\varepsilon ^{-k^2-k})}$$ (for fixed $${\mathcal{M}, d}$$ and k).

Journal

Mathematics in Computer ScienceSpringer Journals

Published: Sep 1, 2011

There are no references for this article.