SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS

DOI10.1142/S0218195903001074zbMath1152.68662WikidataQ57425868 ScholiaQ57425868MaRDI QIDQ4818542

No author found.

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

mappinglinear programmingerror boundssurface approximationorthogonal projectionsimplificationlevels-of-detail

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (1)

Isotopic approximation within a tolerance volume

Uses Software

• Armadillo
• Metro

Cites Work

• Unnamed Item
• Unnamed Item
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS