Simpler Quad Layouts using Relaxed Singularities

Lyon, Max; Campen, Marcel; Kobbelt, Leif

Simpler Quad Layouts using Relaxed Singularities

Files

v40i5pp169-179.pdf (31.12 MB)

cgf40-5_14365_ProjektDeal.pdf (31.2 MB)

Date

2021

Authors

Lyon, Max
Campen, Marcel
Kobbelt, Leif

Publisher

The Eurographics Association and John Wiley & Sons Ltd.

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.

        @article{10.1111:cgf.14365
,
journal = {Computer Graphics Forum},
title = {{Simpler Quad Layouts using Relaxed Singularities
}},
author = {Lyon, Max and 
Campen, Marcel and 
Kobbelt, Leif
},
year = {2021
},
publisher = {The Eurographics Association and John Wiley & Sons Ltd.
},
ISSN = {1467-8659
},
DOI = {10.1111/cgf.14365
}
}