No abstract uploaded!

No abstract uploaded!

We prove an estimate on the smallest singular value of a multiplicatively and additively deformed random rectangular matrix. Suppose $n\le N \le M \le dN$ for some constant $d\ge 1$. Let $X$ be an $M\times n$ random matrix with independent and identically distributed entries, which have zero mean, unit variance and arbitrarily high moments. Let $T$ be an $N\times M$ deterministic matrix with comparable singular values $c\le s_{N}(T) \le s_{1}(T) \le c^{-1}$ for some constant $c>0$. Let $A$ be an $N\times n$ deterministic matrix with $\|A\|=O(\sqrt{N})$. Then we prove that for any $\epsilon>0$, the smallest singular value of $TX-A$ is larger than $N^{-\epsilon}(\sqrt{N}-\sqrt{n-1})$ with high probability. If we assume further the entries of $X$ have subgaussian decay, then the smallest singular value of $TX-A$ is at least of the order $\sqrt{N}-\sqrt{n-1}$ with high probability, which is an essentially optimal estimate.

In this paper we present a new algorithm which turns an unstructured triangle mesh into a quad dominant mesh with edges well aligned to the principal directions of the underlying surface. Instead of computing a globally smooth parameterization or integrating curvature lines along a tangent vector field, we simply apply an iterative relaxation scheme which incrementally aligns the mesh edges to the principal directions. We further obtain the quad dominant mesh by dropping the not-aligned diagonal edges from the triangle mesh. A post-processing stage is introduced to further improve the results. The major advantage of our algorithm is its conceptual simplicity since it is merely based on elementary mesh operations such as edge collapse, flip, and split. Various results are presented in the paper; they show a good alignment to surface features and rather uniform distribution of mesh vertices. This makes them well suited, e.g., as CatmullClark Subdivision control meshes.

No abstract uploaded!