Optimal hierarchies for quadrilateral surfaces (Q1868504): Difference between revisions

The paper concerns the quadrilateral surface approximation problem in 3D. In order to find a quadrilateral surface to approximate a given quadrilateral surface with a given error tolerance, the authors transform this problem into that of solving a sequence of near-Toeplitz tridiagonal linear systems. A matrix perturbation technique is used. An algorithm for surface approximation problem is proposed. It is proved that the algorithm is stable and the problem for polygonal surface with \((2m-1)x(2n-1)\) points can be solved using about \(24 mn\) floating-point operations. Finally, some experimental results are presented.