标题:Combinatorial Construction of Seamless Parameter Domains
作者:Zhou, J.; Tu, C.; Zorin, D.; Campen, M.
通讯作者:Zhou, J
作者机构:[Zhou, J.; Tu, C.] Shandong Univ, Jinan, Shandong, Peoples R China.; [Zorin, D.] NYU, New York, NY 10003 USA.; [Campen, M.] Osnabruck Univ, Osnabr 更多
会议名称:41st Annual Conference of the European-Association-for-Computer-Graphics (EUROGRAPHICS)
会议日期:MAY 25-29, 2020
来源:COMPUTER GRAPHICS FORUM
出版年:2020
卷:39
期:2
页码:179-190
DOI:10.1111/cgf.13922
关键词:CCS Concepts; . Computing methodologies -> Computer graphics; Mesh; models; Mesh geometry models; Shape modeling
摘要:The problem of seamless parametrization of surfaces is of interest in the context of structured quadrilateral mesh generation and spline-based surface approximation. It has been tackled by a variety of approaches, commonly relying on continuous numerical optimization to ultimately obtain suitable parameter domains. We present a general combinatorial seamless parameter domain construction, free from the potential numerical issues inherent to continuous optimization techniques in practice. The domains are constructed as abstract polygonal complexes which can be embedded in a discrete planar grid space, as unions of unit squares. We ensure that the domain structure matches any prescribed parametrization singularities (cones) and satisfies seamlessness conditions. Surfaces of arbitrary genus are supported. Once a domain suitable for a given surface is constructed, a seamless and locally injective parametrization over this domain can be obtained using existing planar disk mapping techniques, making recourse to Tutte's classical embedding theorem.
收录类别:CPCI-S;EI;SCOPUS;SCIE
资源类型:会议论文;期刊论文
原文链接:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087745132&doi=10.1111%2fcgf.13922&partnerID=40&md5=6de4e33800349caad1b26d6f96edb4a9
TOP