Simpler Quad Layouts using Relaxed Singularities

Autor(en): Lyon, M.
Campen, M. 
Kobbelt, L.
Stichwörter: <bold>CCS Concepts</bold>; <bold>Mesh geometry models</bold>; center dot <bold>Computing methodologies</bold> -> <bold>Computer graphics; Computer Science; Computer Science, Software Engineering; Mesh models</bold>; Shape modeling
Erscheinungsdatum: 2021
Herausgeber: WILEY
Volumen: 40
Ausgabe: 5
Startseite: 169
Seitenende: 179
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.
Symposium on Geometry Processing, ELECTR NETWORK, JUL 12-14, 2021
ISSN: 01677055
DOI: 10.1111/cgf.14365

Show full item record

Page view(s)

Last Week
Last month
checked on Feb 23, 2024

Google ScholarTM