arXiv subjects

Max Wardetzky

Publications and source records attributed to Max Wardetzky.

27 records · Page 2Linked to original sources

arXiv2016

Distortion estimates for barycentric coordinates on Riemannian simplices

We define barycentric coordinates on a Riemannian manifold using Karcher's center of mass technique applied to point masses for n+1 sufficiently close points, determining an n-dimensional Riemannian simplex defined as a "Karcher simplex." Specifically, a set of weights is mapped to the Riemannian center of mass for the corresponding point measures on the manifold with the given weights. If the points lie sufficiently close and in general position, this map is smooth and injective, giving a coordinate chart. We are then able to compute first and second derivative estimates of the coordinate chart. These estimates allow us to compare the Riemannian metric with the Euclidean metric induced on a simplex with edge lengths determined by the distances between the points. We show that these metrics differ by an error that shrinks quadratically with the maximum edge length. With such estimates, one can deduce convergence results for finite element approximations of problems on Riemannian manifolds.

math.NA↗

arXiv2016

On the incompressibility of cylindrical origami patterns

The art and science of folding intricate three-dimensional structures out of paper has occupied artists, designers, engineers, and mathematicians for decades, culminating in the design of deployable structures and mechanical metamaterials. Here we investigate the axial compressibility of origami cylinders, i.e., cylindrical structures folded from rectangular sheets of paper. We prove, using geometric arguments, that a general fold pattern only allows for a finite number of \emph{isometric} cylindrical embeddings. Therefore, compressibility of such structures requires either stretching the material or deforming the folds. Our result considerably restricts the space of constructions that must be searched when designing new types of origami-based rigid-foldable deployable structures and metamaterials.

physics.comp-ph↗

arXiv2015

Persistence Barcodes versus Kolmogorov Signatures: Detecting Modes of One-Dimensional Signals

We investigate the problem of estimating the number of modes (i.e., local maxima) - a well known question in statistical inference - and we show how to do so without presmoothing the data. To this end, we modify the ideas of persistence barcodes by first relating persistence values in dimension one to distances (with respect to the supremum norm) to the sets of functions with a given number of modes, and subsequently working with norms different from the supremum norm. As a particular case we investigate the Kolmogorov norm. We argue that this modification has certain statistical advantages. We offer confidence bands for the attendant Kolmogorov signatures, thereby allowing for the selection of relevant signatures with a statistically controllable error. As a result of independent interest, we show that taut strings minimize the number of critical points for a very general class of functions. We illustrate our results by several numerical examples.

math.ST↗

arXiv2015

Elasticity of 3D networks with rigid filaments and compliant crosslinks

Disordered filamentous networks with compliant crosslinks exhibit a low linear elastic shear modulus at small strains, but stiffen dramatically at high strains. Experiments have shown that the elastic modulus can increase by up to three orders of magnitude while the networks withstand relatively large stresses without rupturing. Here, we perform an analytical and numerical study on model networks in three dimensions. Our model consists of a collection of randomly oriented rigid filaments connected by flexible crosslinks that are modeled as wormlike chains. Due to zero probability of filament intersection in three dimensions, our model networks are by construction prestressed in terms of initial tension in the crosslinks. We demonstrate how the linear elastic modulus can be related to the prestress in these network. Under the assumption of affine deformations in the limit of infinite crosslink density, we show analytically that the nonlinear elastic regime in 1- and 2-dimensional networks is characterized by power-law scaling of the elastic modulus with the stress. In contrast, 3-dimensional networks show an exponential dependence of the modulus on stress. Independent of dimensionality, if the crosslink density is finite, we show that the only persistent scaling exponent is that of the single wormlike chain. We further show that there is no qualitative change in the stiffening behavior of filamentous networks even if the filaments are bending-compliant. Consequently, unlike suggested in prior work, the model system studied here cannot provide an explanation for the experimentally observed linear scaling of the modulus with the stress in filamentous networks.

physics.bio-ph↗

arXiv2014

A discrete parametrized surface theory in R^3

We propose a discrete surface theory in $\mathbb R^3$ that unites the most prevalent versions of discrete special parametrizations. This theory encapsulates a large class of discrete surfaces given by a Lax representation and, in particular, the one-parameter associated families of constant curvature surfaces. The theory is not restricted to integrable geometries, but extends to a general surface theory.

math.DG↗

arXiv2012

Geodesics in Heat

We introduce the heat method for computing the shortest geodesic distance to a specified subset (e.g., point or curve) of a given domain. The heat method is robust, efficient, and simple to implement since it is based on solving a pair of standard linear elliptic problems. The method represents a significant breakthrough in the practical computation of distance on a wide variety of geometric domains, since the resulting linear systems can be prefactored once and subsequently solved in near-linear time. In practice, distance can be updated via the heat method an order of magnitude faster than with state-of-the-art methods while maintaining a comparable level of accuracy. We provide numerical evidence that the method converges to the exact geodesic distance in the limit of refinement; we also explore smoothed approximations of distance suitable for applications where more regularity is required.

cs.GR↗

arXiv2012

A discrete geometric approach for simulating the dynamics of thin viscous threads

We present a numerical model for the dynamics of thin viscous threads based on a discrete, Lagrangian formulation of the smooth equations. The model makes use of a condensed set of coordinates, called the centerline/spin representation: the kinematical constraints linking the centerline's tangent to the orientation of the material frame is used to eliminate two out of three degrees of freedom associated with rotations. Based on a description of twist inspired from discrete differential geometry and from variational principles, we build a full-fledged discrete viscous thread model, which includes in particular a discrete representation of the internal viscous stress. Consistency of the discrete model with the classical, smooth equations is established formally in the limit of a vanishing discretization length. The discrete models lends itself naturally to numerical implementation. Our numerical method is validated against reference solutions for steady coiling. The method makes it possible to simulate the unsteady behavior of thin viscous jets in a robust and efficient way, including the combined effects of inertia, stretching, bending, twisting, large rotations and surface tension.

physics.flu-dyn↗

arXiv2010

Optimal topological simplification of discrete functions on surfaces

We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance δ from a given input function. The result is achieved by establishing a connection between discrete Morse theory and persistent homology. Our method completely removes homological noise with persistence less than 2δ, constructively proving the tightness of a lower bound on the number of critical points given by the stability theorem of persistent homology in dimension two for any input function. We also show that an optimal solution can be computed in linear time after persistence pairs have been computed.

cs.CG↗

arXiv2009

Uniform convergence of discrete curvatures from nets of curvature lines

We study discrete curvatures computed from nets of curvature lines on a given smooth surface, and prove their uniform convergence to smooth principal curvatures. We provide explicit error bounds, with constants depending only on properties of the smooth limit surface and the shape regularity of the discrete net.

math.DG↗