.png){kind=icon}
返回
Fair webs
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-006-0088-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fair webs are energy-minimizing curve networks. Obtained via an extension of cubic splines or splines in tension to networks of curves, they are efficiently computable and possess a variety of interesting applications. We present properties of fair webs and their discrete counterparts, i.e., fair polygon networks. Applications of fair curve and polygon networks include fair surface design and approximation under constraints such as obstacle avoidance or guaranteed error bounds, aesthetic remeshing, parameterization and texture mapping, and surface restoration in geometric models.
Keyword:
curve network
spline interpolation and approximation
variational surface design
curves in surfaces
aesthetic meshes
obstacle avoidance
texture mapping
mesh fairing
期刊
IF:
2.9
论文数:
4.6K
被引数:
6.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容