.png){kind=icon}
Return
Fair webs
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-006-0088-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
curve network
spline interpolation and approximation
variational surface design
curves in surfaces
aesthetic meshes
obstacle avoidance
texture mapping
mesh fairing
Journal
IF:
2.9
Papers:
4.6K
Citations:
6.5K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
ShareSave
View more