CIM algorithm for approximating three-dimensional polygonal curves

DOI10.1007/BF02943239zbMATH Open1013.68272MaRDI QIDQ5956845FDOQ5956845

Authors: J.-H. Yong, Shimin Hu, Jiaguang Sun 

Publication date: 9 July 2003

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Recommendations

• Efficient algorithms for 3-D polygonal approximation based on LISE criterion
• Approximating Polygonal Curves in Two and Three Dimensions
• Efficient algorithms for approximating polygonal chains
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Efficiently approximating polygonal paths in three and higher dimensions

zbMATH Keywords

cone intersection methodpolygonal approximation problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• A note on minimal length polygonal approximation to a digitized contour
• Polygonal approximation by the minimax method
• Approximating Polygonal Curves in Two and Three Dimensions

Cited In (3)

• APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS
• Efficient algorithms for 3-D polygonal approximation based on LISE criterion
• Adaptive geometry compression based on four-point interpolatory subdivision schemes with labels

This page was built for publication: CIM algorithm for approximating three-dimensional polygonal curves

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