KAUST DepartmentVisual Computing Center (VCC)
Permanent link to this recordhttp://hdl.handle.net/10754/578820
MetadataShow full item record
AbstractIn this paper, we address the problem of constraint detection for layout regularization. As layout we consider a set of two-dimensional elements where each element is represented by its bounding box. Layout regularization is important for digitizing plans or images, such as floor plans and facade images, and for 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 the layout regularization as a quadratic programming problem. In addition, we propose a novel optimization algorithm to automatically detect constraints. In our results, we evaluate the proposed framework on a variety of input layouts from different applications, which demonstrates our method has superior performance to the state of the art.
CitationAutomatic Constraint Detection for 2D Layout Regularization 2015:1 IEEE Transactions on Visualization and Computer Graphics