The derivation of multilinear forms used to compute the moments of sets bounded by subdivision surfaces requires solving a number of systems of linear equations. As the support of the subdivision mask or the degree of the moment grows, the corresponding linear system becomes intractable to construct, let alone to solve by Gaussian elimination. In the paper, we argue that the power iteration and the geometric series are feasible methods to approximate the multilinear forms. The tensor iterations investigated in this work are shown to converge at favorable rates, achieve arbitrary numerical accuracy, and have a small memory footprint. In particular, our approach makes it possible to compute the volume, centroid, and inertia of spatial domains bounded by Catmull-Clark and Loop subdivision surfaces.
Comments: 5 Pages.
[v1] 2017-03-28 08:30:43
Unique-IP document downloads: 13 times
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.