In this paper, we address the problem of constraint detection for layout regularization. The layout we consider is a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important in digitizing plans or images, such as floor plans and facade images, and in the improvement of user-created contents, such as architectural drawings and slide layouts. To regularize a layout, we aim to improve the input by detecting and subsequently enforcing alignment, size, and distance constraints between layout elements. Similar to previous work, we formulate layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm that automatically detects constraints. We evaluate the proposed framework using a variety of input layouts from different applications. Our results demonstrate that our method has superior performance to

We extend our family rigidity and vanishing theorems in [{\bf LiuMaZ}] to the Spin^ c case. In particular, we prove a K-theory version of the main results of [{\bf H}],[{\bf Liu1}, Theorem B] for a family of almost complex manifolds.

Oprateur de signature sur les varits avec une strate singulire conique

In\cite {21}, Boltje and Maisch found a permutation complex of Specht modules in representation theory of Hecke algebras, which is the same as the Boltje-Hartmann complex appeared in the representation theory of symmetric groups and general linear groups. In this paper we prove the exactness of Boltje-Maisch complex in the dominant weight case.

We prove that the first Chern form of the moduli space of polarized Calabi-Yau manifolds, with the Hodge metric or the Weil-Petersson metric, represent the first Chern class of the canonical extensions of the tangent bundle to the compactification of the moduli space with normal crossing divisors.