Simpler Quad Layouts using Relaxed Singularities

Computer Graphics Forum, vol. 40, pp. 169–180

Abstract

Abstract A common approach to automatic quad layout generation on surfaces is to, in a first stage, decide on the positioning of irregular layout vertices, followed by finding sensible layout edges connecting these vertices and partitioning the surface into quadrilateral patches in a second stage. While this two‐step approach reduces the problem's complexity, this separation also limits the result quality. In the worst case, the set of layout vertices fixed in the first stage without consideration of the second may not even permit a valid quad layout. We propose an algorithm for the creation of quad layouts in which the initial layout vertices can be adjusted in the second stage. Whenever beneficial for layout quality or even validity, these vertices may be moved within a prescribed radius or even be removed. Our algorithm is based on a robust quantization strategy, turning a continuous T‐mesh structure into a discrete layout. We show the effectiveness of our algorithm on a variety of inputs.

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