Quad Layouts via Constrained T‐Mesh Quantization

Computer Graphics Forum, vol. 40, pp. 305–314

Abstract

Abstract We present a robust and fast method for the creation of conforming quad layouts on surfaces. Our algorithm is based on the quantization of a T‐mesh, i.e. an assignment of integer lengths to the sides of a non‐conforming rectangular partition of the surface. This representation has the benefit of being able to encode an infinite number of layout connectivity options in a finite manner, which guarantees that a valid layout can always be found. We carefully construct the T‐mesh from a given seamless parametrization such that the algorithm can provide guarantees on the results' quality. In particular, the user can specify a bound on the angular deviation of layout edges from prescribed directions. We solve an integer linear program (ILP) to find a coarse quad layout adhering to that maximal deviation. Our algorithm is guaranteed to yield a conforming quad layout free of T‐junctions together with bounded angle distortion. Our results show that the presented method is fast, reliable, and achieves high quality layouts.

Authors 2

1. Marcel Campen

   Osnabrück University

   Affiliation as printed

   Osnabrück University Germany

2. Leif P. Kobbelt Aachen

   RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University Germany

   RWTH Aachen University, Germany