期刊
ACM TRANSACTIONS ON GRAPHICS
卷 37, 期 4, 页码 -出版社
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3197517.3201375
关键词
cross fields; singularities; quad remeshing; digital geometry processing; resistance distance
资金
- European Research Council (ERC) [714776]
- Israel Science Foundation [504/16]
- European Research Council (ERC) [714776] Funding Source: European Research Council (ERC)
We propose a new iterative algorithm for computing smooth cross fields on triangle meshes that is simple, easily parallelizable on the GPU, and finds solutions with lower energy and fewer cone singularities than state-of-the-art methods. Our approach is based on a formal equivalence, which we prove, between two formulations of the optimization problem. This equivalence allows us to eliminate the real variables and design an efficient grid search algorithm for the cone singularities. We leverage a recent graph-theoretical approximation of the resistance distance matrix of the triangle mesh to speed up the computation and enable a trade-off between the computation time and the smoothness of the output.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据