Applications of Chebyshev polynomials to low-dimensional computational geometry

DOI10.20382/JOCG.V9I2A2MaRDI QIDQ4626302zbMATH OpenFDO

Authors Timothy M. Chan

Publication date 27 February 2019

Full work available at URL https://doi.org/10.20382/JOCG.V9I2A2

Mathematics Subject Classification ID

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

Recommendations

• Applications of Chebyshev polynomials to low-dimensional computational geometry
• Near-optimal -kernel construction and related problems
• Chebyshev approximation to data by geometric elements
• scientific article; zbMATH DE number 665688
• Approximate calculation of the Chebyshev center for a convex compact set in \(\mathbb{R}^n\)

Cited in

(3)

• Chebyshev approximation to data by geometric elements
• Applications of Chebyshev polynomials to low-dimensional computational geometry
• From circuit complexity to faster all-pairs shortest paths

This page was built for publication: Applications of Chebyshev polynomials to low-dimensional computational geometry

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