Optimal hierarchies for quadrilateral surfaces

DOI10.1023/A:1021603330228MaRDI QIDQ1868504zbMATH OpenFDO

Authors Yanyan Li

Publication date 27 April 2003

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1021603330228

zbMATH Keywords

algorithmmultiresolution representationnear-Toeplitz tridiagonal systemsnumerical examplesquadrilateral surfacestability analysis

Mathematics Subject Classification ID

Computer-aided design (modeling of curves and surfaces) (65D17)

Review text

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.

Recommendations

• Constrained polynomial approximation of quadric surfaces
• Continuous quadric patch approximation of curved surfaces
• \(C^{k}\) surface approximation from surface patches
• Maillage de surfaces paramétriques. Partie III: Éléments quadrangulaires
• Optimal triangulation and quadric-based surface simplification

This page was built for publication: Optimal hierarchies for quadrilateral surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1868504)