The continuity of weak solutions of elliptic partial differential equations $$div \mathcal{A}(x,\nabla u) = 0$$ is considered under minimal structure assumptions. The main result guarantees the continuity at the point$x$_{0}for weakly monotone weak solutions if the structure of$A$is controlled in a sequence of annuli $$B(x_0 ,R_j )\backslash \bar B(x_0 ,r_j )$$ with uniformly bounded ratio$R$_{$j$}$/r$_{$j$}such that lim_{$j→∞$}$R$_{$j$}=0. As a consequence, we obtain a sufficient condition for the continuity of mappings of finite distortion.

We show that it is possible to perturb arbitrary vacuum asymptotically flat spacetimes to new ones having exactly the same energy and linear momentum, but with center of mass and angular momentum equal to any preassigned values measured with respect to a fixed affine frame at infinity. This is in contrast to the axisymmetric situation where a bound on the angular momentum by the mass has been shown to hold for black hole solutions. Our construction involves changing the solution at the linear level in a shell near infinity, and perturbing to impose the vacuum constraint equations. The procedure involves the perturbation correction of an approximate solution which is given explicitly.

This work presents a technique that allows quick conversion of acquired low-quality data from consumer-level scanning devices to high-quality 3D models with labeled semantic parts and meanwhile their assembly reasonably close to the underlying geometry. This is achieved by a novel structure recovery approach that is essentially local to global and bottom up, enabling the creation of new structures by assembling existing labeled parts with respect to the acquired data. We demonstrate that using only a small-scale shape repository, our part assembly approach is able to faithfully recover a variety of high-level structures from only a single-view scan of man-made objects acquired by the Kinect system, containing a highly noisy, incomplete 3D point cloud and a corresponding RGB image.

In this paper, two explicit conversion formulae between triangular and rectangular Bézier patches are derived. Using the formulae, one triangular Bézier patch of degree n can be converted into one rectangular Bézier patch of degree $n \times n$. And one rectangular Bézier patch of degree m × n can be converted into two triangular Bézier patches of degree $m + n$ . Besides, two stable recursive algorithms corresponding to the two conversion formulae are given. Using the algorithms, when converting triangular Bézier patches to rectangular Bézier patches, we can computer the relations between the control points of the two types of patches for any $n\ge2$ based on the relationships for $n=1$. When converting rectangular Bézier patches to triangular Bézier patches, we can computer the relations between the control points of the two types of patches for any $m\ge 2, n \subset N^+ $ and $n \ge 2, m \subset N^+$ based on the relationships for $m=n=1$.

We address the registration problem of genus-one surfaces (such as vertebrae bones) with prescribed landmark constraints. The high-genus topology of the surfaces makes it challenging to obtain a unique and bijective surface mapping that matches landmarks consistently. This work proposes to tackle this registration problem using a special class of quasi-conformal maps called Teichmüller maps (T-Maps). A landmark constrained T-Map is the unique mapping between genus-1 surfaces that minimizes the maximal conformality distortion while matching the prescribed feature landmarks. Existence and uniqueness of the landmark constrained T-Map are theoretically guaranteed. This work presents an iterative algorithm to compute the T-Map. The main idea is to represent the set of diffeomorphism using the Beltrami coefficients (BC). The BC is iteratively adjusted to an optimal one, which corresponds to our desired T-Map that matches the prescribed landmarks and satisfies the periodic boundary condition on the universal covering space. Numerical experiments demonstrate the effectiveness of our proposed algorithm. The method has also been applied to register vertebrae bones with prescribed landmark points and curves, which gives accurate surface registrations.