您当前所在位置: 首页 > 学者
在线提示

恭喜!关注成功

在线提示

确认取消关注该学者?

邀请同行关闭

只需输入对方姓名和电子邮箱,就可以邀请你的同行加入中国科技论文在线。

真实姓名:

电子邮件:

尊敬的

我诚挚的邀请你加入中国科技论文在线,点击

链接,进入网站进行注册。

添加个性化留言

已为您找到该学者12条结果 成果回收站

上传时间

2020年11月04日

【期刊论文】A Local/Global Approach to Mesh Parameterization

Computer Graphics Forum,2008,27(5):1495-1504

2008年12月29日

摘要

We present a novel approach to parameterize a mesh with disk topology to the plane in a shape‐preserving manner. Our key contribution is a local/global algorithm, which combines a local mapping of each 3D triangle to the plane, using transformations taken from a restricted set, with a global “stitch” operation of all triangles, involving a sparse linear system. The local transformations can be taken from a variety of families, e.g. similarities or rotations, generating different types of parameterizations. In the first case, the parameterization tries to force each 2D triangle to be an as‐similar‐as‐possible version of its 3D counterpart. This is shown to yield results identical to those of the LSCM algorithm. In the second case, the parameterization tries to force each 2D triangle to be an as‐rigid‐as‐possible version of its 3D counterpart. This approach preserves shape as much as possible. It is simple, effective, and fast, due to pre‐factoring of the linear system involved in the global phase. Experimental results show that our approach provides almost isometric parameterizations and obtains more shape‐preserving results than other state‐of‐the‐art approaches. We present also a more general “hybrid” parameterization model which provides a continuous spectrum of possibilities, controlled by a single parameter. The two cases described above lie at the two ends of the spectrum. We generalize our local/global algorithm to compute these parameterizations. The local phase may also be accelerated by parallelizing the independent computations per triangle.

0

上传时间

2020年11月04日

【期刊论文】Non-iterative approach for global mesh optimization

Computer-Aided Design,2007,39(9):772-782

2007年09月01日

摘要

This paper presents a global optimization operator for arbitrary meshes. The global optimization operator is composed of two main terms, one part is the global Laplacian operator of the mesh which keeps the fairness and another is the constraint condition which reserves the fidelity to the mesh. The global optimization operator is formulated as a quadratic optimization problem, which is easily solved by solving a sparse linear system. Our global mesh optimization approach can be effectively used in at least three applications: smoothing the noisy mesh, improving the simplified mesh, and geometric modeling with subdivision-connectivity. Many experimental results are presented to show the applicability and flexibility of the approach.

0

合作学者

  • 暂无合作作者