Fair webs |
| |
Authors: | Johannes Wallner Helmut Pottmann Michael Hofer |
| |
Affiliation: | (1) Institute of Discrete Mathematics and Geometry, Vienna University of Technology, Wiedner Hauptstr. 8–10/104, 1040 Wien, Austria |
| |
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. |
| |
Keywords: | Curve network Spline interpolation and approximation Variational surface design Curves in surfaces Aesthetic meshes Obstacle avoidance Texture mapping Mesh fairing |
本文献已被 SpringerLink 等数据库收录! |
|