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.
Bibtex:
@article{wallner-2007-fw,
author = "J. Wallner and H. Pottmann and M. Hofer",
title = "Fair Webs",
journal = "The Visual Computer",
year = "2007",
volume = 23,
number = 1,
pages = "83-94",
url="http://www.geometrie.tuwien.ac.at/wallner/fairwebs.pdf",
doi="10.1007/s00371-006-0088-1",
}
|
|
