Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 83-94 |
Number of pages | 12 |
Journal | Visual Computer |
Volume | 23 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2007 |
Externally published | Yes |
Keywords
- Aesthetic meshes
- Curve network
- Curves in surfaces
- Mesh fairing
- Obstacle avoidance
- Spline interpolation and approximation
- Texture mapping
- Variational surface design
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design