arrow
返回

PolyCut: Monotone Graph-Cuts for PolyCube Base-Complex Construction

delete2013-11-01
delete87
PRE
AI
M
Marco Livesu *
N
Nicholas Vining
A
Alla Sheffer
J
James Gregson
R
Riccardo Scateni
DOI:10.1145/2508363.2508388delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
PolyCubes, or orthogonal polyhedra, are useful as parameterization base-complexes for various operations in computer graphics. However, computing quality PolyCube base-complexes for general shapes, providing a good trade-off between mapping distortion and singularity counts, remains a challenge. Our work improves on the state-of-the-art in PolyCube computation by adopting a graph-cut inspired approach. We observe that, given an arbitrary input mesh, the computation of a suitable PolyCube base-complex can be formulated as associating, or labeling, each input mesh triangle with one of six signed principal axis directions. Most of the criteria for a desirable PolyCube labeling can be satisfied using a multi-label graph-cut optimization with suitable local unary and pairwise terms. However, the highly constrained nature of PolyCubes, imposed by the need to align each chart with one of the principal axes, enforces additional global constraints that the labeling must satisfy. To enforce these constraints, we develop a constrained discrete optimization technique, PolyCut, which embeds a graph-cut multi-label optimization within a hill-climbing local search framework that looks for solutions that minimize the cut energy while satisfying the global constraints. We further optimize our generated PolyCube base-complexes through a combination of distortion-minimizing deformation, followed by a labeling update and a final PolyCube parameterization step. Our PolyCut formulation captures the desired properties of a PolyCube base-complex, balancing parameterization distortion against singularity count, and produces demonstrably better PolyCube base-complexes then previous work.
Keyword:
PolyCube
mesh parameterization
mesh segmentation
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

ACM Transactions on Graphics 封面图
ACM Transactions on Graphics
IF:
9.5
论文数:
4.8K
被引数:
3.6W

机构

U
university of cagliari
学者数:
1.2W
论文数: 9.7K
被引数: 9
U
University of British Columbia
学者数:
7.0W
论文数: 6.1W
被引数: 8.6W
引用论文

引用论文

err分享
err收藏
Treatment, prognostic markers and survival in thymic neuroendocrine tumours. A study from a single tertiary referral centre
err2013-03-01
err0
PREAI
errJoakim Crona; Peyman Bjrklund; Staffan Welin; Gordana Kozlovacki; Kjell berg; Dan Granberg
err分享
err收藏
The mid-lateral cerebellum is necessary for reinforcement learning
err
IF0
err2020-03-21
err0
errOAAI
errNaveen Sendhilnathan; Michael E. Goldberg
err分享
err收藏
Furin cleavage of SARS-CoV-2 Spike promotes but is not essential for infection and cell-cell fusion
err
IF0
err2020-08-14
err0
errOAAI
errGuido Papa; Donna L. Mallery; Anna Albecka; Lawrence Welch; Jérôme Cattin-Ortolá; Jakub Luptak; David Paul; Harvey T. McMahon; Ian G. Goodfellow; Andrew Carter; Sean Munro; Leo C. James
err分享
err收藏
学者 查看更多内容