Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Boissonnat, S. Oudot (2006)
Provably good sampling and meshing of Lipschitz surfaces
Xiangyang Li (2001)
Generating well-shaped d-dimensional Delaunay MeshesTheor. Comput. Sci., 296
U. Abresch, W.T. Meyer (1997)
Comparison Geometry.
K. Clarkson (2006)
Building triangulations using ε-nets
Joachim Giesen, Uli Wagner (2004)
Shape Dimension and Intrinsic Metric from Samples of ManifoldsDiscrete & Computational Geometry, 32
F. Cazals, Joachim Giesen (2006)
Delaunay Triangulation Based Surface Reconstruction
Rule 3 Type-1 sliver : If there exists a k -simplex τ of Del T M ( P ) that is a sliver or has a subsimplex that is a sliver, insert x = good-pick ( τ, δ )
H. Edelsbrunner (2001)
Geometry and Topology for Mesh Generation, 7
(1957)
Centre de recherche INRIA Sophia Antipolis -Méditerranée
la Haute Borne -40, avenue Halley -59650 Villeneuve d'Ascq Centre de recherche INRIA Nancy -Grand Est : LORIA, Technopôle de Nancy-Brabois -Campus scientifique 615
J. Boissonnat, Camille Wormser, M. Yvinec (2008)
Locally uniform anisotropic meshing
S. Cairns (1961)
A simple triangulation method for smooth manifoldsBulletin of the American Mathematical Society, 67
J. Ruppert (1995)
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh GenerationJ. Algorithms, 18
H. Whitney (1957)
Geometric Integration Theory
F. Linton, J. Munkres (1967)
Elementary Differential Topology.
T. O’Neil (2002)
Geometric Measure Theory
P. Gruber (1993)
Asymptotic estimates for best and stepwise approximation of convex bodies I, 5
P. Niyogi, S. Smale, S. Weinberger (2008)
Finding the Homology of Submanifolds with High Confidence from Random SamplesDiscrete & Computational Geometry, 39
Siu-Wing Cheng, T. Dey, E. Ramos (2005)
Manifold reconstruction from point samples
R. Dudley (1974)
Metric Entropy of Some Classes of Sets with Differentiable BoundariesJournal of Approximation Theory, 10
Joseph Fu (1993)
Convergence of curvatures in secant approximationsJournal of Differential Geometry, 37
Triangulating
Praveen Bhaniramka, R. Wenger, R. Crawfis (2004)
Isosurface construction in any dimension using convex hullsIEEE Transactions on Visualization and Computer Graphics, 10
J. Whitehead (1940)
On C 1 -ComplexesAnnals of Mathematics, 41
J. Boissonnat, S. Oudot (2005)
Provably good sampling and meshing of surfacesGraph. Model., 67
L. Chew (1997)
Guaranteed-quality Delaunay meshing in 3D (short version)
J.H.C. Whitehead (1940)
On C 1-complexesAnn. Math., 41
(1990)
Tubes
Chohong Min (2003)
Simplicial isosurfacing in arbitrary dimension and codimensionJournal of Computational Physics, 190
P. Gruber (1993)
Asymptotic estimates for best and stepwise approximation of convex bodies II, 5
T. Dey, Kuiyu Li
Topology from Data via Geodesic Complexes∗
(1990)
Geometry 2
F. Cazals, J. Giesen (2006)
Effective Computational Geometry for Curve and Surfaces
G. Kamenev (2008)
The initial convergence rate of adaptive methods for polyhedral approximation of convex bodiesComputational Mathematics and Mathematical Physics, 48
U. Abresch, Wolfgang Meyer (1997)
Injectivity Radius Estimates and Sphere Theorems
J. Cheeger, M. Gromov, Michael Taylor (1982)
Finite propagation speed, kernel estimates for functions of the Laplace operator, and the geometry of complete Riemannian manifoldsJournal of Differential Geometry, 17
J. Boissonnat, Julia Flötotto (2004)
A coordinate system associated with points scattered on a surfaceComput. Aided Des., 36
P. Gruber (2004)
Optimum Quantization and Its ApplicationsAdvances in Mathematics, 186
G. Peyré, L. Cohen (2005)
Geodesic Computations for Fast and Accurate Surface Remeshing and Parameterization
M. Henderson (2002)
Multiple Parameter Continuation: Computing Implicitly Defined k-ManifoldsInt. J. Bifurc. Chaos, 12
Joachim Giesen, Uli Wagner (2003)
Shape dimension and intrinsic metric from samples of manifolds with high co-dimension
N. Amenta, Sunghee Choi, T. Dey, Naveen Leekha (2000)
A simple algorithm for homeomorphic surface reconstructionInt. J. Comput. Geom. Appl., 12
(1959)
Curvature Measures
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).
Mathematics in Computer Science – Springer Journals
Published: Sep 1, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.