No Arabic abstract
We investigate discrete spin transformations, a geometric framework to manipulate surface meshes by controlling mean curvature. Applications include surface fairing -- flowing a mesh onto say, a reference sphere -- and mesh extrusion -- e.g., rebuilding a complex shape from a reference sphere and curvature specification. Because they operate in curvature space, these operations can be conducted very stably across large deformations with no need for remeshing. Spin transformations add to the algorithmic toolbox for pose-invariant shape analysis. Mathematically speaking, mean curvature is a shape invariant and in general fully characterizes closed shapes (together with the metric). Computationally speaking, spin transformations make that relationship explicit. Our work expands on a discrete formulation of spin transformations. Like their smooth counterpart, discrete spin transformations are naturally close to conformal (angle-preserving). This quasi-conformality can nevertheless be relaxed to satisfy the desired trade-off between area distortion and angle preservation. We derive such constraints and propose a formulation in which they can be efficiently incorporated. The approach is showcased on subcortical structures.
This paper introduces three sets of sufficient conditions, for generating bijective simplicial mappings of manifold meshes. A necessary condition for a simplicial mapping of a mesh to be injective is that it either maintains the orientation of all elements or flips all the elements. However, these conditions are known to be insufficient for injectivity of a simplicial map. In this paper we provide additional simple conditions that, together with the above mentioned necessary conditions guarantee injectivity of the simplicial map. The first set of conditions generalizes classical global inversion theorems to the mesh (piecewise-linear) case. That is, proves that in case the boundary simplicial map is bijective and the necessary condition holds then the map is injective and onto the target domain. The second set of conditions is concerned with mapping of a mesh to a polytope and replaces the (often hard) requirement of a bijective boundary map with a collection of linear constraints and guarantees that the resulting map is injective over the interior of the mesh and onto. These linear conditions provide a practical tool for optimizing a map of the mesh onto a given polytope while allowing the boundary map to adjust freely and keeping the injectivity property in the interior of the mesh. The third set of conditions adds to the second set the requirement that the boundary maps are orientation preserving as-well (with a proper definition of boundary map orientation). This set of conditions guarantees that the map is injective on the boundary of the mesh as-well as its interior. Several experiments using the sufficient conditions are shown for mapping triangular meshes. A secondary goal of this paper is to advocate and develop the tool of degree in the context of mesh processing.
Origami structures enabled by folding and unfolding can create complex 3D shapes. However, even a small 3D shape can have large 2D unfoldings. The huge initial dimension of the 2D flattened structure makes fabrication difficult, and defeats the main purpose, namely compactness, of many origami-inspired engineering. In this work, we propose a novel algorithmic kirigami method that provides super compaction of an arbitrary 3D shape with non-negligible surface thickness called algorithmic stacking. Our approach computationally finds a way of cutting the thick surface of the shape into a strip. This strip forms a Hamiltonian cycle that covers the entire surface and can realize transformation between two target shapes: from a super compact stacked shape to the input 3D shape. Depending on the surface thickness, the stacked structure takes merely 0.001% to 6% of the original volume. This super compacted structure not only can be manufactured in a workspace that is significantly smaller than the provided 3D shape, but also makes packing and transportation easier for a deployable application. We further demonstrate that, the proposed stackable structure also provides high pluripotency and can transform into multiple 3D target shapes if these 3D shapes can be dissected in specific ways and form a common stacked structure. In contrast to many designs of origami structure that usually target at a particular shape, our results provide a universal platform for pluripotent 3D transformable structures.
Let $M^n$ be a closed immersed hypersurface lying in a contractible ball $B(p,R)$ of the ambient $(n+1)$-manifold $N^{n+1}$. We prove that, by pinching Heintze-Reillys inequality via sectional curvature upper bound of $B(p,R)$, 1st eigenvalue and mean curvature of $M$, not only $M$ is Hausdorff close to a geodesic sphere $S(p_0,R_0)$ in $N$, but also the ``enclosed ball $B(p_0,R_0)$ is close to be of constant curvature, provided with a uniform control on the volume and mean curvature of $M$. We raise a conjecture for $M$ to be a diffeomorphic sphere, and give some positive partial answer.
We propose a mechanism whereby spin supercurrents can be manipulated in superconductor/ferromagnet proximity systems via nonequilibrium spin injection. We find that if a spin supercurrent exists in equilibrium, a nonequilibrium spin accumulation will exert a torque on the spins transported by this current. This interaction causes a new spin supercurrent contribution to manifest out of equilibrium, which is proportional to and polarized perpendicularly to both the injected spins and equilibrium spin current. This is interesting for several reasons: as a fundamental physical effect; due to possible applications as a way to control spin supercurrents; and timeliness in light of recent experiments on spin injection in proximitized superconductors.
Some methods based on simple regularizing geometric element transformations have heuristically been shown to give runtime efficient and quality effective smoothing algorithms for meshes. We describe the mathematical framework and a systematic approach to global optimization-bas