Name
Abstract | ||
|---|---|---|
We introduce a construction of subspaces of the spaces of tangential vector, n-vector, and tensor fields on surfaces. The resulting subspaces can be used as the basis of fast approximation algorithms for design and processing problems that involve tangential fields. Important features of our construction are that it is based on a general principle, from which constructions for different types of tangential fields can be derived, and that it is scalable, making it possible to efficiently compute and store large subspace bases for large meshes. Moreover, the construction is adaptive, which allows for controlling the distribution of the degrees of freedom of the subspaces over the surface. We evaluate our construction in several experiments addressing approximation quality, scalability, adaptivity, computation times and memory requirements. Our design choices are justified by comparing our construction to possible alternatives. Finally, we discuss examples of how subspace methods can be used to build interactive tools for tangential field design and processing tasks. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1111/cgf.13924 | COMPUTER GRAPHICS FORUM |
DocType | Volume | Issue |
Journal | 39.0 | 2.0 |
ISSN | Citations | PageRank |
0167-7055 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ahmad Nasikun | 1 | 1 | 1.37 |
| Christopher Brandt | 2 | 11 | 3.85 |
| Klaus Hildebrandt | 3 | 466 | 24.77 |