Fair webs

Authors:
Johannes Wallner;Helmut Pottmann;Michael Hofer
Affiliations:
Vienna University of Technology, Institute of Discrete Mathematics and Geometry, Wiedner Hauptstr. 8–10/104, 1040, Wien, Austria;Vienna University of Technology, Institute of Discrete Mathematics and Geometry, Wiedner Hauptstr. 8–10/104, 1040, Wien, Austria;Vienna University of Technology, Institute of Discrete Mathematics and Geometry, Wiedner Hauptstr. 8–10/104, 1040, Wien, Austria
Venue:
The Visual Computer: International Journal of Computer Graphics
Year:
2006

Citing 0
Cited 3

Note on curve and surface energies

Computer Aided Geometric Design
Nonparametric Regression between General Riemannian Manifolds

SIAM Journal on Imaging Sciences
Magnetism and minimal surfaces: a different tool for surface design

Computational Aesthetics'07 Proceedings of the Third Eurographics conference on Computational Aesthetics in Graphics, Visualization and Imaging

Quantified Score

Hi-index	0.00

Visualization

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.