Polygonal path approximation with angle constraints

MaRDI QIDQ2768318zbMATH OpenFDO

Authors Danny Z. Chen, Ovidiu Daescu, Peter M. Kogge, Jack Snoeyink, John Hershberger

Publication date 30 January 2002

zbMATH Keywords

\(n\)-vertex polygonal path

Mathematics Subject Classification ID

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

Recommendations

• Polygonal path simplification with angle constraints
• Algorithms and Computation
• Efficiently approximating polygonal paths in three and higher dimensions
• Distance-preserving approximations of polygonal paths
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cited in

(8)

• Improved approximation bounds for the minimum constraint removal problem
• Farthest-point queries with geometric and combinatorial constraints
• Polygonal path simplification with angle constraints
• On the Complexity of Universality for Partially Ordered NFAs
• Improved approximation bounds for the minimum constraint removal problem
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Area-preserving approximations of polygonal paths
• Distance-preserving approximations of polygonal paths

This page was built for publication: Polygonal path approximation with angle constraints

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