2000 character limit reached
Closed-form Quadrangulation of N-Sided Patches
Published 27 Jan 2021 in cs.GR and cs.CG | (2101.11569v2)
Abstract: We analyze the problem of quadrangulating a $n$-sided patch, each side at its boundary subdivided into a given number of edges, using a single irregular vertex (or none, when $n = 4$) that breaks the otherwise fully regular lattice. We derive, in an analytical closed-form, (1) the necessary and sufficient conditions that a patch must meet to admit this quadrangulation, and (2) a full description of the resulting tessellation(s).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.